Heuristic algorithm for the Split-Demand One-Commodity Pickup-and-Delivery Travelling Salesman Problem

Hernández-Pérez, Hipólito and Salazar-González, Juan José and Santos-Hernández, Beatriz (2018) Heuristic algorithm for the Split-Demand One-Commodity Pickup-and-Delivery Travelling Salesman Problem. Computers and Operations Research, 97. pp. 1-17. ISSN 0305-0548

Full text not available from this repository.

Abstract

This article addresses the problem of designing routes of minimum cost for a capacitated vehicle moving a commodity between a set of customers, allowing two characteristics uncommon in the pickup-and-delivery literature. One characteristic is that a customer may be visited several times. The other characteristic is that a customer may be used as intermediate location to temporarily collect and deliver product. The article describes a matheuristic algorithm that iteratively applies a constructive procedure and a refinement procedure. The constructive procedure represents each customer by a set of nodes each one associated with a potential visit|, decomposes each customer demand into partial demands associated with its nodes, and solves a one-commodity pickup-and-delivery Travelling Salesman Problem with a variable neighbourhood search. The refinement procedure is a branch-and-cut algorithm to optimize some pieces of a given solution. Exhaustive computational results on benchmark instances demonstrate the good performance of the algorithm when solving instances with up to 500 customers.

Item Type: Journal Article
Journal or Publication Title: Computers and Operations Research
Uncontrolled Keywords: /dk/atira/pure/subjectarea/asjc/1800/1803
Subjects:
Departments: Lancaster University Management School > Management Science
ID Code: 126523
Deposited By: ep_importer_pure
Deposited On: 22 Jun 2019 08:37
Refereed?: Yes
Published?: Published
Last Modified: 11 Feb 2020 04:23
URI: https://eprints.lancs.ac.uk/id/eprint/126523

Actions (login required)

View Item View Item