Study on Improved Genetic Algorithm for Min-Max Vehicle Routing Problem

Chun Yu Ren

doi:10.4028/www.scientific.net/AMR.225-226.1266

Paper Titles

Research on Powertrain Production Line Modeling and Design
p.1250

Size Estimation of Tomato Fruits Based on Spectroscopic Analysis
p.1254

Prediction of Soil TN and TC at a Farm-Scale Using VIS-NIR Spectroscopy
p.1258

The Application of Red Mud on Restoring Heavy Metal Contaminated Water and Soil
p.1262

Study on Improved Genetic Algorithm for Min-Max Vehicle Routing Problem
p.1266

Stability Criterion of Discrete Hopfield Neural Networks with Multiple Delays in Parallel Mode: Linear Matrix Inequality
p.1270

The Existence of Analytic Invariant Curves for a Planar Map
p.1274

A Solution Method for Engineering Equilibrium Mathematics Modeling under Mild Conditions
p.1279

The Study of New Trend for DSC Scene Effects Technology
p.1284

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 225-226Study on Improved Genetic Algorithm for Min-Max...

Study on Improved Genetic Algorithm for Min-Max Vehicle Routing Problem

Abstract:

The present study is focused on the Min-Max Vehicle Routing Problem (MMVRP). Improved 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; retain the best selection so as to guard the diversity of group; adopt self-adaptive method to strengthen the partial searching ability of chromosome. Finally, the good performance of improved algorithm can be proved by experiment calculation and concrete examples.

You might also be interested in these eBooks

Advanced Research on Automation, Communication, Architectonics and Materials

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 225-226)

Pages:

1266-1269

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.225-226.1266

Citation:

Cite this paper

Online since:

April 2011

Authors:

Chun Yu Ren

Keywords:

Improved Genetic Algorithm (IGA), MMVRP, Natural Coding, Retain the Best Selection, Self-Adaptive Method

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Liu Xia. Research on Vehicle Routing Problem. PhD thesis of Huazhong University of Science and Technology, (2007), pp.24-44.

Google Scholar

[2] Arkin E.M., Hassin R., Levin A. Approximations for minimum and min-max vehicle routing problems. Algorithms archive, Vol. 59(2006), pp.1-18.

DOI: 10.1016/j.jalgor.2005.01.007

Google Scholar

[3] Ozdamar, L., Wei Yi. Greedy Neighborhood Search for Disaster Relief and Evacuation Logistics. Intelligent Systems, Vol. 23(2008), pp.14-23.

DOI: 10.1109/mis.2008.7

Google Scholar

[4] Esther M. Arkin, Refael Hassin, Asaf Levin. Approximations for Minimum and Min-max Vehicle Routing Problems. Journal of Algorithms, Vol. 59(2006), pp.1-16.

DOI: 10.1016/j.jalgor.2005.01.007

Google Scholar

[5] David Applegate; William Cook; Sanjeeb Dash; Andre Rohe. Solution of a min-max vehicle routing problem. INFORMS Journal on Computing, Vol. 14(2002), pp.132-143.

DOI: 10.1287/ijoc.14.2.132.118

Google Scholar

[6] A. Corberan, E. Fernandez, M. Laguna, R. Marti. Heuristic solutions to the problem of routing school buses with multiple objectives, Journal of the Operational Research Society, Vol. 53(2002), pp.427-435.

DOI: 10.1057/palgrave.jors.2601324

Google Scholar