A Hybrid Genetic-Simulated Annealing-Auction Algorithm for a Fully Fuzzy Multi-Period Multi-Depot Vehicle Routing Problem

Abstract

In this paper, an integer linear programming formulation is developed for a novel fuzzy multi-period multi-depot vehicle routing problem. The novelty belongs to both the model and the solution methodology. In the proposed model, vehicles are not forced to return to their starting depots. The fuzzy problem is transformed into a mixed-integer programming problem by applying credibility measure whose optimal solution is an (α,β)-credibility optimal solution to the fuzzy problem. To solve the problem, a hybrid genetic-simulated annealing-auction algorithm (HGSA), empowered by a modern simulated annealing cooling schedule function, is developed. Finally, the efficiency of the algorithm is illustrated by employing a variety of test problems and benchmark examples. The obtained results showed that the algorithm provides satisfactory results in terms of different performance criteria.

Keywords

• periodic routing problem
• multi-depot
• hybrid algorithm
• auction algorithm
• genetic algorithm
• simulated annealing algorithm