The University of Southampton
University of Southampton Institutional Repository

Routing a heterogeneous fleet of vehicles

Routing a heterogeneous fleet of vehicles
Routing a heterogeneous fleet of vehicles
In the well-known Vehicle Routing Problem (VRP) a set of identical vehicles, based at a central depot, is to be optimally routed to supply customers with known demands subject to vehicle capacity constraints. An important variant of the VRP arises when a fleet of vehicles characterized by different capacities and costs is available for distribution activities. The problem is known as the Mixed Fleet VRP or as the Heterogeneous Fleet VRP. This chapter gives an overview of approaches from the literature to solve heterogeneous VRPs. In particular, we classify the different variants described in the literature and, as no exact algorithm has been presented for any variants of heterogeneous VRP, we review the lower bounds and the heuristic algorithms proposed. Computational results, comparing the performance of the different heuristic algorithms on benchmark instances, are also discussed
978-0-387-77777-1
1
3-27
Springer
Baldacci, Roberto
16fc1690-9ac5-4228-a0a8-ea87bf0726cf
Battarra, Maria
0498dc58-e9d5-4ad2-a141-040f7bcebbc2
Vigo, Daniele
0bc6db04-0bff-438e-91ca-947171d0604e
Baldacci, Roberto
16fc1690-9ac5-4228-a0a8-ea87bf0726cf
Battarra, Maria
0498dc58-e9d5-4ad2-a141-040f7bcebbc2
Vigo, Daniele
0bc6db04-0bff-438e-91ca-947171d0604e

Baldacci, Roberto, Battarra, Maria and Vigo, Daniele (2008) Routing a heterogeneous fleet of vehicles. In, The Vehicle Routing Problem: Latest Advances and New Challenges. (Operations Research/Computer Science Interfaces Series, , (doi:10.1007/978-0-387-77778-8_1), 1, 43) New York, US. Springer, pp. 3-27. (doi:10.1007/978-0-387-77778-8_1).

Record type: Book Section

Abstract

In the well-known Vehicle Routing Problem (VRP) a set of identical vehicles, based at a central depot, is to be optimally routed to supply customers with known demands subject to vehicle capacity constraints. An important variant of the VRP arises when a fleet of vehicles characterized by different capacities and costs is available for distribution activities. The problem is known as the Mixed Fleet VRP or as the Heterogeneous Fleet VRP. This chapter gives an overview of approaches from the literature to solve heterogeneous VRPs. In particular, we classify the different variants described in the literature and, as no exact algorithm has been presented for any variants of heterogeneous VRP, we review the lower bounds and the heuristic algorithms proposed. Computational results, comparing the performance of the different heuristic algorithms on benchmark instances, are also discussed

Full text not available from this repository.

More information

Published date: 2008
Organisations: Operational Research

Identifiers

Local EPrints ID: 204839
URI: https://eprints.soton.ac.uk/id/eprint/204839
ISBN: 978-0-387-77777-1
PURE UUID: ffeb46f2-2246-43ef-8614-da36f31f527d

Catalogue record

Date deposited: 02 Dec 2011 11:17
Last modified: 16 Jul 2019 23:17

Export record

Altmetrics

Contributors

Author: Roberto Baldacci
Author: Maria Battarra
Author: Daniele Vigo

University divisions

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.

×