ScholarLens Back to search
2015•Kent Academic Repository (University of Kent)Requires access

A Reactive Tabu Search for the Fleet Size and Mix Vehicle Routing Problem with Backhauls

Niaz Ahmed Wassan, Lina Simeonova, Saı̈d Salhi, Gábor Nagy

Open publisher page 1 citations

Abstract

This paper studies a relatively new variant of the classical Vehicle Routing Problem (VRP) - the Fleet Size and Mix Vehicle Routing Problem with Backhauls (FSMVRPB). In this variant a fleet of heterogeneous vehicles is optimized to minimise fixed and operational costs to serve two groups of customers, i.e., deliveries (linehauls) and pickups (backhauls). A reactive tabu search algorithm is developed to solve the FSMVRPB. Some new best known results are obtained for the FSMVRPB data instances.

About this research paper

What this paper is about

This paper studies a relatively new variant of the classical Vehicle Routing Problem (VRP) - the Fleet Size and Mix Vehicle Routing Problem with Backhauls (FSMVRPB). In this variant a fleet of heterogeneous vehicles is optimized to minimise fixed and operational costs to serve two groups of customers, i.e., deliveries (linehauls) and pickups (backhauls). A reactive tabu search algorithm is developed to solve the FSMVRPB. Some new best known results are obtained for the FSMVRPB data instances.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This paper studies a relatively new variant of the classical Vehicle Routing Problem (VRP) - the Fleet Size and Mix Vehicle Routing Problem with Backhauls (FSMVRPB). In this variant a fleet of heterogeneous vehicles is optimized to minimise fixed and operational costs to serve two groups of customers, i.e., deliveries (linehauls) and pickups (backhauls). A reactive tabu search algorithm is developed to solve the FSMVRPB. Some new best known results are obtained for the FSMVRPB data instances.

Key concepts: Tabu search, Vehicle routing problem, Computer science, Routing (electronic design automation), Mathematical optimization, Mathematics, Algorithm, Computer network

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A Reactive Tabu Search for the Fleet Size and Mix Vehicle Routing Problem with Backhauls — Research Paper | ScholarLens