A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem

Abstract

In the heterogeneous fixed fleet vehicle routing problem there are different types of vehicles and a given number of vehicles of each type. The resolution of this problem consists of assigning the customers to the existing vehicles and, in relation to each vehicle, defining the order of visiting each customer for the delivery or collection of goods. The objective is to minimize the total costs, satisfying customers' requirements and visiting each customer exactly once. In this paper a tabu search algorithm is proposed and tested on several benchmark problems. The computational experiments show that the proposed algorithm produces high quality solutions within an acceptable computation time. Four new best solutions are reported for a set of test problems used in the literature.

A Survey of Recent Research on Optimization Models and Algorithms for Operations Management from the Process View

“…To the best of our knowledge, although some studies set the vehicle cost as their only objective [134,144,150,[174][175][176][177][178], the majority of the studies (54.3%) regard the vehicle cost as the part of fixed cost and aim to minimize the combination of the fixed cost with some variable costs, such as travelling cost [128,133,136,145,146,[179][180][181][182][183], penalty cost [184], inventory cost [163,[185][186][187], fuel cost [188], and emission [137].…”

Comparative analysis of granular neighborhoods in a Tabu Search for the vehicle routing problem with heterogeneous fleet and variable costs (HFVRP)

“…Heuristic algorithms based on Tabu Search (TS) for the HFVRP have been proposed in the literature [12][13][14]. Brandão [12] introduced an algorithm based on TS that included strategic oscillation, perturbation procedure, and memory based on frequencies.…”

“…Brandão [12] introduced an algorithm based on TS that included strategic oscillation, perturbation procedure, and memory based on frequencies. Previously, the same author proposed a TS deterministic that used different heuristic procedures to generate the initial solution [13].…”

Migrating towards Using Electric Vehicles in Campus-Proposed Methods for Fleet Optimization

“…Several studies [35][36][37][38][39][40] have examined the heterogeneous VRP (HVRP). In the applications of HVRP, they tried to minimize total cost by dispatching each vehicle type, defined by its capacity, a fixed cost, a distance unit, and availability.…”