Using Clustering Method to Solve Two Echelon Multi-Products Location-Routing Problem with Pickup and Delivery

Younes Rahmani, Ammar Oulamara, Wahiba Ramdane Cherif

Abstract

In this paper, we consider the Location Routing Problem in two-echelon network with Multi-Products, and Pickup and Delivery (LRP-MPPD-2E). The objective of LRP-MPP-2E is to minimize simultaneously the location and routing costs, considering many realistic non-tackled constraints in the literature. The first echelon deals with simultaneously selection of processing centers from a set of potential sites and the construction of the primary tours such that each primary tour starts from the main depot, visits the selected processing centers and returns to the main depot. The second echelon aims at assigning customers to the selected processing centers and defining the secondary tours. Each secondary tour, starts at a processing center, visits a set of customers, through one or several processing centers, and then returns to the first processing center. We develop a Hybrid Clustering Algorithm (HCA) with the objective of constructing Global-Clusters such that each Global-Cluster represents the set of clients associated to one feasible secondary tour, then Cplex Solver calculates the feasible tour within Global-Cluster. The HCA is compared with a Nearest Neighbour heuristic (NNH), which actually is the only available method for this problem, and with a Clustering-NNH in which Cplex solver is used to improve each secondary route obtained by NNH. Computational experiments are conducted to evaluate the performances of proposed approaches.

References

  1. Albareda-Sambola, M., Diaz, J.A., Fernandez, E., 2005., A compact model and tight bounds for a combined location-routing problem. Computers & Operations Research 32,407-428.
  2. Barreto, S., Ferreira, C., Paixao, J., Sousa Santos, B., 2007., Using clustering analysis in a capacitated location-routing problem. European Journal of Operational Research 179 (2007) 968-977.
  3. Boccia, M., Crainic, T. G., Sforza, A., Sterle, C., 2010. Experimental Algorithms. Springer.
  4. Bruns, A., Klose, A., 1995. An iterative heuristic for location- routing problems based on clustering. In: Proceedings of the Second International Workshop on Distribution Logistics, The Netherlands, pp. 1-6.
  5. Carrera, S., Portmann, M.C., Ramdane Cherif, W., 2010. Scheduling problems for logistic platforms with fixed staircase component arrivals and various deliveries hypotheses. Actes parus dans la série Lecture Notes in Management Science, Proceedings of the 2th International Conference on Applied Operational Research - ICAOR, Turku, Finlande, pages 517-528.
  6. Contardo, C., Cordeau, J. F., Gendron, B. 2013. A computational comparison of flow formulations for the capacitated location-routing problem. Original Research Article, Discrete Optimization, In Press, Corrected Proof, Available online 8 August 2013.
  7. Derbel, H., Jarboui, B., Hanafi, S., Chabchoub, H., 2012. Genetic algorithm with iterated local search for solving a location routing problem. Original Research Article, Expert Systems with Applications, Volume 39, Issue 3, Pages 2865-2871.
  8. Duhamel, C., Lacomme, P., Prins, C., Prodhon, C., 2009. A GRASP ELS approach for the capacitated locationrouting problem. Computers & Operations Research.doi:10.1016/j.cor.2009.07.004.
  9. Fazel Zarandi, M. H., Hemmati, A., Davari, S., Turksen, B., 2013. Capacitated location-routing problem with time windows. under uncertainty. Original Research Article, Knowledge-Based Systems, Volume 37, Pages 480-489.
  10. Ghaffari-Nasab, N., Ghazanfar Ahari, S., Ghazanfari, M., 2013. A hybrid simulated annealing based heuristic for solving the location-routing problem with fuzzy demands. Original Research Article Scientia Iranica, Volume 20, Issue 3, June 2013, Pages 919-930.
  11. Guerrero, W. J., Prodhon, C., 2013. Capacitated hierarchical clustering heuristic for multi depot location-routing problems.1 International Journal of Logistics Research and Applications: A Leading Journal of Supply Chain Management
  12. Hashemi Doulabi, S. H., Seifi, A., 2013. Lower and upper bounds for location-arc routing problems with vehicle capacity constraints. Original Research Article, European Journal of Operational Research, Volume 224, Issue 1, Pages 189-208.
  13. Jarboui, B., Derbel, H., Hanafi, S., Mladenovic, N., 2013. Variable neighborhood search for location routing. Original Research Article, Computers & Operations Research, Volume 40, Issue 1, Pages 47-57
  14. Labbe, M., Rodríguez-Martin, I., Salazar-González, J. J., 2004. A branch-and-cut algorithm for the plant-cycle location problem. Journal of the Operational Research Society 55 (5), 513-520.
  15. Laporte, G., Nobert, Y., 1988. Solving a family of multidepot vehicle routing and location-routing problems. Transportation Science 22 (3), 161-172.
  16. Melechovsky, J., Prins, C., 2005. A metaheuristic to solve a location routing problem with non-linear costs. Journal of Heuristics 11, 375-391.
  17. Min, H., Jayaraman, V., Srivastava, R, 1998. Combined location-routing problems: A synthesis and future research directions. European Journal of Operational Research 108(1), 1-15.
  18. Mousavi, M., Tavakkoli-Moghadam, R., 2013. A hybrid simulated annealing algorithm for location and routing scheduling problems with cross-docking in the supply chain. Original Research Article, Journal of Manufacturing Systems, Volume 32, Issue 2, Pages 335-347.
  19. Nagy, G., Salhi, S., 2007. Location-routing: Issues, models and methods. European Journal of Operational Research 177 (2), 649-672.
  20. Nguyen, V.-P., Prins, C., Prodhon, C., 2012. Solving the Two-Echelon Location Routing Problem by a hybrid GRASPxPath Relinking complemented by a learning process. European Journal of Operational Research, 216, pp. 113-126.
  21. Özdamar, L., Demir, O., 2012. A hierarchical clustering and routing procedure for large scale disaster relief logistics planning. Original Research Article. Transportation Research Part E: Logistics and Transportation Review, Volume 48, Issue 3,Pages 591-602.
  22. Prins, C., Prodhon, C., Wolfler Calvo, R., 2006a. Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking. 4OR 4,221-238.
  23. Prins, C., Prodhon, C., Wolfler-Calvo, R., 2006b. A memetic algorithm with population management for the capacitated location-routing problem. EvoCOP2006, 183-194.
  24. Rahmani, Y., Oulamara, A., Ramdane Cherif, W., 2013a. MultiProducts LocationRouting problem with Pickp and Delivery: Two-Echelon model. 11th IFAC Workshop on Intelligent Manufacturing (IMS 2013), pages 22-24 May, São Paulo, Brazil, pages 124-129, 2013.ISBN: 978-3-902823-33-5.
  25. Rahmani, Y., Oulamara, A., Ramdane Cherif, W., 2013b. Multi-products Location-Routing problem with Pickup and Delivery, ICALT IEEE, 29-31 May, Sousse, Tunisie, pages 115,122.
  26. Rui Borges Lopesa, b., Carlos Ferreiraa, b., Beatriz Sousa Santos and Sergio Barreto, 2013. A taxonomical analysis, current methods and objectives on locationrouting problems.
  27. Saraiva de Camargo, R., Miranda, G., Løkketangen, A., 2013. A new formulation and an exact approach for the many-to-many hub location-routing problem. Original Research Article, Applied Mathematical Modelling, Volume 37, Issues 12-13, 1 July 2013, Pages 7465-7480.
  28. Schwengerer, M., Pirkwieser, S., and Raidl. G. R.,2012. A variable neighborhood search approach for the twoechelon location-routing problem. In J.-K. Hao and M. Middendorf, editors, Evolutionary Computation in Combinatorial Optimisation - EvoCOP 2012, volume 7245 of LNCS, pages 13-24. Springer, Heidelberg.
  29. Ting, C. J., Chen, C. H., 2013. A multiple ant colony optimization algorithm for the capacitated location routing problem, Original Research Article. International Journal of Production Economics, Volume 141, Issue 1, Pages 34-44.
  30. Wu, T. H., Low, C., Bai, J. W., 2002. Heuristic solutions to multi-depot location-routing problems. Computers & Operations Research 29 (10), 1393-1415.
  31. Yu, V. F., Lin, S. W., Lee, W., Ting, C. J., 2010. A Simulated Annealing Heuristic for the Capacitated Location Routing Problme. Computers and Industrial Engineering 58 (2), 288-299.
  32. Zare Mehrjerdi, Y., Nadizadeh, A., 2013. Using greedy clustering method to solve capacitated location-routing problem with fuzzy demands. European Journal of Operational Research.
Download


Paper Citation


in Harvard Style

Rahmani Y., Oulamara A. and Ramdane Cherif W. (2014). Using Clustering Method to Solve Two Echelon Multi-Products Location-Routing Problem with Pickup and Delivery . In Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-017-8, pages 425-433. DOI: 10.5220/0004832804250433


in Bibtex Style

@conference{icores14,
author={Younes Rahmani and Ammar Oulamara and Wahiba Ramdane Cherif},
title={Using Clustering Method to Solve Two Echelon Multi-Products Location-Routing Problem with Pickup and Delivery},
booktitle={Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2014},
pages={425-433},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004832804250433},
isbn={978-989-758-017-8},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - Using Clustering Method to Solve Two Echelon Multi-Products Location-Routing Problem with Pickup and Delivery
SN - 978-989-758-017-8
AU - Rahmani Y.
AU - Oulamara A.
AU - Ramdane Cherif W.
PY - 2014
SP - 425
EP - 433
DO - 10.5220/0004832804250433