Location Decision Making and Transportation Route Planning Considering Fuel Consumption

This study presents the Location Routing Problem (LRP) for which we have created a model for the integration of locating facilities and vehicle routing decisions to solve the problem. The case study is the Palm Oil Collection Center, which is also important for the supply chain system. A mathematical model was made to minimize the total cost of a facility-opening cost, fixed cost of vehicle uses and fuel consumption cost. The fuel consumption cost relies on the distance and road conditions, in case of poor physical condition of a road, and its width, which can be affected the speed of the vehicle as well as the used fuel. Thus, we propose an Adaptive Large Neighborhood Search (ALNS) based on heuristic for solving the LRP. The ALNS method was tested with three datasets of samples divided into small, medium and large problems. Then, the results were compared with the results from the exact method by the Lingo program. The computational study indicated that the ALNS algorithm was competitive to the results of the Lingo for all instance sizes. Moreover, the ALNS was more effective than the exact method; approximately 99% in terms of processing time. We extended this approach to solve the case study, which was considered to be the largest problem, and the ALNS algorithm was efficient with acceptable solutions and short processing time. Therefore, the proposed method provided an effective solution to manage location routing decision of the palm oil collection center.

[1]  Raknoi Akararungruangkul,et al.  Modified Differential Evolution Algorithm Solving the Special Case of Location Routing Problem , 2018, Mathematical and Computational Applications.

[2]  Yingwu Chen,et al.  An improved adaptive large neighborhood search algorithm for multiple agile satellites scheduling , 2018, Comput. Oper. Res..

[3]  Henry Y. K. Lau,et al.  An adaptive large neighborhood search heuristic for solving a robust gate assignment problem , 2017, Expert Syst. Appl..

[4]  Saïd Salhi,et al.  Location-routing: Issues, models and methods , 2007, Eur. J. Oper. Res..

[5]  David Pisinger,et al.  An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows , 2006, Transp. Sci..

[6]  Marco Antonio Moreira de Carvalho,et al.  Adaptive large neighborhood search applied to the design of electronic circuits , 2018, Appl. Soft Comput..

[7]  Stefan Nickel,et al.  Multiperiod Location-Routing with Decoupled Time Scales , 2012, Eur. J. Oper. Res..

[8]  Glaydston Mattos Ribeiro,et al.  An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem , 2012, Comput. Oper. Res..

[9]  Ismail Karaoglan,et al.  A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery , 2011, Eur. J. Oper. Res..

[10]  Nenad Bjelic,et al.  A two-echelon location-routing model for designing recycling logistics networks with profit: MILP and heuristic approach , 2016, Expert Syst. Appl..

[11]  Suyi Kim,et al.  Decomposition Analysis of Greenhouse Gas Emissions in Korea’s Transportation Sector , 2019, Sustainability.

[12]  Xinyu Li,et al.  Carbon reduction in the location routing problem with heterogeneous fleet, simultaneous pickup-delivery and time windows , 2017, KES.

[13]  Funda Samanlioglu,et al.  A multi-objective mathematical model for the industrial hazardous waste location-routing problem , 2013, Eur. J. Oper. Res..

[14]  Teodor Gabriel Crainic,et al.  An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics , 2012, Comput. Oper. Res..

[15]  Vedat Verter,et al.  A Bi-Objective Model for the Used Oil Location-Routing Problem , 2014, Comput. Oper. Res..

[16]  Yuchun Xu,et al.  Development of a fuel consumption optimization model for the capacitated vehicle routing problem , 2012, Comput. Oper. Res..

[17]  Shin-Yu Lin,et al.  A simulated annealing heuristic for the open location-routing problem , 2015, Comput. Oper. Res..

[18]  Kyungbae Park,et al.  Dynamics from open innovation to evolutionary change , 2016 .

[19]  J. Yun,et al.  The Effect of Open Innovation on Technology Value and Technology Transfer: A Comparative Analysis of the Automotive, Robotics, and Aviation Industries of Korea , 2018, Sustainability.

[20]  Gilbert Laporte,et al.  The Pollution-Routing Problem , 2011 .

[21]  Maximilian Schiffer,et al.  The electric location routing problem with time windows and partial recharging , 2017, Eur. J. Oper. Res..

[22]  Yuan Li,et al.  Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests , 2016, Eur. J. Oper. Res..

[23]  Seokcheon Lee,et al.  The Latency Location-Routing Problem , 2016, Eur. J. Oper. Res..

[24]  Kanchana Sethanan,et al.  An Algorithm to Manage Transportation Logistics That Considers Sabotage Risk , 2018 .

[25]  Sibel A. Alumur,et al.  A new model for the hazardous waste location-routing problem , 2007, Comput. Oper. Res..

[26]  Ismi Rajiani,et al.  NATIONAL CULTURE AS MODALITY IN MANAGING THE CARBON ECONOMY IN SOUTHEAST ASIA , 2018, Polish Journal of Management Studies.

[27]  Michel Gendreau,et al.  An Adaptive Large Neighborhood Search for a Vehicle Routing Problem with Multiple Trips , 2010 .

[28]  Bülent Çatay,et al.  An Adaptive Large Neighborhood Search for an E-grocery Delivery Routing Problem , 2016, Comput. Oper. Res..

[29]  Worapot Sirirak,et al.  Marketplace Location Decision Making and Tourism Route Planning , 2018, Administrative Sciences.

[30]  Christian Prins,et al.  A survey of recent research on location-routing problems , 2014, Eur. J. Oper. Res..

[31]  Mahdi Alinaghian,et al.  Multi-depot multi-compartment vehicle routing problem, solved by a hybrid adaptive large neighborhood search , 2018 .