Study on Tabu Search Algorithm for Min-Max Vehicle Routing Problem

被引：0
作者：
Ren, Chunyu [1 ]
机构：
[1] Heilongjiang Univ, Sch Informat Sci & Technol, Harbin, Peoples R China
来源：
ADVANCED RESEARCH ON MECHANICAL ENGINEERING, INDUSTRY AND MANUFACTURING ENGINEERING, PTS 1 AND 2 | 2011年 / 63-64卷
关键词：
Min-Max Vehicle Routing Problem; 1-move; 2-opt; Tabu search algorithm;
D O I：
10.4028/www.scientific.net/AMM.63-64.160
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
The paper is focused on the Min-Max Vehicle Routing Problem (MMVRP). Tabu search algorithm is an algorithm based on neighborhood search. According to the features of the problem, the essay centered the longest route to construct 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.
引用
收藏
页码：160 / 163
页数：4
相关论文
共 6 条
  • [1] Solution of a min-max vehicle routing problem
    Applegate, D
    Cook, W
    Dash, S
    Rohe, A
    [J]. INFORMS JOURNAL ON COMPUTING, 2002, 14 (02) : 132 - 143
  • [2] Approximations for minimum and min-max vehicle routing problems
    Arkin, EM
    Hassin, R
    Levin, A
    [J]. JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2006, 59 (01): : 1 - 18
  • [3] Arkin Esther M., 2005, J ALGORITHMS, V59, P1
  • [4] Chawathe Sudarshan S., 2007, 2007 IEEE Intelligence and Security Informatics, P79, DOI 10.1109/ISI.2007.379538
  • [5] A bound on the strong chromatic index of a graph
    Molloy, M
    Reed, B
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1997, 69 (02) : 103 - 109
  • [6] Xia Liu, 2007, THESIS HUAZHONG U SC, P24
1