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.
展开▼
