Abstract
To ensure customer satisfaction, companies must deliver their product safely and within a fixed time. However, it is difficult to determine an inexpensive delivery route when given a number of options. Therefore, an efficient vehicle delivery plan is necessary. Until now, studies of vehicle routes have generally focused on determining the shortest distance. However, vehicle capacity and traffic conditions are also important constraints. We propose using a modified genetic algorithm by considering traffic conditions as the most important constraint to establish an efficient delivery policy for companies. Our algorithm was tested for fourteen problems, and it showed efficient results.
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
Baker, B.M., Ayechew, M.A.: A Genetic Algorithm for the Vehicle Routing Problem. Computers & Operations Research 30, 787–800 (2003)
Cheng, R., Gen, M.: Genetic Algorithm and Engineering Design. John Wiley & Sons, New York (1996)
Prins, C.: A Simple and Effective Evolutionary Algorithm for the Vehicle Routing Problem. Computers & Operations Research 31, 1985–2002 (2004)
Christofides, N., Eilon, S.: An Algorithm for the Vehicle Dispatching Problem. Operational Research Quarterly 20(3), 309–318 (1969)
Clarke, G., Wright, J.: Scheduling of Vehicles from a Central Depot to a Number of Delivery Points. Operations Research 11(4), 568–581 (1963)
Dantzig, G.B., Ramser, J.H.: The Truck Dispatching Problem. Management Science 6(1), 80–91 (1959)
Dolce, J.: Fleet Management. McGraw-Hill, New York (1984)
Gaskell, T.J.: Bases for Vehicle Fleet Scheduling. Operational Research Quarterly 18(3), 281–295 (1967)
Gendreau, M., Hertz, A., Laporte, G.: A Tabu Search Heuristic for the Vehicle Routing Problem. Management Science 40(10), 1276–1290 (1994)
Hayes, R.L.: The Delivery Problem. Carnegie Institute of Technology, Graduate School of Industrial Administration, Pittsburgh, Report No. MSR 106 (1967)
Lee, C., Kim, S.: Parallel Genetic Algorithm for the Tardiness Job Scheduling Problem with General Penalty Weights. International Journal of Computers and Industrial Engineering 28, 231–243 (1995)
Toth, P., Vigo, D.: The Vehicle Routing Problem. Society for Industrial and Applied Mathematics, Philadelphia (2002)
Michalewicz, Z.: Genetic Algorithm + Data Structure = Evolution Programs. Springer, Heidelberg (1996)
The OR-Library, http://people.brunel.ac.uk/~mastjjb/jeb/info.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yoo, YS., Kim, JY. (2010). A Genetic Algorithm for Efficient Delivery Vehicle Operation Planning Considering Traffic Conditions. In: Taniar, D., Gervasi, O., Murgante, B., Pardede, E., Apduhan, B.O. (eds) Computational Science and Its Applications – ICCSA 2010. ICCSA 2010. Lecture Notes in Computer Science, vol 6017. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12165-4_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-12165-4_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12164-7
Online ISBN: 978-3-642-12165-4
eBook Packages: Computer ScienceComputer Science (R0)