Abstract
This research presents a two phase heuristic - evolutionary combined algorithmic approach to solve multiple-depot routing problem with heterogeneous vehicles. It has been derived from embedding a heuristic-based two level clustering algorithm within a MDVRP optimization framework. In logistic applications, customers have priority based on some logistic point of view. The priority levels of customers, affect distribution strategy specially in clustering level. In this research we have developed an integrated VRP model using heuristic clustering method and a genetic algorithm, GA, of which operators and initial population are improved. In the first phase of the algorithm, a high level heuristic clustering is performed to cluster customers serviced by a special depot. Next, a low level clustering is done for each depot to find clusters serviced by a single vehicle. Likewise other optimization approaches, the new formulation can efficiently solve case studies involving at most 25 nodes to optimality. To overcome this limitation, a preprocessing stage which clusters nodes together is initially performed to yield a more compact cluster-based problem formulation. In this way, a hierarchical hybrid procedure involving one heuristic and one evolutionary phase was developed.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Jean-Charles Créput and Abderrafiaâ Koukam .The memetic self-organizing map approach to the vehicle routing problem . Springer-Verlag Soft Comput ,2008.
Rodolfo Dondo and Jaime Cerda. A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows. European Journal of Operational Research 176 , 2007.
S. Salhi and R. J. Petch. A GA Based Heuristic for the Vehicle Routing Problem with Multiple Trips. Springer Science, Business Media , 2007.
Chung-Ho Wang a, Jiu-Zhang Lu . A hybrid genetic algorithm that optimizes capacitated vehicle routing problems. Elsevier, Expert Systems with Applications ,2008.
Christian Prins. A simple and effective evolutionary algorithm for the vehicle routing problem. Elsevier, Computers & Operations Research 31,2004.
István Borgulya. An algorithm for the capacitated vehicle routing problem with route balancing. Springer-Verlag, 2008.
K. Ganesh, T.T. Narendran. CLOVES: A cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up. European Journal of Operational Research 178,2006.
Caroline Prodhon, Solving the capacitated location routing problem,Springer Verlag, 2001.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer Science+Business Media B.V.
About this paper
Cite this paper
Haghighi, M.M.S., Hadi Zahedi, M., Ghazizadeh, M. (2010). A multi level priority clustering GA based approach for solving heterogeneous Vehicle Routing Problem (PCGVRP). In: Sobh, T. (eds) Innovations and Advances in Computer Sciences and Engineering. Springer, Dordrecht. https://doi.org/10.1007/978-90-481-3658-2_57
Download citation
DOI: https://doi.org/10.1007/978-90-481-3658-2_57
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-3657-5
Online ISBN: 978-90-481-3658-2
eBook Packages: EngineeringEngineering (R0)