Solving a distribution network design problem by combining ant colony systems and Lagrangian relaxation
MetadataShow full item record
Distribution network design (DND) attempts to integrate tactical issues such as inventory policies and/or vehicle routing decisions with strategic ones such as the problem of locating facilities and allocate customers to such facilities. When inventory policy decision making is considered the problem is also known as inventory location modelling (ILM) problem. During the last two decades, mathematical programming as well as (meta-)heuristic approaches have been considered to address different DND problem. In this article we consider a hybrid algorithm of Lagrangian Relaxation and artificial ants to solve an ILM problem previously proposed in the literature. We use ACS to allocate customers to a subset of warehouses that is previously generated by the Lagrangian relaxation. Results show that the hybrid approach is quite competitive, obtaining near-optimal solutions within an acceptable time. © ICI Bucharest 2010 -2015.
Showing items related by title, author, creator and subject.
A new approach to solve the software project scheduling problem based on max–min ant system (2020) Crawford B.; Soto R.; Johnson F.; Monfroy E.; Paredes F. (Springer Verlag, 2014)
An ACS-based memetic algorithm for the heterogeneous vehicle routing problem with time windows (2020) Molina J.C.; Salmeron J.L.; Eguia I. (Elsevier Ltd, 2020)
Conference PaperCrawford B.; Soto R.; Johnson F.; Paredes F. (Springer Verlag, 2015)