Facial reconstruction

Search LJMU Research Online

Browse Repository | Browse E-Theses

The Consistent Vehicle Routing Problem with heterogeneous fleet

Stavropoulou, F (2021) The Consistent Vehicle Routing Problem with heterogeneous fleet. Computers and Operations Research, 140. ISSN 0305-0548

HConVRP.pdf - Accepted Version
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (534kB) | Preview


Customer relationship management is of high importance as it strengthens customer satisfaction. Providing consistent customer service cultivates customer retention and brand loyalty. This paper examines a new customer-oriented routing problem, the Consistent Vehicle Routing Problem with heterogeneous fleet. The objective is to create cost-efficient routing plans, utilising a fixed fleet of vehicles with heterogeneous operational characteristics, variable and fixed costs, while providing consistent customer service over multiple periods. Service consistency consists in person and visiting time consistency. A mathematical model capturing all the attributes of the problem is developed and utilised to solve small-scale instances to optimality. To address larger instances, a hierarchical Tabu Search framework is proposed. The proposed metaheuristic utilises an upper-level Tabu Search and an underlying Variable Neighbourhood Descent algorithm. Computational experiments conducted on existing and new benchmark instances show the flexibility, effectiveness and efficiency of the proposed framework. Various managerial insights are derived by examining the cost of imposing customer service consistency as well as customer-vehicle incompatibility constraints.

Item Type: Article
Uncontrolled Keywords: 0102 Applied Mathematics, 0103 Numerical and Computational Mathematics
Subjects: H Social Sciences > HF Commerce > HF5001 Business
H Social Sciences > HE Transportation and Communications
Q Science > QA Mathematics
Divisions: Business & Management (from Sep 19)
Publisher: Elsevier
Date Deposited: 19 Nov 2021 10:19
Last Modified: 05 Jun 2023 00:50
DOI or ID number: 10.1016/j.cor.2021.105644
URI: https://researchonline.ljmu.ac.uk/id/eprint/15801
View Item View Item