A Computational Analysis of Heuristic Algorithms on Generalized Vehicle Routing Problem

We consider the NP-hard Generalized Vehicle Routing Problem (GVRP) in which given a partition of the nodes of a graph into node sets (clusters) we want to find the minimum cost delivery or collection routes, subject to capacity restrictions, from a given depot, visiting all the clusters and passing...

Full description

Saved in:
Bibliographic Details
Published inJournal of Computer Science and Control Systems Vol. 4; no. 1; p. 143
Main Authors Pop, Petrica, Matei, Oliviu, Burzu, Emil, Gyorodi, Cornelia
Format Journal Article
LanguageEnglish
Published Oradea University of Oradea 01.05.2011
Subjects
Clusters
Collection
Computation
Computer networks
Heuristic
Heuristic methods
Minimum cost
Optimization algorithms
Routing (telecommunications)
Vehicles
Online AccessGet full text

Cover

More Information
Summary:We consider the NP-hard Generalized Vehicle Routing Problem (GVRP) in which given a partition of the nodes of a graph into node sets (clusters) we want to find the minimum cost delivery or collection routes, subject to capacity restrictions, from a given depot, visiting all the clusters and passing through exactly one node from each of the clusters . Due to the complexity of the problem, researchers have focused on heuristic and metaheuristic algorithms for solving the GVRP. The aim of this paper is to present a computational analysis of heuristic algorithms for GVRP. [PUBLICATION ABSTRACT]
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:1844-6043
2067-2101