Skip to main content
SpringerLink
Log in

A memetic algorithm for a multi-objective obnoxious waste location-routing problem: a case study

  • S.I.: Sustainable supply chain design and MGT.
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

This paper proposes a model for obnoxious waste location-routing problem (LRP) considering various types of wastes and several treatment technologies. The investigated distribution network includes three echelons of generation nodes, treatment and disposal facilities. A multi-objective LRP model is developed with three objective functions minimizing the treatment and disposal facility undesirability, different costs related to the problem, and eventually the risk associated with transportation of untreated materials. An effective memetic algorithm is developed in which a tabu search algorithm performs the local search. Comparison of exact and meta-heuristic methods run times confirms that the proposed method is effective. Eventually, the developed algorithm is tested on a real-life case study.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  • Akca, Z., Berger, R., & Ralphs, T. (2008). Modelling and solving location routing and scheduling problems. In Proceedings of the eleventh INFORMS computing society meeting (pp. 309–330).

  • Akca, Z., Berger, R. T., & Ralphs, T. K. (2009). A branch-and-price algorithm for combined location and routing problems under capacity restrictions. In Operations research and cyber-infrastructure (pp. 309–330). Springer US.

  • Aksen, D., & Altinkemer, K. (2008). A location-routing problem for the conversion to the click-and-mortar retailing: The static case. European Journal of Operational Research, 186(2), 554–575.

    Article  Google Scholar 

  • Alumur, S., & Kara, B. Y. (2007). A new model for the hazardous waste location-routing problem. Computers and Operations Research, 34(5), 1406–1423.

    Article  Google Scholar 

  • Ambrosino, D., & Scutella, M. G. (2005). Distribution network design: New problems and related models. European Journal of Operational Research, 165(3), 610–624.

    Article  Google Scholar 

  • Androutsopoulos, K. N., & Zografos, K. G. (2010). Solving the bicriterion routing and scheduling problem for hazardous materials distribution. Transportation Research Part C: Emerging Technologies, 18(5), 713–726.

    Article  Google Scholar 

  • Androutsopoulos, K. N., & Zografos, K. G. (2012). A bi-objective time-dependent vehicle routing and scheduling problem for hazardous materials distribution. EURO Journal on Transportation and Logistics, 1(1–2), 157–183.

    Article  Google Scholar 

  • Assadipour, G., Ke, G. Y., & Verma, M. (2015). Planning and managing intermodal transportation of hazardous materials with capacity selection and congestion. Transportation Research Part E, 76, 45–57.

    Article  Google Scholar 

  • Balakrishnan, A., Ward, J. E., & Wong, R. T. (1987). Integrated facility location and vehicle routing models: Recent work and future prospects. American Journal of Mathematical Sciences, 7(1–2), 35–61.

    Article  Google Scholar 

  • Baldacci, R., Mingozzi, A., & Calvo, R. W. (2011). An exact method for the capacitated location-routing problem. Operations Research, 59(5), 1284–1296.

    Article  Google Scholar 

  • Barreto, S., Ferreira, C., Paixao, J., & Santos, B. S. (2007). Using clustering analysis in a capacitated location-routing problem. European Journal of Operational Research, 179(3), 968–977.

    Article  Google Scholar 

  • Belenguer, J. M., Benavent, E., Prins, C., Prodhon, C., & Calvo, R. W. (2011). A branch-and-cut method for the capacitated location-routing problem. Computers and Operations Research, 38(6), 931–941.

    Article  Google Scholar 

  • Bronfman, A., Marianov, V., Paredes-Belmar, G., & Lüer-Villagra, A. (2015). The maximin HAZMAT routing problem. European Journal of Operational Research, 241(1), 15–27.

    Article  Google Scholar 

  • Boudia, M., & Prins, C. (2009). A memetic algorithm with dynamic population management for an integrated production-distribution problem. European Journal of Operational Research, 195(3), 703–715.

    Article  Google Scholar 

  • Bouhafs, L., Hajjam, A., & Koukam, A. (2006). A combination of simulated annealing and ant colony system for the capacitated location-routing problem. In Knowledge-Based Intelligent Information and Engineering Systems (pp. 409–416). Berlin: Springer.

  • Bouhafs, L., Hajjam, A., & Koukam, A. (2008). A Tabu search and ant colony system approach for the capacitated location-routing problem. In Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing. SNPD’08. Ninth ACIS International Conference on (pp. 46–50). IEEE.

  • Boyer, O., Hong, T. S., Pedram, A., Yusuff, R. B. M., & Zulkifli, N. (2013). A mathematical model for the industrial hazardous waste location-routing problem. Journal of Applied Mathematics, 2013, 1–10.

    Article  Google Scholar 

  • Berglund, P. G., & Kwon, C. (2014). Robust facility location problem for hazardous waste transportation. Networks and Spatial Economics, 14(1), 91–116.

    Article  Google Scholar 

  • Caballero, R., Gonzalez, M., Guerrero, F. M., Molina, J., & Paralera, C. (2007). Solving a multiobjective location routing problem with a metaheuristic based on tabu search: Application to a real case in Andalusia. European Journal of Operational Research, 177(3), 1751–1763.

    Article  Google Scholar 

  • Cappanera, P., Gallo, G., & Maffioli, F. (2003). Discrete facility location and routing of obnoxious activities. Discrete Applied Mathematics, 133(1–3), 3–28.

    Article  Google Scholar 

  • Carotenuto, P., Giordani, S., & Ricciardelli, S. (2007). Finding minimum and equitable risk routes for hazmat shipments. Computers & Operations Research, 34(5), 1304–1327.

    Article  Google Scholar 

  • Chan, Y., & Baker, S. F. (2005). The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency and heuristic implementations. Mathematical and Computer Modelling, 41(8–9), 1035–1053.

    Article  Google Scholar 

  • Chan, Y., Carter, W. B., & Burnes, M. D. (2001). A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands. Computers and Operations Research, 28(8), 803–826.

    Article  Google Scholar 

  • Contardo, C., Cordeau, J. F., & Gendron, B. (2013). An exact algorithm based on cut-and-column generation for the capacitated location-routing problem. INFORMS Journal on Computing, 26(1), 88–102.

    Article  Google Scholar 

  • Current, J., & Ratick, S. (1995). A model to assess risk, equity and efficiency in facility location and transportation of hazardous materials. Location Science, 3(3), 187–201.

    Article  Google Scholar 

  • Dalfard, V. M., Kaveh, M., & Nosratian, N. E. (2013). Two meta-heuristic algorithms for two-echelon location-routing problem with vehicle fleet capacity and maximum route length constraints. Neural Computing and Applications, 23(7–8), 2341–2349.

    Article  Google Scholar 

  • Derbel, H., Jarboui, B., Hanafi, S., & Chabchoub, H. (2012). Genetic algorithm with iterated local search for solving a location-routing problem. Expert Systems with Applications, 39(3), 2865–2871.

    Article  Google Scholar 

  • Derigs, U., Li, B., & Vogel, U. (2010). Local search-based metaheuristics for the split delivery vehicle routing problem. The Journal of the Operational Research Society, 61(9), 1356–1364.

    Article  Google Scholar 

  • Doerner, K., Focke, A., & Gutjahr, W. J. (2007). Multicriteria tour planning for mobile healthcare facilities in a developing country. European Journal of Operational Research, 179(3), 1078–1096.

    Article  Google Scholar 

  • Duhamel, C., Lacomme, P., Prins, C., & Prodhon, C. (2010). A GRASP \(\times \) ELS approach for the capacitated location-routing problem. Computers and Operations Research, 37(11), 1912–1923.

    Article  Google Scholar 

  • Erkut, E., Tjandra, S. A., & Verter, V. (2007). Hazardous materials transportation. Handbooks in operations research and management science, 14, 539–621.

    Article  Google Scholar 

  • Escobar, J. W., Linfati, R., & Toth, P. (2013). A two-phase hybrid heuristic algorithm for the capacitated location-routing problem. Computers and Operations Research, 40(1), 70–79.

    Article  Google Scholar 

  • Ghiani, G., Laporte, G., & Musmanno, R. (2004). Introduction to logistics systems planning and control. West Sussex: Wiley.

    Google Scholar 

  • Giannikos, I. (1998). A multi-objective programming model for locating treatment sites and routing hazardous wastes. European Journal of Operational Research, 104(2), 333–342.

    Article  Google Scholar 

  • Jacobs, T. L., & Warmerdam, J. M. (1994). Simultaneous routing and siting for hazardous-waste operations. Journal of Urban Planning and Development, 120(3), 115–131.

    Article  Google Scholar 

  • Karaoglan, I., Altiparmak, F., Kara, I., & Dengiz, B. (2012). The location-routing problem with simultaneous pickup and delivery: Formulations and a heuristic approach. Omega, 40(4), 465–477.

    Article  Google Scholar 

  • Lee, Y., Kim, S. I., Lee, S., & Kang, K. (2003). A location-routing problem in designing optical internet access with WDM systems. Photonic Network Communications, 6(2), 151–160.

    Article  Google Scholar 

  • Li, L., Wang, S., Lin, Y., Liu, W., & Chi, T. (2015). A covering model application on Chinese industrial hazardous waste management based on integer program method. Ecological Indicators, 51, 237–243.

    Article  Google Scholar 

  • Li, R., & Leung, Y. (2011). Multi-objective route planning for dangerous goods using compromise programming. Journal of Geographical Systems, 13(3), 249–271.

    Article  Google Scholar 

  • Lin, C. K., Chow, C. K., & Chen, A. (2002). A location-routing-loading problem for bill delivery services. Computers & Industrial Engineering, 43(1), 5–25.

    Article  Google Scholar 

  • Lin, C. K., & Kwok, R. C. (2006). Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data. European Journal of Operational Research, 175(3), 1833–1849.

    Article  Google Scholar 

  • List, G., Mirchandani, P., Turnquist, M. A., & Zografos, K. G. (1991). An integrated network/planar multiobjective model for routing and siting for hazardous materials and wastes. Transportation Science, 25(2), 146–156.

    Article  Google Scholar 

  • Liu, S. C., & Lee, S. B. (2003). A two-phase heuristic method for the multi-depot location routing problem taking inventory control decisions into consideration. The International Journal of Advanced Manufacturing Technology, 22(11–12), 941–950.

    Article  Google Scholar 

  • Liu, S. C., & Lin, C. C. (2005). A heuristic method for the combined location routing and inventory problem. The International Journal of Advanced Manufacturing Technology, 26(4), 372–381.

    Article  Google Scholar 

  • Lopes, R. B., Barreto, S., Ferreira, C., & Santos, B. S. (2008). A decision-support tool for a capacitated location-routing problem. Decision Support Systems, 46(1), 366–375.

    Article  Google Scholar 

  • Marinakis, Y., & Marinaki, M. (2008). A particle swarm optimization algorithm with path relinking for the location routing problem. Journal of Mathematical Modelling and Algorithms, 7(1), 59–78.

    Article  Google Scholar 

  • McKinnon, A., Cullinane, S., Browne, M., & Whiteing, A. (2010). Green Logistics: Improving the environmental sustainability of Logistics. Location: Kogan Page.

    Google Scholar 

  • Melechovský, J., Prins, C., & Calvo, R. W. (2005). A metaheuristic to solve a location-routing problem with non-linear costs. Journal of Heuristics, 11(5–6), 375–391.

    Article  Google Scholar 

  • Mendoza, J. E., Castanier, B., Guéret, C., Medaglia, A. L., & Velasco, N. (2011). Constructive heuristics for the multicompartment vehicle routing problem with stochastic demands. Transportation Science, 45(3), 346–363.

    Article  Google Scholar 

  • Meng, Q., Lee, D. H., & Cheu, R. L. (2005). Multiobjective vehicle routing and scheduling problem with time window constraints in hazardous material transportation. ASCE Journal of Transportation Engineering, 131(9), 699–707.

    Article  Google Scholar 

  • Moccia, L., Cordeau, J. F., & Laporte, G. (2012). An incremental tabu search heuristic for the generalized vehicle routing problem with time windows. The Journal of the Operational Research Society, 63(2), 232–244.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • Moghaddam, R. T., Safaei, N., & Sassani, F. (2009). A memetic algorithm for the flexible flow line scheduling problem with processor blocking. Computers and Operations Research, 36(2), 402–414.

    Article  Google Scholar 

  • Murty, K. G., & Djang, P. A. (1999). The US Army national guard’s mobile training simulators location and routing problem. Operations Research, 47(2), 175–182.

    Article  Google Scholar 

  • Nagy, G., & Salhi, S. (1996). Nested heuristic methods for the location-routing problem. Journal of the Operational Research Society, 74(9), 1166–1174.

    Article  Google Scholar 

  • Nagy, G., & Salhi, S. (2007). Location-routing: Issues, models and methods. European Journal of Operational Research, 177(2), 649–672.

    Article  Google Scholar 

  • Nema, A. K., & Gupta, S. K. (1999). Optimization of regional hazardous waste management systems: An improved formulation. Waste Management, 19(7–8), 441–451.

    Article  Google Scholar 

  • Nema, A. K., & Gupta, S. K. (2003). Multiobjective risk analysis and optimization of regional hazardous waste management system. Practice Periodical of Hazardous, Toxic, and Radioactive Waste Management, 7(2), 69–77.

    Article  Google Scholar 

  • Nguyen, V. P., Prins, C., & Prodhon, C. (2012a). Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking. European Journal of Operational Research, 216(1), 113–126.

    Article  Google Scholar 

  • Nguyen, V. P., Prins, C., & Prodhon, C. (2012b). A multi-start iterated local search with tabu list and path relinking for the two-echelon location-routing problem. Engineering Applications of Artificial Intelligence, 25(1), 56–71.

    Article  Google Scholar 

  • Özyurt, Z., & Aksen, D. (2007). Solving the multi-depot location-routing problem with lagrangian relaxation. In Extending the horizons: Advances in computing, optimization, and decision technologies (pp. 125–144). Springer US.

  • Pishvaee, M., Farahani, R. Z., & Dullaert, W. (2009). A memetic algorithm for bi-objective integrated forward/reverse logistics network design. Journal of Computer and Operation Research, 37(1), 1100–1112.

    Google Scholar 

  • Pradhananga, R., Taniguchi, E., & Yamada, T. (2010). Ant colony system based routing and scheduling for hazardous material transportation. Procedia - Social and Behavioral Sciences, 2(3), 6097–6108.

    Article  Google Scholar 

  • Prins, C., Prodhon, C., & Calvo, R. W. (2006). A Memetic algorithm with population management (MA| PM) for the capacitated location-routing problem. Lecture notes in computer science, 3906, 183–194.

    Article  Google Scholar 

  • Prins, C., Prodhon, C., Ruiz, A., Soriano, P., & Calvo, R. W. (2007). Solving the capacitated location-routing problem by a cooperative Lagrangean relaxation-granular tabu search heuristic. Transportation Science, 41(4), 470–483.

    Article  Google Scholar 

  • Prodhon, C. (2008). http://losi.utt.fr/fr/membres/prodhonc.html

  • Prodhon, C., & Prins, C. (2008). A memetic algorithm with population management (MA| PM) for the periodic location-routing problem. In Hybrid Metaheuristics (pp. 43–57). Berlin: Springer.

  • Revelle, C., Cohon, J., & Shobrys, D. (1991). Simultaneous siting and routing in the disposal of hazardous wastes. Transportation Science, 25(2), 138–145.

    Article  Google Scholar 

  • Rieck, J., & Zimmermann, J. (2010). A new mixed integer linear model for a rich vehicle routing problem with docking constraints. Annals of Operations Research, 181(1), 337–358.

    Article  Google Scholar 

  • Samanlioglu, F. (2013). A multi-objective mathematical model for the industrial hazardous waste location-routing problem. European Journal of Operational Research, 226(2), 332–340.

    Article  Google Scholar 

  • Sambola, M. A., Diaz, J. A., & Fernandez, E. (2005). A compact model and tight bounds for a combined location-routing problem. Computers and Operations Research, 32(3), 407–428.

    Article  Google Scholar 

  • Sambola, M. A., Fernandez, E., & Laporte, G. (2007). Heuristic and lower bound for a stochastic location-routing problem. European Journal of Operational Research, 179(3), 940–955.

    Article  Google Scholar 

  • Schittekat, P., & Sörensen, K. (2009). Supporting 3PL decisions in the automotive industry by generating diverse solutions to a large-scale location-routing problem. Operations research, 57(5), 1058–1067.

    Article  Google Scholar 

  • Schwardt, M., & Fischer, K. (2009). Combined location-routing problems—a neural network approach. Annals of Operations Research, 167(1), 253–269.

    Article  Google Scholar 

  • Shen, Z., Hassani, A., & Shi, Q. (2016). Multi-objective time-cost optimization using Cobb-Douglas production function and hybrid genetic algorithm. Journal of Civil Engineering and Management, 22(2), 187–198.

    Article  Google Scholar 

  • Stowers, C. L., & Palekar, U. S. (1993). Location models with routing considerations for a single obnoxious facility. Transportation Science, 27(4), 350–362.

    Article  Google Scholar 

  • Ting, C. J., & Chen, C. H. (2013). A multiple ant colony optimization algorithm for the capacitated location routing problem. International Journal of Production Economics, 141(1), 34–44.

    Article  Google Scholar 

  • Tuzun, D., & Burke, L. I. (1999). A two-phase tabu search approach to the location routing problem. European Journal of Operational Research, 116(1), 87–99.

    Article  Google Scholar 

  • Wasner, M., & Zapfel, G. (2004). An integrated multi-depot hub-location vehicle routing model for network planning of parcel service. International Journal of Production Economics, 90(3), 403–419.

    Article  Google Scholar 

  • Wu, T. H., Low, C., & Bai, J. W. (2002). Heuristic solutions to multi-depot location-routing problems. Computers and Operations Research, 29(10), 1393–1415.

    Article  Google Scholar 

  • Wyman, M. M., & Kuby, M. (1995). Proactive optimization of toxic waste transportation, location and technology. Loculion Science, 3(3), 167–185.

    Google Scholar 

  • Xie, Y., Lu, W., Wang, W., & Quadrifoglio, L. (2012). A multimodal location and routing model for hazardous materials transportation. Journal of Hazardous Materials, 227–228, 135–141.

    Article  Google Scholar 

  • Yu, V. F., Lin, S. W., Lee, W., & Ting, C. J. (2010). A simulated annealing heuristic for the capacitated location routing problem. Computers and Industrial Engineering, 58(2), 288–299.

    Article  Google Scholar 

  • Zhang, M., Ma, Y., & Weng, K. (2005). Location-routing model of hazardous materials distribution system based on risk bottleneck. Proceedings of International Conference on Services Systems and Services Management (ICSSSM), 1, 362–368.

    Google Scholar 

  • Zhao, J., & Verter, V. (2015). A bi-objective model for the used oil location-routing problem. Computer & Operation Research, 62, 157–168.

    Article  Google Scholar 

  • Zografos, K. G., & Samara, S. (1989). Combined location-routing model for hazardous waste transportation and disposal. Transportation Research Record, 1245, 52–59.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Roehampton Business School, University of Roehampton, London, UK

    Nasrin Asgari

  2. Department of Industrial Management, Faculty of Management, Tehran University, Tehran, Iran

    Mohsen Rajabi

  3. Department of Industrial Engineering, Amirkabir University of Technology, Tehran, Iran

    Masoumeh Jamshidi

  4. Department of Industrial and Systems Engineering, Texas A&M University, College Station, TX, USA

    Maryam Khatami

  5. Department of Management, Kingston Business School, Kingston University, Surrey, UK

    Reza Zanjirani Farahani

Authors
  1. Nasrin Asgari
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mohsen Rajabi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Masoumeh Jamshidi
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Maryam Khatami
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Reza Zanjirani Farahani
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Reza Zanjirani Farahani.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Asgari, N., Rajabi, M., Jamshidi, M. et al. A memetic algorithm for a multi-objective obnoxious waste location-routing problem: a case study. Ann Oper Res 250, 279–308 (2017). https://doi.org/10.1007/s10479-016-2248-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-016-2248-7

Keywords

Search

Navigation