2 Hits in 6.7 sec

Solving the One-Commodity Pickup and Delivery Problem Using an Adaptive Hybrid VNS/SA Approach [chapter]

Manar I. Hosny, Christine L. Mumford
2010 Parallel Problem Solving from Nature, PPSN XI  
We introduce a new adaptive hybrid VNS/SA (Variable Neighborhood Search/Simulated Annealing) approach for solving the 1-PDP.  ...  In the One-Commodity Pickup and Delivery Problem (1-PDP), a single commodity type is collected from a set of pickup customers to be delivered to a set of delivery customers, and the origins and destinations  ...  Introduction The One-Commodity Pickup and Delivery Problem (1-PDP) is an important problem in transportation and logistics.  ... 
doi:10.1007/978-3-642-15871-1_20 dblp:conf/ppsn/HosnyM10 fatcat:wtokgbves5e2pbeitmnatpyjdm

Models and Algorithms for the Optimization of Real-World Routing and Logistics Problems

Consorzio Spinner, Stefano Coordinatore, Dottorato Supervisore, Daniele, Iori Manuel, Daniele Supervisore, Vigo
In the same chapter, we also solve the generalization of the BRP where maximum duration constraints for the routes are considered, the so-called one-commodity Pickup and Delivery VRP (1-PDVRP), for which  ...  We present an ILP model and several heuristic algorithms to solve the 3DRP.  ...  Acknowledgments We thank the Mobility Concilorship of Reggio Emilia, and Alessandro Meggiato, Mobility Manager of the Municipality of Reggio Emilia, for the data and information supplied.  ...