Abstract
The present study is focused on the Min-Max Vehicle Routing Problem. According to the characteristics of model, hybrid genetic algorithm is used to get the optimization solution. First of all, use natural number coding so as to simplify the problem; apply insertion method so as to improve the feasibility of the solution; retain the best selection so as to guard the diversity of group. The study adopts 2- exchange mutation operator, combine hill-climbing algorithm to strengthen the partial searching ability of chromosome. At last, it uses simulated experiments to prove the effectiveness and feasibility of this algorithm, and provides clues for massively solving practical problems.
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
Haghania, A., Jung, S.: A dynamic vehicle routing problem with time dependent travel times. Computers & Operations Research 32, 2959–2986 (2005)
Bent, R., Van Hentenryck, P.: A two-stage hybrid local search for the vehicle routing problem with time windows. Transportation Science 38, 515–530 (2004)
Alfredo, F., Dieguez, R.: A tabu search algorithm for the vehicle routing problem with pick up and delivery service. Computers & Operations Research 33, 595–619 (2006)
Molloy, M., Reed, B.: A Bound on the Strong Chromatic Index of a Graph. Journal of Combinatorial Theory, Series B 69, 103–109 (1997)
Carlsson, J., Ge, D., Subramaniam, A., Wu, A., Ye, Y.: Solving min-max multi-depot vehicle routing problem. Report (2007)
Arkin, E.M., Hassin, R., Levin, A.: Approximations for Minimum and Min-max Vehicle Routing Problems. Journal of Algorithms, 1–16 (2005)
Applegate, D., Cook, W., Dash, S., Rohe, A.: Solution of a min-max vehicle routing problem. INFORMS Journal on Computing 14, 132–143 (2002)
Xia, L.: Research on Vehicle Routing Problem. PhD thesis of Huazhong University of Science and Technology, pp.24-44 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ren, C. (2011). Research on Hybrid Genetic Algorithm for Min-Max Vehicle Routing Problem. In: Shen, G., Huang, X. (eds) Advanced Research on Computer Science and Information Engineering. CSIE 2011. Communications in Computer and Information Science, vol 153. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21411-0_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-21411-0_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21410-3
Online ISBN: 978-3-642-21411-0
eBook Packages: Computer ScienceComputer Science (R0)