Solving the one-commodity pickup and delivery problem using an adaptive hybrid VNS/SA approach

Hosny, Manar I. and Mumford, Christine Lesley ORCID: https://orcid.org/0000-0002-4514-0272 2010. Solving the one-commodity pickup and delivery problem using an adaptive hybrid VNS/SA approach. Presented at: 11th International Conference, Kraków, Poland, 11-15 Sept 2010. Parallel problem-solving from nature PPSN X. PARALLEL PROBLEM SOLVING FROM NATURE-PPSN XI, PT II. Lecture notes in computer science (6239) Springer, pp. 189-198. 10.1007/978-3-642-15871-1_20

Preview

Text - Accepted Post-Print Version Download (136kB) | Preview

Abstract

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.

Item Type:	Conference or Workshop Item (Paper)
Date Type:	Publication
Status:	Published
Schools:	Schools > Computer Science & Informatics
Subjects:	Q Science > QA Mathematics Q Science > QA Mathematics > QA75 Electronic computers. Computer science Q Science > QA Mathematics > QA76 Computer software
Publisher:	Springer
ISBN:	9783642158704
ISSN:	0302-9743
Date of First Compliant Deposit:	30 March 2016
Last Modified:	20 Oct 2022 09:23
URI:	https://orca.cardiff.ac.uk/id/eprint/31784

Citation Data

Cited 14 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item