The University of Southampton
University of Southampton Institutional Repository

The traveling salesman problem with pickups, deliveries and handling costs

The traveling salesman problem with pickups, deliveries and handling costs
The traveling salesman problem with pickups, deliveries and handling costs
This paper introduces a new variant of the one-to-many-to-one single vehicle pickup and delivery problems (SVPDP) that incorporates the handling cost incurred when rearranging the load at the customer locations. The simultaneous optimization of routing and handling costs is difficult, and the resulting loading patterns are hard to implement in practice. However, this option makes economical sense in contexts where the routing cost dominates the handling cost. We have proposed some simplified policies applicable to such contexts. The first is a two-phase heuristic in which the tour having minimum routing cost is initially determined by optimally solving an SVPDP, and the optimal handling policy is then determined for that tour. In addition, branch-and-cut algorithms based on integer linear programming formulations are proposed, in which routing and handling decisions are simultaneously optimized, but the handling decisions are restricted to three simplified policies. The formulations are strengthened by means of problem specific valid inequalities. The proposed methods have been extensively tested on instances involving up to 25 customers and hundreds of items. Our results show the impact of the handling aspect on the customer sequencing and indicate that the simplified handling policies favorably compare with the optimal one
0041-1655
383-399
Battarra, Maria
0498dc58-e9d5-4ad2-a141-040f7bcebbc2
Erdogan, Gunes
468310a1-5c36-4c3d-8b39-079bd621b34b
Laporte, Gilbert
b8210b8f-e942-4c5c-98b1-b55bd916aa70
Vigo, Daniele
0bc6db04-0bff-438e-91ca-947171d0604e
Battarra, Maria
0498dc58-e9d5-4ad2-a141-040f7bcebbc2
Erdogan, Gunes
468310a1-5c36-4c3d-8b39-079bd621b34b
Laporte, Gilbert
b8210b8f-e942-4c5c-98b1-b55bd916aa70
Vigo, Daniele
0bc6db04-0bff-438e-91ca-947171d0604e

Battarra, Maria, Erdogan, Gunes, Laporte, Gilbert and Vigo, Daniele (2010) The traveling salesman problem with pickups, deliveries and handling costs. Transportation Science, 44 (3), 383-399. (doi:10.1287/trsc.1100.0316).

Record type: Article

Abstract

This paper introduces a new variant of the one-to-many-to-one single vehicle pickup and delivery problems (SVPDP) that incorporates the handling cost incurred when rearranging the load at the customer locations. The simultaneous optimization of routing and handling costs is difficult, and the resulting loading patterns are hard to implement in practice. However, this option makes economical sense in contexts where the routing cost dominates the handling cost. We have proposed some simplified policies applicable to such contexts. The first is a two-phase heuristic in which the tour having minimum routing cost is initially determined by optimally solving an SVPDP, and the optimal handling policy is then determined for that tour. In addition, branch-and-cut algorithms based on integer linear programming formulations are proposed, in which routing and handling decisions are simultaneously optimized, but the handling decisions are restricted to three simplified policies. The formulations are strengthened by means of problem specific valid inequalities. The proposed methods have been extensively tested on instances involving up to 25 customers and hundreds of items. Our results show the impact of the handling aspect on the customer sequencing and indicate that the simplified handling policies favorably compare with the optimal one

Full text not available from this repository.

More information

e-pub ahead of print date: 18 March 2010
Published date: August 2010
Organisations: Centre of Excellence for International Banking, Finance & Accounting

Identifiers

Local EPrints ID: 204821
URI: https://eprints.soton.ac.uk/id/eprint/204821
ISSN: 0041-1655
PURE UUID: 5fd4ca4f-a73c-4afc-9fd9-baa48ba07ddf

Catalogue record

Date deposited: 02 Dec 2011 10:18
Last modified: 18 Jul 2017 11:05

Export record

Altmetrics

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of https://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×