The selective pickup and delivery problem: Formulation and a memetic algorithm
Authors:
- Chuan-Kang TingCTChuan-Kang Ting
- Xin-Lan LiaoXLXin-Lan Liao
- 1 January 2013
- journal article
- Published by Elsevier in International Journal of Production Economics
- Vol. 141 (1) , 199-211
Abstract
No abstract availableKeywords
This publication has 57 references indexed in Scilit:
- Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and deliveryOperations Research Letters, 2011
- The preemptive swapping problem on a treeNetworks, 2011
- A reactive tabu search algorithm for the multi-depot container truck transportation problemTransportation Research Part E: Logistics and Transportation Review, 2009
- Genetic algorithm for the one-commodity pickup-and-delivery traveling salesman problemComputers & Industrial Engineering, 2009
- Strategic network design for reverse logistics and remanufacturing using new and old product modulesComputers & Industrial Engineering, 2009
- The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithmMathematical Programming, 2008
- On the one-commodity pickup-and-delivery traveling salesman problem with stochastic demandsMathematical Programming, 2008
- A branch-and-cut algorithm for a traveling salesman problem with pickup and deliveryDiscrete Applied Mathematics, 2004
- Environmental and reverse logistics policies in European bottling and packaging firmsInternational Journal of Production Economics, 2004
- Multicriteria pickup and delivery problem with transfer opportunityComputers & Industrial Engineering, 1996