A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows
AbstractIn the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows, the set of customers is the union of delivery customers and pickup customers. A fleet of identical capacitated vehicles based at the depot must perform all deliveries and profitable pickups while respecting time windows. The objective is to minimize routing costs, minus the revenue associated with the pickups. Five variants of the problem are considered according to the order imposed on deliveries and pickups. An exact branch-and-price algorithm is developed for the problem. Computational results are reported for instances containing up to 100 customers.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal European Journal of Operational Research.
Volume (Year): 206 (2010)
Issue (Month): 2 (October)
Contact details of provider:
Web page: http://www.elsevier.com/locate/eor
Transportation Vehicle routing Deliveries and selective pickups Time windows Branch-and-price Shortest paths with resources;
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Ting, Chuan-Kang & Liao, Xin-Lan, 2013. "The selective pickup and delivery problem: Formulation and a memetic algorithm," International Journal of Production Economics, Elsevier, vol. 141(1), pages 199-211.
- Germs, Remco & Van Foreest, Nicky D., 2011. "Admission policies for the customized stochastic lot scheduling problem with strict due-dates," European Journal of Operational Research, Elsevier, vol. 213(2), pages 375-383, September.
- Luo, Zhixing & Qin, Hu & Lim, Andrew, 2014. "Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints," European Journal of Operational Research, Elsevier, vol. 234(1), pages 49-60.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
If references are entirely missing, you can add them using this form.