Skip to Main content Skip to Navigation
Conference papers

A grasp with variable neighborhood descent for the pickup and delivery problem with time windows

Abstract : 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.
keyword : VRP PDPTW VND GRASP
Document type :
Conference papers
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-00817661
Contributor : Jean-Christophe Deschamps Connect in order to contact the contributor
Submitted on : Thursday, April 25, 2013 - 10:04:46 AM
Last modification on : Thursday, April 2, 2020 - 7:14:06 PM

Identifiers

  • HAL Id : hal-00817661, version 1

Citation

Rodrigue Tchapnga-Takoudjou, Jean-Christophe Deschamps, Rémy Dupas. A grasp with variable neighborhood descent for the pickup and delivery problem with time windows. 4th International Conference on Information Systems, Logistics and Supply Chain (ILS'2012), Aug 2012, Quebec, Canada. ⟨hal-00817661⟩

Share

Metrics

Record views

178