Hybridized Ant Colony Optimization for the Multi-depot Multi-compartment capacitated arc routing problem - Normandie Université Access content directly
Journal Articles International Journal of Operational Research Year : 2021

Hybridized Ant Colony Optimization for the Multi-depot Multi-compartment capacitated arc routing problem

Ali Kansou
  • Function : Author
Bilal Kanso
  • Function : Author

Abstract

This paper considers the multi-depot multi-compartment capacitated arc routing problem. It consists to find a set of vehicle routes with minimal travelled distance that satisfy the demands of a set of customers for several products. This problem has some important applications such as in the fields of transportation, distribution and logistics since companies are increasingly using multiple depots to store their products and separate compartments which are necessary since each product has its own specific characteristics and cannot be mixed during transportation. In this paper, a new approach based on the ant colony optimisation that is hybridised with a simulated annealing algorithm is developed. Computational experiments are performed on a benchmark of instances taken from the literature, and a set of real-life instances, and on another new set of random large-scale instances. The proposed metaheuristic generates high-quality solutions compared to the existing algorithms and particularly the results on the new instances seem promising, purposeful and powerful.
No file

Dates and versions

hal-03652568 , version 1 (26-04-2022)

Identifiers

Cite

Ali Kansou, Bilal Kanso, Adnan Yassine. Hybridized Ant Colony Optimization for the Multi-depot Multi-compartment capacitated arc routing problem. International Journal of Operational Research, 2021, 1 (1), pp.1. ⟨10.1504/IJOR.2021.10035821⟩. ⟨hal-03652568⟩
32 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More