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

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.

Multi-Depots Vehicle Routing Problem with Simultaneous Delivery and Pickup and Inventory Restrictions: Formulation and Resolution

“…Whereas, [8] applies the fuzzy approach when both pickup and delivery demands are uncertain, and they propose an ALNS heuristic. Reference [9] deals with a variant of the basic VRPSDP including the multiple trips and time windows characteristics. They propose a solution approach based on Tabu Search, with the sequential insertion algorithm to construct an initial solution.…”

“…Constraints (7) eliminate the sub-tours to ensure that the solution is connected. After visiting the first customer, the vehicle load is calculated by constraint (8) and after leaving other customers, the vehicle load is calculated by constraint (9). Constraints (10) and (11) ensure that the vehicle capacity is respected at each section of the route.…”

On Modelling and Solving Heterogeneous Vehicle Routing Problem with Multi-Trips and Multi-Products

“…This condition is called multi-trips VRP (Gendreau et al [9]). The multi-trips is indicated by allowing the vehicle to perform more than one route during a planning horizon (Suprayogi and Priyandari [10]). Due to the possibility to assign several routes to the same vehicle, multi-trips VRP can make using fewer vehicles (Taillard et al [11]).…”

A Mathematical Model for Solving Distribution System Problem by Considering Odd-Even Vehicle License Plate Rule

“…An example of VRPTW can be found in fuel oil distribution, where each customer has the opening and closing time [7]. Moreover, the development of node time-constrained problems incorporating multiple trips and pickup delivery has been presented by Suprayogi and Priyandari [8] in response to a case of the pickup and delivery of Liquified Petroleum Gas (LPG) tubes. In several cases, the operational time windows are limited to all specific nodes, but the road connection between two nodes also has the operational time interval.…”