A grasp with variable neighborhood descent for the pickup and delivery problem with time windows
Résumé
The transport is a dominating function in the logistic networks. Real link in the supply chain, the carrier has become a key player in the logistics whose performance strongly influences the performance of suppliers and customers. The pickup and delivery problem with time window (PDPTW) is a special class of transportation problems. The objective of PDPTW is to satisfy at minimum cost a set of transport requests while respecting a set of constraints. This paper introduces a new Greedy Adaptive Search Procedure (GRASP) which embeds VND (Variable Neighborhood descent) for solving the PDPTTW. Our approach is tested using a set of test instances from the literature.