Paper Title:
Study on Tabu Search Algorithm for Min-Max Vehicle Routing Problem
  Abstract

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.

  Info
Periodical
Edited by
Helen Zhang and David Jin
Pages
160-163
DOI
10.4028/www.scientific.net/AMM.63-64.160
Citation
C. Y. Ren, "Study on Tabu Search Algorithm for Min-Max Vehicle Routing Problem", Applied Mechanics and Materials, Vols. 63-64, pp. 160-163, 2011
Online since
June 2011
Authors
Export
Price
$32.00
Share

In order to see related information, you need to Login.

In order to see related information, you need to Login.

Authors: Ya Lian Tang, Yan Guang Cai, Qi Jiang Yang
Chapter 14: Computer Applications and Mathematical Modeling, Numerical Methods, Intelligent Algorithms and Optimization
Abstract:Aiming at vehicle routing problem (VRP) with many extended features is widely used in actual life, multi-depot heterogeneous vehicle routing...
1108
Authors: Lei Qin, Ya Qin Li, Kang Zhou
Chapter 2: Traffic and Transport Engineering, Vechicle and Road Safety
Abstract:Vehicle Routing Problem (VRP) is one of the core issue of logistics distribution, for traditional precision algorithms and heuristic...
56
Authors: Yan Guang Cai, Ya Lian Tang, Qi Jiang Yang
Chapter 5: Algorithms, Computation Methods and their Applications
Abstract:Multi-depot heterogeneous vehicle routing problem with simultaneous pickup and delivery and time windows (MDHVRPSPDTW) is an extension of...
361