Paper Info
Title
An Efficient Hybrid Soft Computing Approach to the Generalized Vehicle Routing Problem.
Abstract
The generalized vehicle routing problem (GVRP) is one of the challenging combinatorial optimization problems that finds a lot of practical applications. The GVRP is a natural extension of the classical vehicle routing problem (VRP) and it is an NP-hard optimization problem belonging to the class of generalized combinatorial optimization problems. The aim of this paper is to present a new approach to tackle this complex problem. Combining this approach with a genetic algorithm results an efficient hybrid soft computing technique for solving the generalized vehicle routing problem. The proposed algorithm is competitive with other heuristics published to date in both solution quality and computation time. The computational results for several benchmarks problems are reported and the results point out that our proposed algorithm is an appropriate method to explore the search space of this complex problem and leads to good solutions in a reasonable amount of time.
Year
DOI
Venue
2011
10.1007/978-3-642-19644-7_30
SOFT COMPUTING MODELS IN INDUSTRIAL AND ENVIRONMENTAL APPLICATIONS, 6TH INTERNATIONAL CONFERENCE SOCO 2011
Field
DocType
Volume
Vehicle routing problem,Mathematical optimization,Combinatorial optimization problem,Computer science,Generalized assignment problem,Theoretical computer science,Heuristics,Soft computing,Optimization problem,Genetic algorithm,Computation
Conference
87
ISSN
Citations 
PageRank 
1867-5662
2
0.43
References 
Authors
6
3
Name
Order
Citations
PageRank
Petrica C. Pop118327.86
Oliviu Matei24311.15
Honoriu Valean3178.28