Paper Titles

Optimal Design of Semi-Trailer Frame Based on Topology Optimization
p.502

Gene Expression Programming Based Classification for Automated Birth Defects Detection
p.508

Analysis of High Dimensionality Yeast Gene Expression Data Using Data Mining
p.515

Information Organization of Augmented Reality Maintenance Guiding System
p.523

A Shuffled Frog Leaping Algorithm for Solving Vehicle Routing Problem
p.529

Analysis of the GI/Geo/c Queue with Working Vacations
p.534

Research on Software Reliability Based on Forecasting Model Combined by LS-SVM and Markov Chain
p.542

The Study of System Model Based on Fuzzy Inference and Neural Network
p.547

Optimal Design of Hierarchical Spam Filtering Method Based on Greylisting
p.553

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vol. 197A Shuffled Frog Leaping Algorithm for Solving...

A Shuffled Frog Leaping Algorithm for Solving Vehicle Routing Problem

Article Preview

Abstract:

For vehicle routing problem, its model is easy to state and difficult to solve. The shuffled frog leaping algorithm is a novel meta-heuristic optimization approach and has strong quickly optimal searching power. The paper applies herein this algorithm to solve the vehicle routing problem; presents a high-efficiency encoding method based on the nearest neighborhood list; improves evolution strategies of the algorithm in order to keep excellent characteristics of the best frog. This proposed algorithm provides a new idea for solving VRP.

You might also be interested in these eBooks

Applied Sciences and Engineering

Info:

Periodical:

Applied Mechanics and Materials (Volume 197)

Pages:

529-533

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.197.529

Citation:

Cite this paper

Online since:

September 2012

Authors:

Kai Ping Luo

Keywords:

Optimization, Shuffled Frog Leaping Algorithm (SFLA), Vehicle Routing Problem (VRP)

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Dantzig G, Ramser J. The truck dispatching problem[J]. Management science, Vol. 6. pp.80-91. (1959).

DOI: 10.1287/mnsc.6.1.80

[2] Laporte G，Mercure H，Nobert Y, An exact algorithm for the asymmetrical capacitated vehicle routing problem[J], Networks, Vol. 16. p.33~46. (1986).

DOI: 10.1002/net.3230160104

[3] Gendreau M., Hertz A., Laporte G. A tabu search heuristic for the vehicle routing problem. Management Science, Vol. 40. pp.1276-1290. (1994).

DOI: 10.1287/mnsc.40.10.1276

[4] Baker Barrie M., Ayechew, M. A., A genetic algorithm for the vehicle routing problem, Computers &Operations Search, Vol. 30. pp.787-800. (2003).

DOI: 10.1016/s0305-0548(02)00051-5

[5] Osman H., Meta strategy simulated annealing and tabu search algorithms for the vehicle routing problem, Operations Research, Vol. 41. pp.160-166. (1993).

DOI: 10.1007/bf02023004

[6] Baker E., J R Schaffer., Solution improvement heuristics for the vehicle routing and scheduling problems with time-window constraints, American Journal of Mathematical and Management Science, Vol. 6. pp.261-300, (1986).

DOI: 10.1080/01966324.1986.10737197

[7] Wu Zengyuan, Wu Xiaobo, Fang Gang, et al. A two-phase heuristic algorithm to solve the large-scale vehicle routing problem. International Technology and Innovation Conference, pp.2316-2320. (2006).

DOI: 10.1049/cp:20061159

[8] Zhong SQ, Wang, XL. A kernel route tabu search algorithm for large-scale integrated vehicle routing problem. Pacific-Asia workshop on computational intelligence and industrial application, Vol 1. pp.1583-1587. (2008).

DOI: 10.1109/paciia.2008.284

[9] Cao EB, Lai MY. Solving the large-scale vehicle routing problem by location based heuristic & genetic algorithm. Proceeding of the 2006 International Conference on Management of Logistics and Supply Chain : 406-410. (2006).

[10] Zeng H， Wu YH，Zhang DY，Li J. A hybrid algorithm for large-scale vehicle routing problem in real traffic condition. IEEE international conference on automation and logistics. Vol 1. pp.2238-2242. (2007).

DOI: 10.1109/ical.2007.4338948

[11] He RH, Xu WB, Sun JX, Zu BQ. Balanced K-Means Algorithm for Partitioning Areas in Large-Scale Vehicle Routing Problem. Third international symposium on intelligent information technology application. Vol 3. pp.87-90 (2009).

DOI: 10.1109/iita.2009.307

[12] Feiyue Lia, Bruce Goldenb, Edward Wasilc. Very large-scale vehicle routing: new test problems, algorithms, and results. Computers & Operations Research. Vol. 32. pp.1165-1179. (2005).

DOI: 10.1016/j.cor.2003.10.002

[13] Feiyue Lia, Bruce Goldenb, Edward Wasilc. The open vehicle routing problem: Algorithms, large-scale test problems, and computational results. Computers & operations research. Vol. 34. pp.2918-2930. (2007).

DOI: 10.1016/j.cor.2005.11.018

[14] Ostertag A, Doerner KF, Hartl RF, Taillard ED, Waelti P. POPMUSIC for a real-world large-scale vehicle routing problem with time windows. Journal of the Operational Research Society. Vol. 60. pp.934-943, (2009).

DOI: 10.1057/palgrave.jors.2602633

[15] Peng JZ, Yang JJ. A Hybrid Heuristic Algorithm for Large Scale. second international conference on intelligent computation technology and automation, Vol 3. pp.899-902. (2009).

[16] Muzaffar M. Eusuff, Kevin E. Lansey. Optimization of Water Distribution Network Design Using the Shuffled Frog Leaping Algorithm. Vol. 129. pp.210-225. (2003).

DOI: 10.1061/(asce)0733-9496(2003)129:3(210)

[17] Beasley JE. OR-Library: distributing test problems by electronic mail. Journal of the Operational Research Society. Vol. 41. p.1069–1072. (1990).

DOI: 10.1057/jors.1990.166

[18] Gillett B E, Miller LR. A heuristic algorithm for the vehicle dispatch problem. Operations Research. Vol. 22. p.340–349. (1974).

DOI: 10.1287/opre.22.2.340

[19] Fisher ML, Jaikumar R. A generalized assignment heuristic for vehicle routing. Networks. Vol. 11. p.109–24. (1981).

DOI: 10.1002/net.3230110205