The Fleet Size and Mix vehicle Routing Problem with backhauls: Formulation and Set partitioning-based heuristics

Salhi, Said, Wassan, Niaz A., Hajarat, Mutaz (2013) The Fleet Size and Mix vehicle Routing Problem with backhauls: Formulation and Set partitioning-based heuristics. Transportation Research Part E, 56 . pp. 22-35. ISSN 1366-5545. (doi:10.1016/j.tre.2013.05.005) (KAR id:34283)

PDF Language: English
Click to download this file (1MB) Preview	Preview
This file may not be suitable for users of assistive technology. Request an accessible format
Official URL: http://dx.doi.org/10.1016/j.tre.2013.05.005

Abstract

In this paper we present a new variant of the classical Vehicle Routing Problem – the Fleet Size and Mix Vehicle Routing Problem with Backhauls (FSMVRPB). An ILP formulation of the FSMVRPB is presented. Optimal solutions for small size instances are produced and upper and lower bounds are generated for larger ones. In this paper we also propose a Set Partitioning Problem (SPP) based heuristic. Three frameworks are developed and tested on a set of new FSMVRPB data instances which we generated. Computational results are presented which can be used for future benchmarking.

Item Type:	Article
DOI/Identification number:	10.1016/j.tre.2013.05.005
Uncontrolled keywords:	Mixed Fleet Backhauling, ILP formulation, Set Partitioning Problem, Heuristics.
Subjects:	H Social Sciences H Social Sciences > HA Statistics > HA33 Management Science
Divisions:	Divisions > Kent Business School - Division > Department of Analytics, Operations and Systems
Depositing User:	Niaz Wassan
Date Deposited:	13 Jun 2013 08:57 UTC
Last Modified:	19 Sep 2023 15:04 UTC
Resource URI:	https://kar.kent.ac.uk/id/eprint/34283 (The current URI for this page, for reference purposes)
Salhi, Said:	https://orcid.org/0000-0002-3384-5240
Wassan, Niaz A.:	https://orcid.org/0000-0003-0153-7646

Depositors only (login required):

Altmetric

Download Statistics

Downloads

Downloads per month over past year