This page has only limited features, please log in for full access.
Carlos L. Quintero-Araujo is associate professor in the Department of Operations Management at Universidad de La Sabana. He holds a Ph.D. in Networks and Information Technologies from Universitat Oberta de Catalunya, Spain. His research interests are routing problems, metaheuristics, simheuristics, horizontal cooperation, and mathematical modeling. Currently, he is the Director of both the Doctoral Program in Management of Organizations and the Operations and Supply Chain Management Research Group at Universidad de La Sabana.
The coronavirus disease 2019, known as COVID-19, has generated an imminent necessity for personal protective equipment (PPE) that became essential for all populations and much more for health centers, clinics, hospitals, and intensive care units (ICUs). Considering this fact, one of the main issues for cities’ governments is the distribution of PPE to ICUs to ensure the protection of medical personnel and, therefore, the sustainability of the health system. Aware of this challenge, in this paper, we propose a simheuristic approach for supplying personal protective equipment to intensive care units which is based on the location-routing problem (LRP). The objective is to provide decision makers with a decision support tool that considers uncertain demands, distribution cost, and reliability in the solutions. To validate our approach, a case study in Bogotá, Colombia was analyzed. Computational results show the efficiency of the usage of alternative safety stock policies to face demand uncertainty in terms of both expected stochastic costs and reliabilities.
Andrés Martínez-Reyes; Carlos Quintero-Araújo; Elyn Solano-Charris. Supplying Personal Protective Equipment to Intensive Care Units during the COVID-19 Outbreak in Colombia. A Simheuristic Approach Based on the Location-Routing Problem. Sustainability 2021, 13, 7822 .
AMA StyleAndrés Martínez-Reyes, Carlos Quintero-Araújo, Elyn Solano-Charris. Supplying Personal Protective Equipment to Intensive Care Units during the COVID-19 Outbreak in Colombia. A Simheuristic Approach Based on the Location-Routing Problem. Sustainability. 2021; 13 (14):7822.
Chicago/Turabian StyleAndrés Martínez-Reyes; Carlos Quintero-Araújo; Elyn Solano-Charris. 2021. "Supplying Personal Protective Equipment to Intensive Care Units during the COVID-19 Outbreak in Colombia. A Simheuristic Approach Based on the Location-Routing Problem." Sustainability 13, no. 14: 7822.
During the outbreak of coronavirus disease 2019 (COVID-19) in Bogotá, Colombia, some strategies for dealing with the increasing number of infected people and the level of occupation of intensive care units include the use of Personal Protective Equipment (PPE). PPE is a crucial component for patient care and a priority for protecting healthcare workers. For attending this necessity, the location of distribution centers within the city and the corresponding routes to supply the intensive care units (ICU) with PPE have an important role. Formally, this problem is defined as the Location Routing Problem (LRP). The LRP is an NP-Hard problem that combines the Facility Location Problem (FLP) and the Vehicle Routing Problem with Multiple Depots (MDVRP). This work presents a decision support tool based on a simheuristic method that hybridize an Iterated Local Search (ILS) algorithm with Monte Carlo simulation to deal with the LRP with uncertain demands. Realistic data from Bogotá (Colombia) was retrieved using Google Maps to characterize the geographical distribution of both potential facilities and ICUs, while demands were generated using the uniform probability distribution. Our preliminary results suggest the competitiveness of the algorithm in both the deterministic and the stochastic versions of the LRP.
Andrés Martínez-Reyes; Carlos L. Quintero-Araújo; Elyn L. Solano-Charris. A Decision Support Tool for the Location Routing Problem During the COVID-19 Outbreak in Colombia. Communications in Computer and Information Science 2021, 33 -46.
AMA StyleAndrés Martínez-Reyes, Carlos L. Quintero-Araújo, Elyn L. Solano-Charris. A Decision Support Tool for the Location Routing Problem During the COVID-19 Outbreak in Colombia. Communications in Computer and Information Science. 2021; ():33-46.
Chicago/Turabian StyleAndrés Martínez-Reyes; Carlos L. Quintero-Araújo; Elyn L. Solano-Charris. 2021. "A Decision Support Tool for the Location Routing Problem During the COVID-19 Outbreak in Colombia." Communications in Computer and Information Science , no. : 33-46.
During recent years, Last-mile deliveries (LMD) have become relevant due to its application in e-commerce, urban logistics, and food delivery among others. This work addresses an LMD denoted as a Vehicle Routing Problem with time windows (VRPTW) and aims to minimize total time of the distribution process (i.e., makespan). The LMD is an NP-Hard problem that refers to the delivery of goods from a consolidation center to a destination. For solving the problem, a spreadsheet-based solution that employs a multi-start algorithm based on the biased-randomized version of the nearest neighbor heuristic is introduced. Real historical data of last-mile deliveries for dairy products in Bogotá (Colombia) was considered for evaluating our proposed method. Computational experiments are carried out to show the competitiveness of our method in terms of makespan, number of vehicles, average vehicle occupancy, average load and costs. Some insights for future works are also provided.
José G. Sanabria-Rey; Elyn L. Solano-Charris; Carlos Alberto Vega-Mejía; Carlos L. Quintero-Araújo. Solving Last-Mile Deliveries for Dairy Products Using a Biased Randomization-Based Spreadsheet. A Case Study. American Journal of Mathematical and Management Sciences 2021, 1 -16.
AMA StyleJosé G. Sanabria-Rey, Elyn L. Solano-Charris, Carlos Alberto Vega-Mejía, Carlos L. Quintero-Araújo. Solving Last-Mile Deliveries for Dairy Products Using a Biased Randomization-Based Spreadsheet. A Case Study. American Journal of Mathematical and Management Sciences. 2021; ():1-16.
Chicago/Turabian StyleJosé G. Sanabria-Rey; Elyn L. Solano-Charris; Carlos Alberto Vega-Mejía; Carlos L. Quintero-Araújo. 2021. "Solving Last-Mile Deliveries for Dairy Products Using a Biased Randomization-Based Spreadsheet. A Case Study." American Journal of Mathematical and Management Sciences , no. : 1-16.
The location routing problem integrates both a facility location and a vehicle routing problem. Each of these problems are NP-hard in nature, which justifies the use of heuristic-based algorithms when dealing with large-scale instances that need to be solved in reasonable computing times. This paper discusses a realistic variant of the problem that considers facilities of different sizes and two types of uncertainty conditions. In particular, we assume that some customers’ demands are stochastic, while others follow a fuzzy pattern. An iterated local search metaheuristic is integrated with simulation and fuzzy logic to solve the aforementioned problem, and a series of computational experiments are run to illustrate the potential of the proposed algorithm.
Rafael Tordecilla; Pedro Copado-Méndez; Javier Panadero; Carlos Quintero-Araujo; Jairo Montoya-Torres; Angel Juan. Combining Heuristics with Simulation and Fuzzy Logic to Solve a Flexible-Size Location Routing Problem under Uncertainty. Algorithms 2021, 14, 45 .
AMA StyleRafael Tordecilla, Pedro Copado-Méndez, Javier Panadero, Carlos Quintero-Araujo, Jairo Montoya-Torres, Angel Juan. Combining Heuristics with Simulation and Fuzzy Logic to Solve a Flexible-Size Location Routing Problem under Uncertainty. Algorithms. 2021; 14 (2):45.
Chicago/Turabian StyleRafael Tordecilla; Pedro Copado-Méndez; Javier Panadero; Carlos Quintero-Araujo; Jairo Montoya-Torres; Angel Juan. 2021. "Combining Heuristics with Simulation and Fuzzy Logic to Solve a Flexible-Size Location Routing Problem under Uncertainty." Algorithms 14, no. 2: 45.
The design of supply chain networks (SCNs) aims at determining the number, location, and capacity of production facilities, as well as the allocation of markets (customers) and suppliers to one or more of these facilities. This paper reviews the existing literature on the use of simulation-optimization methods in the design of resilient SCNs. From this review, we classify some of the many works in the topic according to factors such as their methodology, the approach they use to deal with uncertainty and risk, etc. The paper also identifies several research opportunities, such as the inclusion of multiple criteria (e.g., monetary, environmental, and social dimensions) during the design-optimization process and the convenience of considering hybrid approaches combining metaheuristic algorithms, simulation, and machine learning methods to account for uncertainty and dynamic conditions, respectively.
Rafael D. Tordecilla; Angel A. Juan; Jairo R. Montoya-Torres; Carlos L. Quintero-Araujo; Javier Panadero. Simulation-optimization methods for designing and assessing resilient supply chain networks under uncertainty scenarios: A review. Simulation Modelling Practice and Theory 2020, 106, 102166 -102166.
AMA StyleRafael D. Tordecilla, Angel A. Juan, Jairo R. Montoya-Torres, Carlos L. Quintero-Araujo, Javier Panadero. Simulation-optimization methods for designing and assessing resilient supply chain networks under uncertainty scenarios: A review. Simulation Modelling Practice and Theory. 2020; 106 ():102166-102166.
Chicago/Turabian StyleRafael D. Tordecilla; Angel A. Juan; Jairo R. Montoya-Torres; Carlos L. Quintero-Araujo; Javier Panadero. 2020. "Simulation-optimization methods for designing and assessing resilient supply chain networks under uncertainty scenarios: A review." Simulation Modelling Practice and Theory 106, no. : 102166-102166.
The introduction of Electric Vehicles (EVs) in modern fleets facilitates a shift towards greener road transportation practices. However, the driving ranges of EVs are limited by the duration of their batteries, which raises some operational challenges. This paper discusses the Location Routing Problem with a Constrained Distance (LRPCD), which is a natural extension of the Location Routing Problem when EVs are utilized. A fast multi-start heuristic and a metaheuristic are proposed to solve the LRPCD. The former combines biased-randomization techniques with the well-known Tillman’s heuristic for the Multi-Depot Vehicle Routing Problem. The latter incorporates the biased-randomized approach into the Variable Neighborhood Search (VNS) framework. A series of computational experiments show that the multi-start heuristic is able to generate good-quality solutions in just a few seconds, while the biased-rendomized VNS metaheuristic provides higher-quality solutions by employing more computational time.
Abdullah Almouhanna; Carlos L. Quintero-Araujo; Javier Panadero; Angel A. Juan; Banafsheh Khosravi; Djamila Ouelhadj. The location routing problem using electric vehicles with constrained distance. Computers & Operations Research 2019, 115, 104864 .
AMA StyleAbdullah Almouhanna, Carlos L. Quintero-Araujo, Javier Panadero, Angel A. Juan, Banafsheh Khosravi, Djamila Ouelhadj. The location routing problem using electric vehicles with constrained distance. Computers & Operations Research. 2019; 115 ():104864.
Chicago/Turabian StyleAbdullah Almouhanna; Carlos L. Quintero-Araujo; Javier Panadero; Angel A. Juan; Banafsheh Khosravi; Djamila Ouelhadj. 2019. "The location routing problem using electric vehicles with constrained distance." Computers & Operations Research 115, no. : 104864.
The capacitated location routing problem (CLRP) integrates a facility location problem with a multi-depot vehicle routing problem. We consider the CLRP with stochastic demands, whose specific values are only revealed upon reaching each customer. The main goal is to minimise the expected costs of: (i) opening facilities, (ii) using a fleet of vehicles, (iii) executing a routing plan, and (iv) applying corrective actions. The latter are required whenever a route failure occurs due to unexpected high demands. We propose a simheuristic algorithm hybridizing simulation with an iterated local search metaheuristic, aimed at: (i) proposing a safety-stock policy to diminish the likelihood of route failure; and, (ii) estimating the expected cost and the reliability of each “elite” solution. We assess our approach on classical CLRP benchmarks, which are later extended to consider demand uncertainty. Finally, we also discuss the effects of the safety-stock policy on costs and reliability.
Carlos L. Quintero-Araujo; Daniel Guimarans; Angel A. Juan. A simheuristic algorithm for the capacitated location routing problem with stochastic demands. Journal of Simulation 2019, 1 -18.
AMA StyleCarlos L. Quintero-Araujo, Daniel Guimarans, Angel A. Juan. A simheuristic algorithm for the capacitated location routing problem with stochastic demands. Journal of Simulation. 2019; ():1-18.
Chicago/Turabian StyleCarlos L. Quintero-Araujo; Daniel Guimarans; Angel A. Juan. 2019. "A simheuristic algorithm for the capacitated location routing problem with stochastic demands." Journal of Simulation , no. : 1-18.
Sachin Nataraj; Daniele Ferone; Carlos Quintero-Araujo; Angel A. Juan; Paola Festa. Consolidation centers in city logistics: A cooperative approach based on the location routing problem. International Journal of Industrial Engineering Computations 2019, 393 -404.
AMA StyleSachin Nataraj, Daniele Ferone, Carlos Quintero-Araujo, Angel A. Juan, Paola Festa. Consolidation centers in city logistics: A cooperative approach based on the location routing problem. International Journal of Industrial Engineering Computations. 2019; ():393-404.
Chicago/Turabian StyleSachin Nataraj; Daniele Ferone; Carlos Quintero-Araujo; Angel A. Juan; Paola Festa. 2019. "Consolidation centers in city logistics: A cooperative approach based on the location routing problem." International Journal of Industrial Engineering Computations , no. : 393-404.
Andrés Muñoz-Villamizar; Elyn Solano; Carlos Quintero-Araujo; Javier Santos. Sustainability and digitalization in supply chains: A bibliometric analysis. Uncertain Supply Chain Management 2019, 703 -712.
AMA StyleAndrés Muñoz-Villamizar, Elyn Solano, Carlos Quintero-Araujo, Javier Santos. Sustainability and digitalization in supply chains: A bibliometric analysis. Uncertain Supply Chain Management. 2019; ():703-712.
Chicago/Turabian StyleAndrés Muñoz-Villamizar; Elyn Solano; Carlos Quintero-Araujo; Javier Santos. 2019. "Sustainability and digitalization in supply chains: A bibliometric analysis." Uncertain Supply Chain Management , no. : 703-712.
Andrés Muñoz-Villamizar; Carlos L. Quintero-Araújo; Jairo R. Montoya-Torres; Javier Faulin. Short- and mid-term evaluation of the use of electric vehicles in urban freight transport collaborative networks: a case study. International Journal of Logistics Research and Applications 2018, 22, 229 -252.
AMA StyleAndrés Muñoz-Villamizar, Carlos L. Quintero-Araújo, Jairo R. Montoya-Torres, Javier Faulin. Short- and mid-term evaluation of the use of electric vehicles in urban freight transport collaborative networks: a case study. International Journal of Logistics Research and Applications. 2018; 22 (3):229-252.
Chicago/Turabian StyleAndrés Muñoz-Villamizar; Carlos L. Quintero-Araújo; Jairo R. Montoya-Torres; Javier Faulin. 2018. "Short- and mid-term evaluation of the use of electric vehicles in urban freight transport collaborative networks: a case study." International Journal of Logistics Research and Applications 22, no. 3: 229-252.
The Location Routing Problem (LRP) is one of the most important challenging problems in supply chain design since it includes all decision levels in operations management. Due to its complexity, heuristics approaches seem to be the right choice to solve it. In this paper we introduce a simple but powerful approach based on biased randomization techniques to tackle the capacitated version of the LRP. Preliminary tests show that near-optimal or near-BKS can be found in a very short time.
Carlos L. Quintero-Araujo; Angel A. Juan; Juan P. Caballero-Villalobos; Jairo R. Montoya-Torres; Javier Faulin. A New Randomized Procedure to Solve the Location Routing Problem. Advances in Intelligent Systems and Computing 2018, 247 -254.
AMA StyleCarlos L. Quintero-Araujo, Angel A. Juan, Juan P. Caballero-Villalobos, Jairo R. Montoya-Torres, Javier Faulin. A New Randomized Procedure to Solve the Location Routing Problem. Advances in Intelligent Systems and Computing. 2018; ():247-254.
Chicago/Turabian StyleCarlos L. Quintero-Araujo; Angel A. Juan; Juan P. Caballero-Villalobos; Jairo R. Montoya-Torres; Javier Faulin. 2018. "A New Randomized Procedure to Solve the Location Routing Problem." Advances in Intelligent Systems and Computing , no. : 247-254.
In a global and competitive economy, efficient supply networks are essential for modern enterprises. Horizontal cooperation (HC) concepts represent a promising strategy to increase the performance of supply chains. HC is based on sharing resources and making joint decisions among different agents at the same level of the supply chain. This paper analyzes different cooperation scenarios concerning integrated routing and facility‐location decisions in road transportation: (a) a noncooperative scenario in which all decisions are individually taken (each enterprise addresses its own vehicle routing problem [VRP]); (b) a semicooperative scenario in which route‐planning decisions are jointly taken (facilities and fleets are shared and enterprises face a joint multidepot VRP); and (c) a fully cooperative scenario in which route‐planning and facility‐location decisions are jointly taken (also customers are shared, and thus enterprises face a general location routing problem). Our analysis explores how this increasing level of HC leads to a higher flexibility and, therefore, to a lower total distribution cost. A hybrid metaheuristic algorithm, combining biased randomization with a variable neighborhood search framework, is proposed to solve each scenario. This allows us to quantify the differences among these scenarios, both in terms of monetary and environmental costs. Our solving approach is tested on a range of benchmark instances, outperforming previously reported results.
Carlos Leonardo Quintero Araujo; Aljoscha Gruler; Angel A. Juan; Javier Faulin. Using horizontal cooperation concepts in integrated routing and facility-location decisions. International Transactions in Operational Research 2017, 26, 551 -576.
AMA StyleCarlos Leonardo Quintero Araujo, Aljoscha Gruler, Angel A. Juan, Javier Faulin. Using horizontal cooperation concepts in integrated routing and facility-location decisions. International Transactions in Operational Research. 2017; 26 (2):551-576.
Chicago/Turabian StyleCarlos Leonardo Quintero Araujo; Aljoscha Gruler; Angel A. Juan; Javier Faulin. 2017. "Using horizontal cooperation concepts in integrated routing and facility-location decisions." International Transactions in Operational Research 26, no. 2: 551-576.
Ongoing population growth in cities and increasing waste production has made the optimisation of urban waste management a critical task for local governments. Route planning in waste collection can be formulated as an extended version of the well-known vehicle routing problem, for which a wide range of solution methods already exist. Despite the fact that real-life applications are characterised by high uncertainty levels, most works on waste collection assume deterministic inputs. In order to partially close this literature gap, this paper first proposes a competitive metaheuristic algorithm based on a variable neighbourhood search framework for the deterministic waste collection problem. Then, this metaheuristic is extended to a simheuristic algorithm in order to deal with the stochastic problem version. This extension is achieved by integrating simulation into the metaheuristic framework, which also allows a closer risk analysis of the best-found stochastic solutions. Different computational experiments illustrate the potential of our methodology. [Received: 13 January 2016; Revised: 25 April 2016; Revised: 19 September 2016; Revised: 18 October 2016; Accepted: 25 October 2016]
Aljoscha Gruler; Carlos Leonardo Quintero Araujo; Laura Calvet; Angel Juan. Waste collection under uncertainty: a simheuristic based on variable neighbourhood search. European J. of Industrial Engineering 2017, 11, 228 .
AMA StyleAljoscha Gruler, Carlos Leonardo Quintero Araujo, Laura Calvet, Angel Juan. Waste collection under uncertainty: a simheuristic based on variable neighbourhood search. European J. of Industrial Engineering. 2017; 11 (2):228.
Chicago/Turabian StyleAljoscha Gruler; Carlos Leonardo Quintero Araujo; Laura Calvet; Angel Juan. 2017. "Waste collection under uncertainty: a simheuristic based on variable neighbourhood search." European J. of Industrial Engineering 11, no. 2: 228.
The challenge in last-mile supply chains deliveries is to maintain and improve the operational cost-effectiveness 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.
Carlos Leonardo Quintero Araujo; Angel Juan; Jairo R. Montoya-Torres; Andrés Muñoz-Villamizar. A simheuristic algorithm for Horizontal Cooperation in urban distribution: Application to a case study in COLOMBIA. 2016 Winter Simulation Conference (WSC) 2016, 2193 -2204.
AMA StyleCarlos Leonardo Quintero Araujo, Angel Juan, Jairo R. Montoya-Torres, Andrés Muñoz-Villamizar. A simheuristic algorithm for Horizontal Cooperation in urban distribution: Application to a case study in COLOMBIA. 2016 Winter Simulation Conference (WSC). 2016; ():2193-2204.
Chicago/Turabian StyleCarlos Leonardo Quintero Araujo; Angel Juan; Jairo R. Montoya-Torres; Andrés Muñoz-Villamizar. 2016. "A simheuristic algorithm for Horizontal Cooperation in urban distribution: Application to a case study in COLOMBIA." 2016 Winter Simulation Conference (WSC) , no. : 2193-2204.
Horizontal Cooperation (HC) in transportation activities has the potential to decrease supply chain costs and the environmental impact of delivery vehicles related to greenhouse gas emissions and noise. Especially in urban areas the sharing of information and facilities among members of the same supply chain level promises to be an innovative transportation concept. This paper discusses the potential benefits of HC in supply chains with stochastic demands by applying a simheuristic approach. For this, we integrate Monte Carlo Simulation into a metaheuristic process based on Iterated Local Search and Biased Randomization. A non-cooperative scenario is compared to its cooperative counterpart which is formulated as multi-depot Vehicle Routing Problem with stochastic demands (MDVRPSD).
Carlos L. Quintero-Araujo; Aljoscha Gruler; Angel Juan. Quantifying Potential Benefits of Horizontal Cooperation in Urban Transportation Under Uncertainty: A Simheuristic Approach. Transactions on Petri Nets and Other Models of Concurrency XV 2016, 280 -289.
AMA StyleCarlos L. Quintero-Araujo, Aljoscha Gruler, Angel Juan. Quantifying Potential Benefits of Horizontal Cooperation in Urban Transportation Under Uncertainty: A Simheuristic Approach. Transactions on Petri Nets and Other Models of Concurrency XV. 2016; ():280-289.
Chicago/Turabian StyleCarlos L. Quintero-Araujo; Aljoscha Gruler; Angel Juan. 2016. "Quantifying Potential Benefits of Horizontal Cooperation in Urban Transportation Under Uncertainty: A Simheuristic Approach." Transactions on Petri Nets and Other Models of Concurrency XV , no. : 280-289.
The location routing problem (LRP) involves the three key decision levels in supply chain design, that is, strategic, tactical, and operational levels. It deals with the simultaneous decisions of (a) locating facilities (e.g., depots or warehouses), (b) assigning customers to facilities, and (c) defining routes of vehicles departing from and finishing at each facility to serve the associated customers’ demands. In this paper, a two-phase metaheuristic procedure is proposed to deal with the capacitated version of the LRP (CLRP). Here, decisions must be made taking into account limited capacities of both facilities and vehicles. In the first phase (selection of promising solutions), we determine the depots to be opened, perform a fast allocation of customers to open depots, and generate a complete CLRP solution using a fast routing heuristic. This phase is executed several times in order to keep the most promising solutions. In the second phase (solution refinement), for each of the selected solutions we apply a perturbation procedure to the customer allocation followed by a more intensive routing heuristic. Computational experiments are carried out using well-known instances from the literature. Results show that our approach is quite competitive since it offers average gaps below 0.4% with respect to the best-known solutions (BKSs) for all tested sets in short computational times.
Carlos L. Quintero-Araujo; Juan Pablo Caballero-Villalobos; Angel Juan; Jairo R. Montoya-Torres. A biased-randomized metaheuristic for the capacitated location routing problem. International Transactions in Operational Research 2016, 24, 1079 -1098.
AMA StyleCarlos L. Quintero-Araujo, Juan Pablo Caballero-Villalobos, Angel Juan, Jairo R. Montoya-Torres. A biased-randomized metaheuristic for the capacitated location routing problem. International Transactions in Operational Research. 2016; 24 (5):1079-1098.
Chicago/Turabian StyleCarlos L. Quintero-Araujo; Juan Pablo Caballero-Villalobos; Angel Juan; Jairo R. Montoya-Torres. 2016. "A biased-randomized metaheuristic for the capacitated location routing problem." International Transactions in Operational Research 24, no. 5: 1079-1098.
Carlos L. Quintero-Araujo; Adela Pagès-Bernaus; Angel Juan; Oriol Travesset; Nicolas Jozefowiez. Planning Freight Delivery Routes in Mountainous Regions. Information Systems 2016, 123 -132.
AMA StyleCarlos L. Quintero-Araujo, Adela Pagès-Bernaus, Angel Juan, Oriol Travesset, Nicolas Jozefowiez. Planning Freight Delivery Routes in Mountainous Regions. Information Systems. 2016; ():123-132.
Chicago/Turabian StyleCarlos L. Quintero-Araujo; Adela Pagès-Bernaus; Angel Juan; Oriol Travesset; Nicolas Jozefowiez. 2016. "Planning Freight Delivery Routes in Mountainous Regions." Information Systems , no. : 123-132.
Transport infrastructure investments have been of the highest importance in cities all around the world in order to facilitate people and freight mobility within congested urban areas. This paper studies the problems of freight delivery in congested cities and the location of urban distribution centres. The problem is modelled using the stochastic version of the Location‐Routing Problem in which vehicle velocity and delivery costs are probabilistic parameters. A discrete‐event computer simulation model is proposed in which a vehicle routing optimisation engine is incorporated. The approach is tested using random‐generated datasets and numerical results show its effectiveness when tracking with different data structures. Hence, the approach shows to be promising for real‐life application.
Nilson Herazopadilla; Jairo R Montoyatorres; S. Nieto-Isaza; L. Ramirez Polo; Leandro Nunes De Castro; Diana G. Ramirez-Rios; Carlos Leonardo Quintero Araujo. Simulation-Based Analysis of Urban Freight Transport with Stochastic Features. Enterprise Interoperability 2015, 175 -180.
AMA StyleNilson Herazopadilla, Jairo R Montoyatorres, S. Nieto-Isaza, L. Ramirez Polo, Leandro Nunes De Castro, Diana G. Ramirez-Rios, Carlos Leonardo Quintero Araujo. Simulation-Based Analysis of Urban Freight Transport with Stochastic Features. Enterprise Interoperability. 2015; ():175-180.
Chicago/Turabian StyleNilson Herazopadilla; Jairo R Montoyatorres; S. Nieto-Isaza; L. Ramirez Polo; Leandro Nunes De Castro; Diana G. Ramirez-Rios; Carlos Leonardo Quintero Araujo. 2015. "Simulation-Based Analysis of Urban Freight Transport with Stochastic Features." Enterprise Interoperability , no. : 175-180.
Camilo Torres-Ovalle; Jairo R. Montoya-Torres; Carlos Quintero-Araujo; Angelica Sarmiento Lepesqueur; Monica Castilla Luna. University Course Scheduling and Classroom Assignment. Ingenieria y Universidad 2014, 18, 1 .
AMA StyleCamilo Torres-Ovalle, Jairo R. Montoya-Torres, Carlos Quintero-Araujo, Angelica Sarmiento Lepesqueur, Monica Castilla Luna. University Course Scheduling and Classroom Assignment. Ingenieria y Universidad. 2014; 18 (1):1.
Chicago/Turabian StyleCamilo Torres-Ovalle; Jairo R. Montoya-Torres; Carlos Quintero-Araujo; Angelica Sarmiento Lepesqueur; Monica Castilla Luna. 2014. "University Course Scheduling and Classroom Assignment." Ingenieria y Universidad 18, no. 1: 1.
In this paper, we elaborate a methodology to study a particular case of collaborative network: city logistics. We identify that many solutions for urban logistics are, most of time, badly evaluated. Indeed, the theory often predicts a positive effect but the reality is most of time counterbalanced. We tried to fill this gap by making use of innovative methods. To do so, we mobilize several domains of knowledge: operational research, game theory and transportation studies on real cases. We suggest a solution to anticipate the level of activity of an Urban Consolidation Center and determine the condition under which it generates benefit for a carrier using or not, the collaborative network. We present the result obtained by application of our method on the real case of the city of Saint-Etienne.
Lucile Faure; Guillaume Battaia; Guillaume Marques; Romain Guillaume; Carlos A. Vega-Mejía; Jairo R. Montova-Torres; Andrés Muñoz-Villamizar; Carlos Leonardo Quintero Araujo. How to anticipate the level of activity of a sustainable collaborative network: The case of urban freight delivery through logistics platforms. 2013 7th IEEE International Conference on Digital Ecosystems and Technologies (DEST) 2013, 126 -131.
AMA StyleLucile Faure, Guillaume Battaia, Guillaume Marques, Romain Guillaume, Carlos A. Vega-Mejía, Jairo R. Montova-Torres, Andrés Muñoz-Villamizar, Carlos Leonardo Quintero Araujo. How to anticipate the level of activity of a sustainable collaborative network: The case of urban freight delivery through logistics platforms. 2013 7th IEEE International Conference on Digital Ecosystems and Technologies (DEST). 2013; ():126-131.
Chicago/Turabian StyleLucile Faure; Guillaume Battaia; Guillaume Marques; Romain Guillaume; Carlos A. Vega-Mejía; Jairo R. Montova-Torres; Andrés Muñoz-Villamizar; Carlos Leonardo Quintero Araujo. 2013. "How to anticipate the level of activity of a sustainable collaborative network: The case of urban freight delivery through logistics platforms." 2013 7th IEEE International Conference on Digital Ecosystems and Technologies (DEST) , no. : 126-131.