This paper discusses a vehicle routing problem with multiple trips, time windows, and simultaneous delivery-pickup (VRPMTTWSDP). This problem is a variant of the basic vehicle routing problem (VRP) including the following characteristics: multiple trips, time windows, and simultaneous delivery-pickup. In this paper, a solution approach based on tabu search (TS) is proposed. In the proposed TS, the sequential insertion (SI) algorithm is used to construct an initial solution. A neighbor structure is generated by applying an operator order consisting of eleven operators of relocation, exchange, and crossover operators. A tabu solution code (TSC) method is applied as a tabu restriction mechanism. Computational experiments are carried out to examine the performance of the proposed TS using hypothetical instances. The performance of the proposed TS is compared to the local search (LS) and the genetic algorithm (GA). The comparison shows that the proposed TS is better in terms of the objective function value.
Tabu Search for the Vehicle Routing Problem with Multiple Trips, Time Windows, and Simultaneous Delivery-Pickup
2018-01-08
doi:10.9744/jti.19.2.75-82
Jurnal Teknik Industri; Vol 19, No 2 (2017): Desember 2017; 75-82 ; 2087-7439 ; 1411-2485
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
DDC: | 629 |
Solving the pickup and delivery problem with time windows using reactive tabu search
Online Contents | 2000
|A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
British Library Online Contents | 1997
|A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
Online Contents | 1997
|An Algorithm for Vehicle Routing Problem with Soft Time Windows Using Tabu Search
British Library Conference Proceedings | 2009
|A parallel tabu search heuristic for the vehicle routing problem with time windows
Online Contents | 1997
|