Skip to main content

The Fleet Size and Mix Vehicle Routing Problem with Backhauls: Formulations and Set-partitioning based Heuristics

Wassan, Niaz A., Salhi, Said, Hajarat, Mutaz (2014) The Fleet Size and Mix Vehicle Routing Problem with Backhauls: Formulations and Set-partitioning based Heuristics. In: 20th Conference of the International Federation of Operational Research Societies (IFORS 2014)., 13-18 Jul 2014, Barcelona, Spain. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:65146)

The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided. (Contact us about this Publication)

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: Conference or workshop item (Proceeding)
Uncontrolled keywords: Mixed Fleet Backhauling, ILP formulation, Set Partitioning Problem, Heuristics
Divisions: Faculties > Social Sciences > Kent Business School
Faculties > Social Sciences > Kent Business School > Centre for Logistics and Heuristic Organisation (CLHO)
Depositing User: Niaz Wassan
Date Deposited: 12 Dec 2017 16:57 UTC
Last Modified: 08 Feb 2020 04:09 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/65146 (The current URI for this page, for reference purposes)
Wassan, Niaz A.: https://orcid.org/0000-0003-0153-7646
Salhi, Said: https://orcid.org/0000-0002-3384-5240
  • Depositors only (login required):