Jurnal Teknik Industri
Vol. 19 No. 2 (2017): Desember 2017

Tabu Search for the Vehicle Routing Problem with Multiple Trips, Time Windows, and Simultaneous Delivery-Pickup

Suprayogi Suprayogi (Institut Teknologi Bandung, Bandung)
Yusuf Priyandari (Universitas Sebelas Maret, Surakarta)



Article Info

Publish Date
08 Jan 2018

Abstract

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.

Copyrights © 2017






Journal Info

Abbrev

ind

Publisher

Subject

Industrial & Manufacturing Engineering

Description

Jurnal Teknik Industri aims to: Promote a comprehensive approach to the application of industrial engineering in industries as well as incorporating viewpoints of different disciplines in industrial engineering. Strengthen academic exchange with other institutions. Encourage scientist, practicing ...