The University of Southampton
University of Southampton Institutional Repository

Path and speed optimization for conflict-free pickup and delivery under time windows

Path and speed optimization for conflict-free pickup and delivery under time windows
Path and speed optimization for conflict-free pickup and delivery under time windows
This article introduces a variant of the conflict-free pickup and delivery problem with time windows in which speeds can be regulated. The problem arises in several areas of transportation and logistics including routing and scheduling of automated guided vehicles in port terminals and coordination of unmanned aerial vehicles in controlled airspace. A particular aspect of this problem is that at most one vehicle can traverse an arc of the transportation network at any time. The problem studied in this paper is to determine the vehicle paths and speeds on each arc of the path in such a way that no conflicts arise, the time windows are met, and the total energy consumption is minimized. A branch-and-bound algorithm is described in which a lower bound is obtained by solving a separable nonlinear problem in quadratic time. If the solution of the relaxation is not conflict free, a set of space-based and time-based branching constraints are generated to resolve the detected conflicts. Computational experiments show that, when compared with a state-of-the-art approach, the proposed method is able to generate a larger number of feasible solutions (42% on average) and reduce the computation time by an order of magnitude. Moreover, the approach results in an average energy savings of around 70%.
0041-1655
739-1034
Adamo, Tommaso
4d66d68b-ac4c-4b36-a528-87f9bd7d8a3a
Bektas, Tolga
0db10084-e51c-41e5-a3c6-417e0d08dac9
Ghiani, Gianpaolo
93c0c3ec-e29d-456d-9ca7-6797e25c4481
Guerriero, Emanuela
32346845-cca5-4b78-b26a-9c9dd5747463
Manni, Emanuele
418dd4d0-3468-478f-9f95-744ece6a4a07
Adamo, Tommaso
4d66d68b-ac4c-4b36-a528-87f9bd7d8a3a
Bektas, Tolga
0db10084-e51c-41e5-a3c6-417e0d08dac9
Ghiani, Gianpaolo
93c0c3ec-e29d-456d-9ca7-6797e25c4481
Guerriero, Emanuela
32346845-cca5-4b78-b26a-9c9dd5747463
Manni, Emanuele
418dd4d0-3468-478f-9f95-744ece6a4a07

Adamo, Tommaso, Bektas, Tolga, Ghiani, Gianpaolo, Guerriero, Emanuela and Manni, Emanuele (2018) Path and speed optimization for conflict-free pickup and delivery under time windows. Transportation Science, 52 (4), 739-1034. (doi:10.1287/trsc.2017.0816).

Record type: Article

Abstract

This article introduces a variant of the conflict-free pickup and delivery problem with time windows in which speeds can be regulated. The problem arises in several areas of transportation and logistics including routing and scheduling of automated guided vehicles in port terminals and coordination of unmanned aerial vehicles in controlled airspace. A particular aspect of this problem is that at most one vehicle can traverse an arc of the transportation network at any time. The problem studied in this paper is to determine the vehicle paths and speeds on each arc of the path in such a way that no conflicts arise, the time windows are met, and the total energy consumption is minimized. A branch-and-bound algorithm is described in which a lower bound is obtained by solving a separable nonlinear problem in quadratic time. If the solution of the relaxation is not conflict free, a set of space-based and time-based branching constraints are generated to resolve the detected conflicts. Computational experiments show that, when compared with a state-of-the-art approach, the proposed method is able to generate a larger number of feasible solutions (42% on average) and reduce the computation time by an order of magnitude. Moreover, the approach results in an average energy savings of around 70%.

Text
Final - Accepted Manuscript
Download (557kB)

More information

Accepted/In Press date: 11 December 2017
e-pub ahead of print date: 17 May 2018
Published date: July 2018

Identifiers

Local EPrints ID: 416504
URI: http://eprints.soton.ac.uk/id/eprint/416504
ISSN: 0041-1655
PURE UUID: c33abbfb-2619-424f-96d2-3d63294a1949
ORCID for Tolga Bektas: ORCID iD orcid.org/0000-0003-0634-144X

Catalogue record

Date deposited: 20 Dec 2017 17:30
Last modified: 17 Dec 2019 05:43

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 http://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.

×