Variable neighborhood strategy adaptive search for solving green 2-echelon location routing problem

Abstract This paper presents the green 2-echelon location routing problem (G2ELRP) which is a variant of the capacitated location-routing problem (CLRP) and the 2-echelon location routing problem (2ELRP), in that it deals with the collection problem for which routing decisions at both levels are required. The G2ELRP aims to minimize the total fuel consumption depending on the distance and the road conditions in both echelons. In the G2ELRP, that a customer can be served more than once is considered as a new constraint. Due to its complexity, the G2ELRP requires a complex problem formulation. A new variable neighborhood strategy adaptive search (VaNSAS) algorithm as a solution approach is introduced to solve the problem. The computational results indicate that the VaNSAS algorithm efficiently solves the case study problem and outperforms all other proposed heuristics. The G2ELRP model saved fuel cost by 3.71% over the traditional LRP. This demonstrates that the proposed VaNSAS is very efficient and not only useful for decreasing costs of rubber logistics, but also for application to other related agro-industries.

[1]  Vladimir Marianov,et al.  A milk collection problem with blending , 2016 .

[2]  Michel Gendreau,et al.  A branch-and-price approach for a multi-period vehicle routing problem , 2015, Comput. Oper. Res..

[3]  Chen-Fu Chien,et al.  Dynamic coordinated scheduling for supply chain under uncertain production time to empower smart production for Industry 3.5 , 2020, Comput. Ind. Eng..

[4]  Chien-Chun Ku,et al.  Digital transformation to empower smart production for Industry 3.5 and an empirical study for textile dyeing , 2020, Comput. Ind. Eng..

[5]  Xiaohang Yue,et al.  The two echelon open location routing problem: Mathematical model and hybrid heuristic , 2018, Comput. Ind. Eng..

[6]  Kanchana Sethanan,et al.  An Improved Differential Evolution Algorithm for Crop Planning in the Northeastern Region of Thailand , 2018, Mathematical and Computational Applications.

[7]  Helena Ramalhinho Dias Lourenço,et al.  Iterated Local Search , 2001, Handbook of Metaheuristics.

[8]  Mitsuo Gen,et al.  Accelerating genetic algorithms with GPU computing: A selective overview , 2019, Comput. Ind. Eng..

[9]  Gilbert Laporte,et al.  An adaptive large neighborhood search heuristic for the Pollution-Routing Problem , 2012, Eur. J. Oper. Res..

[10]  Louis-Martin Rousseau,et al.  A two-stage solution method for the annual dairy transportation problem , 2016, Eur. J. Oper. Res..

[11]  Xiaoyan Lei,et al.  The New Cooperative Medical Scheme in rural China: does more coverage mean more service and better health? , 2009, Health economics.

[12]  KoçÇağrı,et al.  The green vehicle routing problem , 2016 .

[13]  Richard F. Hartl,et al.  Heuristics with novel approaches for cyclical multiple parallel machine scheduling in sugarcane unloading systems , 2020, Int. J. Prod. Res..

[14]  Chen-Fu Chien,et al.  A Conceptual Framework for “Industry 3.5” to Empower Intelligent Manufacturing and Case Studies , 2017 .

[15]  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..

[16]  Mitsuo Gen,et al.  A parallel multi-objective genetic algorithm with learning based mutation for railway scheduling , 2019, Comput. Ind. Eng..

[17]  Mehmet Soysal,et al.  On the mathematical modeling of green one-to-one pickup and delivery problem with road segmentation , 2018 .

[18]  Maria Grazia Speranza,et al.  A survey on two-echelon routing problems , 2015, Comput. Oper. Res..

[19]  Vladimir Marianov,et al.  The milk collection problem with blending and collection points , 2017, Comput. Electron. Agric..

[20]  Kannan Govindan,et al.  Two-echelon multiple-vehicle location-routing problem with time windows for optimization of sustainable supply chain network of perishable food , 2014 .

[21]  Christian Prins,et al.  Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking , 2012, Eur. J. Oper. Res..

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

[23]  Ammar Oulamara,et al.  The two-echelon multi-products location-routing problem with pickup and delivery: formulation and heuristic approaches , 2016 .

[24]  Teodor Gabriel Crainic,et al.  Lower and upper bounds for the two-echelon capacitated location-routing problem , 2012, Comput. Oper. Res..

[25]  Young Dae Ko,et al.  An efficient integration of the genetic algorithm and the reinforcement learning for optimal deployment of the wireless charging electric tram system , 2019, Comput. Ind. Eng..

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

[27]  Ammar Oulamara,et al.  A Local Search approach for the Two–Echelon Multi-products Location–Routing problem with Pickup and Delivery , 2015 .

[28]  VidovićMilorad,et al.  A two-echelon location-routing model for designing recycling logistics networks with profit , 2016 .

[29]  Chen-Fu Chien,et al.  An empirical study for smart production for TFT-LCD to empower Industry 3.5 , 2017 .

[30]  Ismail Karaoglan,et al.  The green vehicle routing problem: A heuristic based exact solution approach , 2016, Appl. Soft Comput..

[31]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.