The University of Southampton
University of Southampton Institutional Repository

The vehicle routing problem with release and due dates

The vehicle routing problem with release and due dates
The vehicle routing problem with release and due dates
A novel extension of the classical vehicle routing and scheduling problems is introduced that integrates aspects of machine scheduling into vehicle routing. Associated with each customer order is a release date that defines the earliest time that the order is available to leave the depot for delivery and a due date that indicates the time by which the order should ideally be delivered to the customer. The objective is to minimize a convex combination of the operational costs and customer service level, represented by the total distance traveled and the total weighted tardiness of delivery, respectively. A path-relinking algorithm (PRA) is proposed to address the problem, and a variety of benchmark instances are generated to evaluate its performance. The PRA exploits the efficiency and aggressive improvement of neighborhood search but relies on a new path-relinking procedure and advanced population management strategies to navigate the search space effectively. To provide a comparator algorithm to the PRA, we embed the neighborhood search into a standard iterated local search algorithm (ILS). Extensive computational experiments on the benchmark instances show that the newly defined features have a significant and varied impact on the problem, and the performance of the PRA dominates that of the ILS algorithm.
vehicle routing and scheduling , weighted tardiness, release dates, path relinking, hybrid population-based metaheuristics
0899-1499
705-723
Shelbourne, Benjamin C.
d321c4df-36d0-47c6-ac05-0a1bc87a2f91
Battarra, Maria
6ba9ac66-7d49-4849-b745-b4477b583acd
Potts, Christopher
58c36fe5-3bcb-4320-a018-509844d4ccff
Shelbourne, Benjamin C.
d321c4df-36d0-47c6-ac05-0a1bc87a2f91
Battarra, Maria
6ba9ac66-7d49-4849-b745-b4477b583acd
Potts, Christopher
58c36fe5-3bcb-4320-a018-509844d4ccff

Shelbourne, Benjamin C., Battarra, Maria and Potts, Christopher (2017) The vehicle routing problem with release and due dates. INFORMS Journal on Computing, 29 (4), 705-723. (doi:10.1287/ijoc.2017.0756).

Record type: Article

Abstract

A novel extension of the classical vehicle routing and scheduling problems is introduced that integrates aspects of machine scheduling into vehicle routing. Associated with each customer order is a release date that defines the earliest time that the order is available to leave the depot for delivery and a due date that indicates the time by which the order should ideally be delivered to the customer. The objective is to minimize a convex combination of the operational costs and customer service level, represented by the total distance traveled and the total weighted tardiness of delivery, respectively. A path-relinking algorithm (PRA) is proposed to address the problem, and a variety of benchmark instances are generated to evaluate its performance. The PRA exploits the efficiency and aggressive improvement of neighborhood search but relies on a new path-relinking procedure and advanced population management strategies to navigate the search space effectively. To provide a comparator algorithm to the PRA, we embed the neighborhood search into a standard iterated local search algorithm (ILS). Extensive computational experiments on the benchmark instances show that the newly defined features have a significant and varied impact on the problem, and the performance of the PRA dominates that of the ILS algorithm.

Full text not available from this repository.

More information

Accepted/In Press date: 27 February 2017
e-pub ahead of print date: 30 August 2017
Keywords: vehicle routing and scheduling , weighted tardiness, release dates, path relinking, hybrid population-based metaheuristics

Identifiers

Local EPrints ID: 420886
URI: http://eprints.soton.ac.uk/id/eprint/420886
ISSN: 0899-1499
PURE UUID: a2ad3544-4dc9-4ea2-bddc-8e9b58e932a7

Catalogue record

Date deposited: 17 May 2018 16:30
Last modified: 06 Oct 2020 19:09

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.

×