Skip to main content

Advertisement

Log in

A New Bi-objective Location-routing Problem for Distribution of Perishable Products: Evolutionary Computation Approach

  • Published:
Journal of Mathematical Modelling and Algorithms in Operations Research

Abstract

Supply, manufacture, and distribution of perishable products are challenging jobs in supply chains. Location of warehouses and routing of vehicles are essential issues to distribute perishable products properly. In this paper, a new bi-objective mixed integer mathematical programming is proposed to reduce the total cost of the supply chain and to balance the workload of distribution centers while the due dates of delivery of perishable product are met, concurrently. The considered properties and constraints of proposed model made it well-posed to illustrate the real life situation. As the proposed model is NP-Hard, an evolutionary algorithm called Non-Dominated Sorting Genetic Algorithm-II (NSGA-II) is customized to solve the problem. The structure of chromosome and genetic operators are customized for the problem. The performance of proposed NSGA-II and an efficient exact Multi-objective method, called ε-constraint, is compared using accuracy and diversity metrics on several benchmark instances.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Ahmadi-Javid, A., Seddighi, A.-H.: A location-routing problem with disruption risk, Transportation Research Part E. Logist. Trans. Rev. 53, 63–82 (2013)

    Article  Google Scholar 

  2. Alumur, S., Kara, B.Y.: A new model for the hazardous waste location-routing problem. Comput. Oper. Res. 34, 1406–1423 (2007)

    Article  MATH  Google Scholar 

  3. Amiri, N., Tavakkoli-Moghaddam, R., Gholipour-Kanani, Y., Toarbi, S.A.: Modelling a Novel Multi-Objective Open-Shop Scheduling Problem and Solving by a Scatter Search Method. Int. J. Ind. Eng. Prod. Manag. 23, 149–160 (2012)

    Google Scholar 

  4. Banos, R., Ortega, J.: A hybrid meta-heuristic for multi-objective vehicle routing problems with time windows. Comput. Ind. Eng. 65, 286–296 (2013)

    Article  Google Scholar 

  5. Barreto, S., Ferreira, C., Paixão, J., Santos, B.S.: Using clustering analysis in a capacitated location-routing problem. Eur. J. Oper. Res. 179, 968–977 (2007)

    Article  MATH  Google Scholar 

  6. Belenguer, J.-M., Benavent, E., Prins, Ch., Prodhon, C., Calvo, R.W.: A branch-and-cut method for the capacitated location-routing problem. Comput. Oper. Res. 38, 931–941 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  7. Bramel, J., Simchi-Levi, D.: The logic of logistics: Theory, Algorithms, and Applications for Logistics Management. Springer (1997)

  8. Branke, J., Deb, K., Miettinen, K., Slowinski, R.: Multi objective Optimization: Interactive and Evolutionary Approaches, Theoretical computer science. Springer (2008)

  9. Christofides, N., Elion, S.: Algorithm for the vehicle-dispatching problem. Oper. Res. Q. 3, 309–318 (1969)

    Article  Google Scholar 

  10. Clarke, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12, 568–589 (1964)

    Article  Google Scholar 

  11. Dantzig, G., Ramser, J.H.: The truck dispatching problem. Manag. Sci. 6, 80–91 (1959)

    Article  MathSciNet  MATH  Google Scholar 

  12. Deb, K., Paratap, A., Sammeer, A., Meyarivan, T.: A fast elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6, 182–197 (2002)

    Article  Google Scholar 

  13. Drexl, M., Schneider, M.: A survey of variants and extensions of the location-routing problem. Eur. J. Oper. Res. 241, 283–308 (2015)

    Article  MathSciNet  Google Scholar 

  14. Fisher, M.: Vehicle routing, Handbooks in OR and MS, M.O. Ball et al., Vol. 8 (1995)

  15. Govindan, K., Jafarian, A., Khodaverdi, R., Devika, K.: Two-echelon multiple-vehicle location–routing problem with time windows for optimization of sustainable supply chain network of perishable food. Int. J. Prod. Econ. 152, 9–28 (2014)

    Article  Google Scholar 

  16. Janssens, J., Van den Bergh, J., Sörensen, K., Cattrysse, D.: Multi-objective microzone-based vehicle routing for courier companies: From tactical to operational planning. Eur. J. Oper. Res. 242, 222–231 (2015)

    Article  Google Scholar 

  17. Karaoglan, I., Altiparmak, F.: A memetic algorithm for the capacitated location-routing problem with mixed backhauls. Comput. Oper. Res. 55, 200–216 (2015)

    Article  MathSciNet  Google Scholar 

  18. Khalili-Damghani, K., Amiri, M.: Solving binary-state multi-objective reliability redundancy allocation series-parallel problem using efficient epsilon-constraint, multi-start partial bound enumeration algorithm, and DEA. Reliab. Eng. Syst. Saf. 194, 35–44 (2009)

    Google Scholar 

  19. KhaliliDamghani, K., Abtahi, A.-R., Tavana, M.: A Decision Support System for Solving Multi-Objective Redundancy Allocation Problems, Quality and Reliability Engineering International. doi:10.1002/qre.1545 (2013a)

  20. Khalili-Damghani, K., Nojavan, M., Tavana, M.: Solving fuzzy multidimensional multiple-choice knapsack problems: the multi-start partial bound enumeration method versus the efficient epsilon-constraint method. Appl. Soft Comput. 13, 1627–1638 (2031b)

    Article  Google Scholar 

  21. Khalili-Damghani, K., Tavana, M., Abtahi, A.-R.: A new multi-objective particle swarm optimization method for solving reliability redundancy allocation problems. Reliab. Eng. Syst. Saf. 111, 58–75 (2013c)

    Article  Google Scholar 

  22. Khalili-Damghani, K, Tavana, M, Sadi-Nezhad, S.: An integrated multi-objective framework for solving multi-period project selection problems. Appl. Math. Comput. 219, 3122–3138 (2012)

    Article  MathSciNet  Google Scholar 

  23. Lin, C.K.Y., Kwok, R.C.W.: Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data. Eur. J. Oper. Res. 175, 1833–1849 (2006)

    Article  MATH  Google Scholar 

  24. Lopes, Author Vitae R. B., Barreto, S., Ferreira, C., Santos, B.S.: A decision-support tool for a capacitated location-routing problem. Decis. Support. Syst. 46, 366–375 (2008)

    Article  Google Scholar 

  25. Mavrotas, G.: Effective implementation of the ε-constraint method in Multi-Objective Mathematical Programming problems. Appl. Math. Comput. 213, 455–465 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  26. Martínez-Salazar, I. A., Molina, J., Ángel-Bello, F., Gómez, T., Caballero, R.: Solving a bi-objective Transportation Location Routing Problem by metaheuristic algorithms. Eur. J. Oper. Res. 234, 25–36 (2014)

    Article  Google Scholar 

  27. Meisel, F., Kirschstein, T. Bierwirth Ch.: Integrated production and intermodal transportation planning in large scale production–distribution-networks. Trans. Res. Part E: Logist. Trans. Rev. 60, 62–78 (2013)

    Article  Google Scholar 

  28. Nagy, G., Salhi, S.: Location- routing: Issues, models and methods. Eur. J. Oper. Res. 176, 649–672 (2007)

    Article  MathSciNet  Google Scholar 

  29. Najafi, M., Eshghi, K., Dullaert, W.: A multi-objective robust optimization model for logistics planning in the earthquake response phase, Transportation Research Part E. Logist. Trans. Rev. 49, 217–249 (2013)

    Article  Google Scholar 

  30. Nekooghadirli, N., Tavakkoli-Moghaddam, R., Ghezavati, V.R., Javanmard, S.: Solving a new bi-objective location-routing-inventory problem in a distribution network by meta-heuristics. Comput. Ind. Eng. 76, 204–221 (2014)

    Article  Google Scholar 

  31. Nguyen, V.-Ph., Prins, C., Prodhon, Ch.: A multi-start iterated local search with tabu list and path relinking for the two-echelon location-routing problem. Eng. Appl. Artif. Intell. 25, 56–71 (2012)

    Article  Google Scholar 

  32. Potvin, J.Y., Gendreau, M.: An exact ε-constraint method for bi-objective combinatorial optimization problems: Application to the Traveling Salesman Problem with Profits. Eur. J. Oper. Res. 194, 39–50 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  33. Prodhon, C., Prins, Ch.: A survey of recent research on location-routing problems. Eur. J. Oper. Res. 238, 1–17 (2014)

    Article  MathSciNet  Google Scholar 

  34. Prodhon, C.: A hybrid evolutionary algorithm for the periodic location-routing problem. Eur. J. Oper. Res. 210, 204–212 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  35. Reimann, M., Stummer, M., Doerner, K., et al.: A savings based ant system for the vehicle routing problem. In: Langdon, W.B. (ed.): Proceedings of the Genetic and Evolutionary Computation Conference, San Francisco. Kaufmann M (GECCO (2002)

  36. Salhi, S., Rand, G.K: The effect of ignoring routes when locating depots. Eur. J. Oper. Res. 39, 150–156 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  37. Samanlioglu, F.: A multi-objective mathematical model for the industrial hazardous waste location-routing problem. Eur. J. Oper. Res. 226, 332–340 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  38. Tavakkoli-Moghaddam, R., Makui, A., Mazloomi, Z.: A new integrated mathematical model for a bi-objective multi-depot location-routing problem solved by a multi-objective scatter search algorithm. J. Manuf. Syst. 29, 111–119 (2010)

    Article  Google Scholar 

  39. Tavana, M., Abtahi, A.-R., Khalili-Damghani, K.: A new multi-objective multi-mode model for solving preemptive time-cost-quality trade-off project scheduling problems. Expert Syst. Appl. 41, 1830–1846 (2014)

    Article  Google Scholar 

  40. Tavana, M., Khalili-Damghani, K., Abtahi, A.-R.: A new variant of fuzzy multi-choice knapsack for project selection problem. Ann. Oper. Res. 206, 449–483 (2013)

    Article  MATH  Google Scholar 

  41. Wang, H., Du, L., Ma, S.: Multi-objective open location-routing model with split delivery for optimized relief distribution in post-earthquake. Trans. Res. Part E: Logist. Trans. Rev. 69, 160–179 (2014)

    Article  Google Scholar 

  42. Webb, M.H.J.: Cost functions in the location of depots for multiple-delivery journeys. Oper. Res. Q. 19, 311–320 (1968)

    Article  Google Scholar 

  43. Yang, J., Sun, H.: Battery swap station location-routing problem with capacitated electric vehicles. Comput. Oper. Res. 55, 217–232 (2015)

    Article  MathSciNet  Google Scholar 

  44. Yu, V.F., Lin, Sh.-W.: Multi-start simulated annealing heuristic for the location routing problem with simultaneous pickup and delivery. Appl. Soft Comput. 24, 284–290 (2014)

    Article  Google Scholar 

  45. Zhao, J., Verter V.: A bi-objective model for the used oil location-routing problem. Computers & Operations Research, In Press, Corrected Proof. doi:10.1016/j.cor.2014.10.016

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kaveh Khalili-Damghani.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Khalili-Damghani, K., Abtahi, AR. & Ghasemi, A. A New Bi-objective Location-routing Problem for Distribution of Perishable Products: Evolutionary Computation Approach. J Math Model Algor 14, 287–312 (2015). https://doi.org/10.1007/s10852-015-9274-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10852-015-9274-3

Keywords

Navigation