|
Trudy Instituta Matematiki i Mekhaniki UrO RAN, 2011, Volume 17, Number 4, Pages 121–125
(Mi timm757)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
Enhanced simulated annealing in the vehicle routing problem
A. V. Ipatov Ural Federal University
Abstract:
The vehicle routing problem (VRP) is to find routes for a fleet of vehicles located at a central depot and for several distant customers. This problem is NP-hard because it can be seen as a merge of the travelling salesman problem and the bin packing problem. In this paper we describe an enhanced simulated annealing approach and an algorithm for the VRP based on this approach. We present computational results of this algorithm on benchmark instances of the VRP.
Keywords:
vehicle routing problem, simulated annealing, metaheuristic.
Received: 20.11.2010
Citation:
A. V. Ipatov, “Enhanced simulated annealing in the vehicle routing problem”, Trudy Inst. Mat. i Mekh. UrO RAN, 17, no. 4, 2011, 121–125
Linking options:
https://www.mathnet.ru/eng/timm757 https://www.mathnet.ru/eng/timm/v17/i4/p121
|
Statistics & downloads: |
Abstract page: | 1388 | Full-text PDF : | 705 | References: | 71 | First page: | 7 |
|