Please use this identifier to cite or link to this item:
|Title:||A simheuristic algorithm for horizontal cooperation in urban distribution. Application to a case in Colombia|
|Author:||Quintero Araújo, Carlos Leonardo|
Montoya Torres, Jairo R.
Juan Pérez, Ángel Alejandro
Muñoz Villamizar, Andrés Felipe
supply chain management
|Publisher:||Winter Simulation Conference (WSC). Proceedings|
|Citation:||Quintero Araujo, C.L., Juan, A.A., Montoya Torres, J. & Muñoz-Villamizar, A. (2016). A Simheuristic Algorithm for Horizontal Cooperation in Urban Distribution: Application to a Case Study in Colombia. Winter Simulation Conference (WSC). Proceedings, 2016(), 2193-2204. doi: 10.1109/WSC.2016.7822261|
|Published in:||Winter Simulation Conference, Washington D.C., EUA, 11-14, desembre de 2016|
|Abstract:||The challenge in last-mile supply chains deliveries is to maintain and improve the operational costeffectiveness by the implementation of efficient procedures while facing increased levels of congestion in cities. One competitive alternative is Horizontal Cooperation (HC). City distribution problems under HC conditions can be modeled as multi-depot vehicle routing problems, which are NP-hard problems meaning that exact methods provide optimal solutions only for small datasets. This complexity increases when considering stochastic demand. Therefore, real-life situations must be solved using heuristic algorithms. This paper proposes the implementation of a simheuristic (i.e., an algorithm combining heuristics with simulation). Experiments are carried out using realistic data from the city of Bogotá, Colombia, regarding the distribution of goods to the whole network of the three major chains of convenience stores currently operating in the city. Results show the power of the proposed simheuristic in comparison with traditional solution approaches based on mathematical programming.|
|Appears in Collections:||Articles|
Files in This Item:
There are no files associated with this item.
Items in repository are protected by copyright, with all rights reserved, unless otherwise indicated.