VRP Pickup Delivery Problem

VRP-PDPTW : (Pickup and Delivery Problem with Time Windows)

Basic Idea :

VRP is an important problem in the fields of transportation, distribution and logistics. Often the context is that of delivering goods located at a central depot to customers who have placed orders for such goods. The pickup and delivery problem with time windows (PDPTW) is a generalization of the VRP which is concerned with the construction of optimal routes to satisfy transportation requests, each requiring both pickup and delivery under capacity, time window and precedence constraints.

http://www.dim.uchile.cl/~tcapelle/TESIS/NanryPDPTW.pdf

Tabu Search :

It uses a local or neighborhood search procedure to iteratively move from one potential solution x to an improved solution x' in the neighborhood of x, until some stopping criterion has been satisfied (generally, an attempt limit or a score threshold).

Reactive TABU Search :

It is a robust search technique that enhances classical tabu search by allowing the algorithm to automatically adjust the search parameters based on the state and quality of the search. It enables the algorithm to choose strategies and parameter values at each iteration.

Algorithm :

1. The feasible initial solution

2. Move neighborhoods (Total-3)

   (1) SPI - Single paired Insertions.

   (2) SBR - Swapping between routes.

   (3) WRI - Within Route insertion.