Capacitated vehicle routing problem (CVRP) is an important combinatorial optimization problem. However, it is quite difficult to achieve an optimal solution with the traditional optimization methods owing to the high computational complexity. A tabu search was developed to solve the problem. The paper designs a tabu search algorithm for a kind of CVRP with soft time windows based on natural number coding studies the influence of parameters on search effect and achieves very good results in the instance. The results obtained show that the proposed algorithm is a feasible and effective method for this kind of problem.
The Application of Tabu Search in Physical Distribution Capacitated Vehicle Routing Optimization Problem
First International Conference on Transportation Engineering ; 2007 ; Southwest Jiaotong University, Chengdu, China
2007-07-09
Conference paper
Electronic Resource
English
British Library Conference Proceedings | 2007
|A Granular Variable Tabu Neighborhood Search for the capacitated location-routing problem
Online Contents | 2014
|A tabu search-based heuristic for a new capacitated cyclic inventory routing problem
BASE | 2014
|