Paper Titles
Intelligent Alarm Function Based on RIA Technology of Equipment Network Management Design and Implement
p.3043
Saliency Detection Algorithm Based on Watershed Method and Regional Spatial Attention Model
p.3047
Research on Image Sharpness Evaluation
p.3051
Sentiment Analysis Based on Micro Blog Hot Topics
p.3056
Tabu Search Algorithm for for Capacitated Vehicle Routing Problem
p.3060
An Action Classification Based on 2D2MSD
p.3064
DCS Simulation Training System Design and Implementation
p.3068
Research on the Construction of Personalized Active Information Service Model in Digital Library
p.3071
Service Discovery Algorithm Based on Service Popularity in Wireless Community Network
p.3075

Tabu Search Algorithm for for Capacitated Vehicle Routing Problem

Article Preview

Abstract:

The paper is focused on the capacitated vehicle routing problem. Tabu search algorithm is an algorithm based on neighborhood search. According to the features of the problem, the essay centered the construct initial solution to build neighborhood structure. For the operation, 1-move and 2-opt were applied, it can also fasten the speed of convergence, and boost the search efficiency. Finally, the good performance of this algorithm can be proved by experiment calculation and concrete examples.

You might also be interested in these eBooks
Materials Processing and Manufacturing III View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 753-755)

Pages:

3060-3063

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.753-755.3060

Citation:

Cite this paper

Online since:

August 2013

Authors:

Chun Yu Ren

Keywords:

1-Move, 2-Opt, Capacitated Vehicle Routing Problem, Tabu Search Algorithm

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

References

[1] 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

[2] D. Mester, O. Brays. Active-guided evolution strategies for large scale capacitated vehicle routing problems. Computers and Operations Research, Vol. 34(2007), P. 2964-2975.

DOI: 10.1016/j.cor.2005.11.006

Google Scholar

[3] OSMAN I H. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research, Vol. 41(1993), P. 421-451.

DOI: 10.1007/bf02023004

Google Scholar

[4] R. Tavakkoli-Moghaddam, N. Safaei, YGholipour. A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length. Applied Mathematics and Computation, Vol. 176(2006), P. 445-454.

DOI: 10.1016/j.amc.2005.09.040

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