Fast Tabu Search Algorithm for Capacitated Vehicle Routing Problem

Chun Yu Ren

doi:10.4028/www.scientific.net/AMR.760-762.1790

Paper Titles

Design of the B/S Model-Based Automated Course Scheduling System of Universities
p.1773

Single Point Blow-Up and Regional Blow-Up of Solutions for a Degenerate Semilinear Parabolic Equation
p.1777

Research on the Application of College Automated Course Scheduling System Based on Genetic Algorithm
p.1782

A Planning Algorithm with Temporal Constraints in the Working Procedures
p.1786

Fast Tabu Search Algorithm for Capacitated Vehicle Routing Problem
p.1790

Design and Implementation of Online Photos Collection of B/S Based Registration Systems
p.1794

Research of Personalized Information Service Based on Association Rules
p.1800

The Architecture of Digital Library Platform Based on Cloud Computing
p.1804

The Design and Research of Digital Service Platform Based on Semantic Web
p.1808

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 760-762Fast Tabu Search Algorithm for Capacitated Vehicle...

Fast Tabu Search Algorithm for Capacitated Vehicle Routing Problem

Abstract:

This paper studies the capacitated vehicle routing problem. According to the characteristics of model, fast tabu search algorithm is used to get the optimization solution from the overall situation. Firstly, it designs three operations for fastening the speed of convergence and efficiency. Finally, the good performance of this algorithm can be proved through a set of standard test problems.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 760-762)

Pages:

1790-1793

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.760-762.1790

Citation:

Cite this paper

Online since:

September 2013

Authors:

Chun Yu Ren

Keywords:

Capacitated Vehicle Routing Problem, Fast Tabu Search Algorithm, Three Operations

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] BRAMEL J, SIMCHI-LEVID. A location based heuristic for general routing problem. Operation Research, Vol. 43(1995), P. 649- 660.

DOI: 10.1287/opre.43.4.649

Google Scholar

[2] Bouthillier, G Crainic. A cooperative parallel metaheuristic for vehicle routing with time windows. Computer & Operation Research, Vol. 32(2005), pp.1685-1708.

DOI: 10.1016/j.cor.2003.11.023

Google Scholar

[3] Geonwook Jeon, Herman R Leep, Jae Young Shim. A vehicle routing problem solved by using a hybrid genetic algorithm. Computers & Industrial Engineering, Vol. 53(2007), pp.680-692.

DOI: 10.1016/j.cie.2007.06.031

Google Scholar

[4] Lysgaard J, Letchford A N, Eglese R W. A new branch-and-cut algorithm for the capacitated vehicle routing problem. Mathematical Programming, Vol. 100(2004), P. 423-445.

DOI: 10.1007/s10107-003-0481-8

Google Scholar

[5] ZHAO Yan-wei, PENG Dian-jun, ZHANG Jing-ling, WU Bin. Quantum evolutionary algorithm for capacitated vehicle routing problem. Systems Engineering-Theory & Practice, Vol. 29(2009), P. 159-166.

Google Scholar

[6] Wu B, Wang W L, Zhao Y W, Xu X L, Yang F Y. A novel real number encoding method of particle swarm optimization for vehicle routing problem. The 6th World Congress on Intelligent Control and Automation, VOLS1-12, Conference Processing, (2006).

DOI: 10.1109/wcica.2006.1712972

Google Scholar