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 of the goods are not paired. We introduce a new adaptive hybrid VNS/SA (Variable Neighborhood Search/Simulated Annealing) approach for solving the 1-PDP. We perform sequences of VNS runs, where neighborhood sizes, within which the search is performed at each run, are adaptable. Experimental results on a large number of benchmark instances indicate that the algorithm outperforms previous heuristics in 90% of the large size test cases. Nevertheless, this comes at the expense of an increased processing time. © 2010 Springer-Verlag.
CITATION STYLE
Hosny, M. I., & Mumford, C. L. (2010). Solving the one-commodity pickup and delivery problem using an adaptive hybrid VNS/SA approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6239 LNCS, pp. 189–198). https://doi.org/10.1007/978-3-642-15871-1_20
Mendeley helps you to discover research relevant for your work.