Fuzzy capacitated location-routing problem with simultaneous pickup and delivery demands

ABSTRACT In this work, the fuzzy capacitated location-routing problem with simultaneous pickup and delivery demands (FCLRP-SPD) is considered. This problem is a more realistic case of the capacitated location-routing problem and belongs to the reverse logistics. In FCLRP-SPD, a set of customers with simultaneous pickup and delivery demands should be supplied by a fleet of vehicles that start and end their tours at a single depot. In addition, both pickup and delivery demands of customers are fuzzy variables. The objective function is minimizing the routing costs, fixed costs of establishing the depot(s), and employing the vehicles. To model the problem, a fuzzy chance-constrained programming model is designed based upon the fuzzy credibility theory. To solve the FCLRP-SPD, a greedy clustering method (GCM) is developed, which includes four iterative phases. To achieve the best value of two types of parameters of the model, named ‘vehicle indexes’ and ‘depots indexes’, and to analyze their influences on the final solution, numerical experiments are carried out. Moreover, the efficiency of the GCM is demonstrated using a standard benchmark set of test problems.

[1]  Paolo Toth,et al.  A Granular Variable Tabu Neighborhood Search for the capacitated location-routing problem , 2014 .

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

[3]  L. Zadeh.  Fuzzy sets as a basis for a theory of possibility , 1999 .

[4]  Hokey Min,et al.  Combined location-routing problems: A synthesis and future research directions , 1998, Eur. J. Oper. Res..

[5]  Bassem Jarboui,et al.  Genetic algorithm with iterated local search for solving a location-routing problem , 2012, Expert Syst. Appl..

[6]  Savas Balin,et al.  Parallel machine scheduling with fuzzy processing times using a robust genetic algorithm and simulation , 2011, Information Sciences.

[7]  Robert LIN,et al.  NOTE ON FUZZY SETS , 2014 .

[8]  Bülent Çatay,et al.  A new saving-based ant algorithm for the Vehicle Routing Problem with Simultaneous Pickup and Delivery , 2010, Expert Syst. Appl..

[9]  Walter J. Gutjahr,et al.  A math-heuristic for the warehouse location-routing problem in disaster relief , 2014, Comput. Oper. Res..

[10]  Emmanouil E. Zachariadis,et al.  An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries , 2010, Eur. J. Oper. Res..

[11]  Roberto Montemanni,et al.  Coupling ant colony systems with strong local searches , 2012, Eur. J. Oper. Res..

[12]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[13]  Irene Loiseau,et al.  An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows , 2011, Comput. Oper. Res..

[14]  Mohammad Hossein Fazel Zarandi,et al.  The multi-depot capacitated location-routing problem with fuzzy travel times , 2011, Expert Syst. Appl..

[15]  Gilbert Laporte,et al.  Location routing problems , 1987 .

[16]  Jan Dethloff,et al.  Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up , 2001, OR Spectr..

[17]  Fermín Alfredo Tang Montané,et al.  A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service , 2006, Comput. Oper. Res..

[18]  Rashed Sahraeian,et al.  Using Greedy Clustering Method to Solve Capacitated Location-Routing Problem , 2009 .

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

[20]  Paolo Toth,et al.  A two-phase hybrid heuristic algorithm for the capacitated location-routing problem , 2013, Comput. Oper. Res..

[21]  José-Manuel Belenguer,et al.  A Branch and Cut method for the Capacitated Location-Routing Problem , 2006, 2006 International Conference on Service Systems and Service Management.

[22]  Daniele Vigo,et al.  Location Routing for Small Package Shippers with Subcontracting Options , 2012 .

[23]  Ahmad Sadeghieh,et al.  A location-routing problem model with multiple periods and fuzzy demands , 2014 .

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

[25]  F. Altiparmak,et al.  The location-routing problem with simultaneous pickup and delivery: Formulations and a heuristic approach , 2012 .

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

[27]  Panos M. Pardalos,et al.  Iterated local search embedded adaptive neighborhood selection approach for the multi-depot vehicle routing problem with simultaneous deliveries and pickups , 2015, Expert Syst. Appl..

[28]  Michael Drexl,et al.  A survey of variants and extensions of the location-routing problem , 2015, Eur. J. Oper. Res..

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

[30]  Shih-Wei Lin,et al.  Multi-start simulated annealing heuristic for the location routing problem with simultaneous pickup and delivery , 2014, Appl. Soft Comput..

[31]  Gülay Barbarosoglu,et al.  A tabu search algorithm for the vehicle routing problem , 1999, Comput. Oper. Res..

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

[33]  Mingyong Lai,et al.  A hybrid differential evolution algorithm to vehicle routing problem with fuzzy demands , 2009, J. Comput. Appl. Math..

[34]  Saïd Salhi,et al.  A hierarchical algorithm for the planar single-facility location routing problem , 2012, Comput. Oper. Res..

[35]  Mehdi Ghazanfari,et al.  A hybrid simulated annealing based heuristic for solving the location-routing problem with fuzzy demands , 2013 .

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

[37]  Mingyong Lai,et al.  The open vehicle routing problem with fuzzy demands , 2010, Expert Syst. Appl..

[38]  Mohammad Hossein Fazel Zarandi,et al.  Capacitated location-routing problem with time windows under uncertainty , 2013, Knowl. Based Syst..

[39]  Ziqi Wang,et al.  A new model for a 72-h post-earthquake emergency logistics location-routing problem under a random fuzzy environment , 2016 .

[40]  José Pinto Paixão,et al.  Using clustering analysis in a capacitated location-routing problem , 2007, Eur. J. Oper. Res..

[41]  A. Bonaert.  Introduction to the theory of Fuzzy subsets , 1977, Proceedings of the IEEE.

[42]  Olcay Polat,et al.  A perturbation based variable neighborhood search heuristic for solving the Vehicle Routing Problem with Simultaneous Pickup and Delivery with Time Limit , 2015, Eur. J. Oper. Res..

[43]  Ismail Karaoglan,et al.  A memetic algorithm for the capacitated location-routing problem with mixed backhauls , 2015, Comput. Oper. Res..

[44]  Zhe Wang,et al.  A two-stage heuristic algorithm for the school bus routing problem with mixed load plan , 2016 .

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

[46]  A. Kaufman,et al.  Introduction to the Theory of Fuzzy Subsets. , 1977 .

[47]  Yahia Zare Mehrjerdi,et al.  Using greedy clustering method to solve capacitated location-routing problem with fuzzy demands , 2013, Eur. J. Oper. Res..

[48]  Hasan Hosseini Nasab,et al.  Solving the dynamic capacitated location-routing problem with fuzzy demands by hybrid heuristic algorithm , 2014, Eur. J. Oper. Res..