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

被引：42

作者：

Asgari, Nasrin ^{[1
]}

Rajabi, Mohsen ^{[2
]}

Jamshidi, Masoumeh ^{[3
]}

Khatami, Maryam ^{[4
]}

Farahani, Reza Zanjirani ^{[5
]}

机构：

[1] Univ Roehampton, Roehampton Business Sch, London, England

[2] Univ Tehran, Fac Management, Dept Ind Management, Tehran, Iran

[3] Amirkabir Univ Technol, Dept Ind Engn, Tehran, Iran

[4] Texas A&M Univ, Dept Ind & Syst Engn, College Stn, TX USA

[5] Kingston Univ, Kingston Business Sch, Dept Management, Surrey, England

来源：

ANNALS OF OPERATIONS RESEARCH | 2017年 / 250卷 / 02期

关键词：

Obnoxious materials; Location-routing problem (LRP); Memetic algorithm; Multi-criteria decision making (MCDM); HAZARDOUS MATERIALS TRANSPORTATION; TABU SEARCH; FACILITY-LOCATION; POPULATION MANAGEMENT; GENETIC ALGORITHM; HEURISTIC METHOD; MULTIPLE-DEPOT; MODEL; VEHICLE; OPTIMIZATION;

D O I：

10.1007/s10479-016-2248-7

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

This paper proposes amodel 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 andmeta-heuristic methods run times confirms that the proposed method is effective. Eventually, the developed algorithm is tested on a real-life case study.

引用

页码：279 / 308

页数：30

共 50 条

[31] A multi-objective two-echelon location-routing problem for cash logistics: A metaheuristic approach
Fallahtafti, Alireza
Ardjmand, Ehsan
Young Ii, William A.
Weckman, Gary R.
[J]. APPLIED SOFT COMPUTING, 2021, 111
[32] A new integrated mathematical model for a bi-objective multi-depot location-routing problem solved by a multi-objective scatter search algorithm
Tavakkoli-Moghaddam, R.
Makui, A.
Mazloomi, Z.
[J]. JOURNAL OF MANUFACTURING SYSTEMS, 2010, 29 (2-3) : 111 - 119
[33] Parallel Multi-objective Memetic Algorithm for Competitive Facility Location
Lancinskas, Algirdas
Zilinskas, Julius
[J]. PARALLEL PROCESSING AND APPLIED MATHEMATICS (PPAM 2013), PT II, 2014, 8385 : 354 - 363
[34] A Decomposition based Memetic Multi-objective Algorithm for Continuous Multi-objective Optimization Problem
Wang, Na
Wang, Hongfeng
Fu, Yaping
Wang, Lingwei
[J]. 2015 27TH CHINESE CONTROL AND DECISION CONFERENCE (CCDC), 2015, : 896 - 900
[35] A multi-objective mathematical programming model for location-routing of COVID-19 healthcare waste in Tunisia
Frikha, Hela
Daami, Fedia
[J]. ANNALS OF OPERATIONS RESEARCH, 2024,
[36] A bi-level model and memetic algorithm for arc interdiction location-routing problem
Nadizadeh, Ali
Sabzevari Zadeh, Ali
[J]. COMPUTATIONAL & APPLIED MATHEMATICS, 2021, 40 (03):
[37] A bi-level model and memetic algorithm for arc interdiction location-routing problem
Ali Nadizadeh
Ali Sabzevari Zadeh
[J]. Computational and Applied Mathematics, 2021, 40
[38] Genetic algorithm for location-routing problem
Li, Qing
Zhang, Fenghai
Yang, Guangzhi
Xue, Jun
[J]. WCICA 2006: SIXTH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-12, CONFERENCE PROCEEDINGS, 2006, : 7093 - 7097
[39] An Improved Decomposition-Based Memetic Algorithm for Multi-Objective Capacitated Arc Routing Problem
Shang, Ronghua
Wang, Jia
Jiao, Licheng
Wang, Yuying
[J]. APPLIED SOFT COMPUTING, 2014, 19 : 343 - 361
[40] Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data
Lin, C. K. Y.
Kwok, R. C. W.
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 175 (03) : 1833 - 1849

← 1 2 3 4 5 →