A hybrid of clustering and meta-heuristic algorithms to solve a p-mobile hub location–allocation problem with the depreciation cost of hub facilities

Hubs act as intermediate points for the transfer of materials in the transportation system. In this study, a novel p-mobile hub location–allocation problem is developed. Hub facilities can be transferred to other hubs for the next period. Implementation of mobile hubs can reduce the costs of opening...

Full description

Saved in:
Bibliographic Details
Published inEngineering applications of artificial intelligence Vol. 98; p. 104121
Main Authors Mokhtarzadeh, Mahdi, Tavakkoli-Moghaddam, Reza, Triki, Chefi, Rahimi, Yaser
Format Journal Article
LanguageEnglish
Published Elsevier Ltd 01.02.2021
Subjects
Online AccessGet full text
ISSN0952-1976
1873-6769
1873-6769
DOI10.1016/j.engappai.2020.104121

Cover

Abstract Hubs act as intermediate points for the transfer of materials in the transportation system. In this study, a novel p-mobile hub location–allocation problem is developed. Hub facilities can be transferred to other hubs for the next period. Implementation of mobile hubs can reduce the costs of opening and closing the hubs, particularly in an environment with rapidly changing demands. On the other hand, the movement of facilities reduces lifespan and adds relevant costs. The depreciation cost and lifespan of hub facilities must be considered and the number of movements of the hub’s facilities must be assumed to be limited. Three objective functions are considered to minimize costs, noise pollutions, and the harassment caused by the establishment of a hub for people, a new objective that locates hubs in less populated areas. A multi-objective mixed-integer non-linear programming (MINLP) model is developed. To solve the proposed model, four meta-heuristic algorithms, namely multi-objective particle swarm optimization (MOPSO), a non-dominated sorting genetic algorithm (NSGA-II), a hybrid of k-medoids as a famous clustering algorithm and NSGA-II (KNSGA-II), and a hybrid of K-medoids and MOPSO (KMOPSO) are implemented. The results indicate that KNSGA-II is superior to other algorithms. Also, a case study in Iran is implemented and the related results are analyzed. •Considering depreciation costs and life time in a multi-period location problem.•Addressing how to limit mobile facilities movements.•Developing a p-mobile hub model considering depreciation costs and hubs life time.•Proposing two meta-heuristic algorithms comparing their performances.•Using a real-case study to validate the presented model and proposed algorithms.
AbstractList Hubs act as intermediate points for the transfer of materials in the transportation system. In this study, a novel p-mobile hub location–allocation problem is developed. Hub facilities can be transferred to other hubs for the next period. Implementation of mobile hubs can reduce the costs of opening and closing the hubs, particularly in an environment with rapidly changing demands. On the other hand, the movement of facilities reduces lifespan and adds relevant costs. The depreciation cost and lifespan of hub facilities must be considered and the number of movements of the hub’s facilities must be assumed to be limited. Three objective functions are considered to minimize costs, noise pollutions, and the harassment caused by the establishment of a hub for people, a new objective that locates hubs in less populated areas. A multi-objective mixed-integer non-linear programming (MINLP) model is developed. To solve the proposed model, four meta-heuristic algorithms, namely multi-objective particle swarm optimization (MOPSO), a non-dominated sorting genetic algorithm (NSGA-II), a hybrid of k-medoids as a famous clustering algorithm and NSGA-II (KNSGA-II), and a hybrid of K-medoids and MOPSO (KMOPSO) are implemented. The results indicate that KNSGA-II is superior to other algorithms. Also, a case study in Iran is implemented and the related results are analyzed. •Considering depreciation costs and life time in a multi-period location problem.•Addressing how to limit mobile facilities movements.•Developing a p-mobile hub model considering depreciation costs and hubs life time.•Proposing two meta-heuristic algorithms comparing their performances.•Using a real-case study to validate the presented model and proposed algorithms.
ArticleNumber 104121
Author Tavakkoli-Moghaddam, Reza
Mokhtarzadeh, Mahdi
Triki, Chefi
Rahimi, Yaser
Author_xml – sequence: 1
  givenname: Mahdi
  surname: Mokhtarzadeh
  fullname: Mokhtarzadeh, Mahdi
  organization: School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran
– sequence: 2
  givenname: Reza
  surname: Tavakkoli-Moghaddam
  fullname: Tavakkoli-Moghaddam, Reza
  email: tavakoli@ut.ac.ir
  organization: School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran
– sequence: 3
  givenname: Chefi
  surname: Triki
  fullname: Triki, Chefi
  email: ctriki@hbku.edu.qa
  organization: Division of Engineering Management and Decision Sciences, College of Science and Engineering, Hamad bin Khalifa University, Doha, Qatar
– sequence: 4
  givenname: Yaser
  surname: Rahimi
  fullname: Rahimi, Yaser
  organization: School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran
BookMark eNqNkEtu1EAQhlsoSEwCV0B9AQ_98COWWBBFvKRIbGDdaleXxzVqu63unkSz4w4suB8nwcZkwyasSlWl76_Sd8kupjAhY6-l2Esh6zfHPU4HO8-W9kqodVhKJZ-xnbxudFE3dXvBdqKtVCHbpn7BLlM6CiH0dVnv2M8bPpy7SI6HnoM_pYyRpgO3k-MjZlsMeIqUMgG3_hAi5WFMPAeegr9HbvlcjKEjj3w4ddwHsJnC9Ov7D-sfGz7H0Hkc-cMC8zwgdzhHBNq2EFJej698b4E8ZcL0kj3vrU_46m-9Yt8-vP96-6m4-_Lx8-3NXQG6FrnoGuHarlVNrSWALl0PKCoFlVO6Va4ve122ZdW4DlwnSquswgqFBqygtBL1FWu23NM02_PD8rWZI402no0UZvVrjubRr1n9ms3vQtYbCTGkFLH_f_DtPyBQ_uMiR0v-afzdhuOi5Z4wmgSEE6CjRWo2LtBTEb8B7pm0qw
CitedBy_id crossref_primary_10_1108_WJE_12_2020_0658
crossref_primary_10_3934_jimo_2021179
crossref_primary_10_1002_int_22576
crossref_primary_10_1016_j_cie_2022_108734
crossref_primary_10_1007_s00500_021_05943_7
crossref_primary_10_3390_math10234539
crossref_primary_10_1002_net_22074
crossref_primary_10_3390_ijerph19159752
crossref_primary_10_1016_j_cie_2022_108839
crossref_primary_10_3390_a18010009
crossref_primary_10_3390_math9243231
crossref_primary_10_1007_s11036_022_02020_7
crossref_primary_10_1007_s00366_021_01554_w
crossref_primary_10_1109_JIOT_2023_3324963
crossref_primary_10_1007_s00500_022_07518_6
crossref_primary_10_1016_j_cie_2023_109591
crossref_primary_10_2139_ssrn_4096499
crossref_primary_10_18037_ausbd_1361998
crossref_primary_10_1016_j_cie_2024_110008
crossref_primary_10_1016_j_engappai_2023_106951
crossref_primary_10_1080_01605682_2023_2175734
crossref_primary_10_1080_17509653_2022_2089261
crossref_primary_10_1016_j_engappai_2022_104836
crossref_primary_10_1007_s10479_021_04299_3
crossref_primary_10_2139_ssrn_4134265
crossref_primary_10_3390_su14116709
crossref_primary_10_1016_j_omega_2023_102921
crossref_primary_10_3390_logistics8040130
crossref_primary_10_1016_j_asej_2024_102712
crossref_primary_10_1051_ro_2021141
crossref_primary_10_1016_j_eswa_2022_117926
crossref_primary_10_1016_j_engappai_2023_106282
crossref_primary_10_1016_j_cie_2023_109142
crossref_primary_10_3390_a17030101
Cites_doi 10.1016/0377-2217(94)90245-3
10.1007/s10845-014-0990-8
10.1016/j.engappai.2015.12.009
10.1016/j.engappai.2014.12.004
10.1016/j.apm.2015.09.064
10.1007/s11067-018-9424-z
10.1016/j.ejor.2006.11.026
10.1016/j.engappai.2009.04.005
10.1016/j.cor.2015.10.011
10.1016/S0377-2217(00)00114-4
10.1016/j.cor.2011.03.004
10.1007/s10479-010-0705-2
10.1007/s10479-015-1805-9
10.1016/j.scient.2011.09.018
10.1109/TEVC.2004.826067
10.1007/s11067-006-9013-4
10.1016/j.tre.2019.01.008
10.1142/S0219686719500355
10.1016/j.omega.2017.01.011
10.1016/j.asoc.2016.10.002
10.1016/j.asoc.2012.11.024
10.1016/j.tre.2013.12.005
10.1016/j.engappai.2019.08.019
10.1016/j.cor.2010.07.014
10.1016/j.engappai.2020.103493
10.1016/j.cor.2004.07.005
10.1016/j.engappai.2017.03.006
10.1016/j.jclepro.2017.09.029
10.1109/TMAG.2004.825430
10.1016/j.cor.2014.09.004
10.1016/S0377-2217(98)00395-6
10.1016/j.apm.2017.09.032
10.1057/palgrave.jors.2601473
10.1016/j.cie.2013.01.012
10.1162/evco.1994.2.3.221
10.1007/s00500-014-1427-1
10.1504/IJOR.2016.078469
10.1016/S0377-2217(87)80007-3
10.1016/j.apm.2013.05.063
10.1080/10556780701550026
10.1016/j.engappai.2012.01.020
10.1287/trsc.20.2.92
10.1016/0377-2217(94)90318-2
10.1016/S0377-2217(97)00201-4
10.1007/s11067-009-9126-7
10.1016/j.apm.2017.02.005
10.1016/j.engappai.2018.10.004
10.1016/j.ejor.2005.08.030
10.1016/j.swevo.2011.02.001
10.1016/j.apm.2011.10.016
10.1016/j.mcm.2012.06.017
10.1109/HICSS.2014.131
10.1016/j.ejor.2006.02.011
10.1057/palgrave.jors.2602424
10.1007/s13676-019-00141-w
10.1016/j.engappai.2018.03.004
10.1016/j.ejor.2012.03.010
ContentType Journal Article
Copyright 2020 The Authors
Copyright_xml – notice: 2020 The Authors
DBID 6I.
AAFTH
AAYXX
CITATION
ADTOC
UNPAY
DOI 10.1016/j.engappai.2020.104121
DatabaseName ScienceDirect Open Access Titles
Elsevier:ScienceDirect:Open Access
CrossRef
Unpaywall for CDI: Periodical Content
Unpaywall
DatabaseTitle CrossRef
DatabaseTitleList
Database_xml – sequence: 1
  dbid: UNPAY
  name: Unpaywall
  url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/
  sourceTypes: Open Access Repository
DeliveryMethod fulltext_linktorsrc
Discipline Applied Sciences
Computer Science
EISSN 1873-6769
ExternalDocumentID 10.1016/j.engappai.2020.104121
10_1016_j_engappai_2020_104121
S0952197620303584
GroupedDBID --K
--M
.DC
.~1
0R~
1B1
1~.
1~5
29G
4.4
457
4G.
5GY
5VS
6I.
7-5
71M
8P~
9JN
AABNK
AACTN
AAEDT
AAEDW
AAFTH
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AAXUO
AAYFN
ABBOA
ABMAC
ABXDB
ABYKQ
ACDAQ
ACGFS
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADJOM
ADMUD
ADTZH
AEBSH
AECPX
AEKER
AENEX
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHJVU
AHZHX
AIALX
AIEXJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
ASPBG
AVWKF
AXJTR
AZFZN
BJAXD
BKOJK
BLXMC
CS3
DU5
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
F5P
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
GBLVA
GBOLZ
HLZ
HVGLF
HZ~
IHE
J1W
JJJVA
KOM
LG9
LY7
M41
MO0
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
Q38
R2-
RIG
ROL
RPZ
SBC
SDF
SDG
SDP
SES
SET
SEW
SPC
SPCBC
SST
SSV
SSZ
T5K
TN5
UHS
WUQ
ZMT
~G-
AATTM
AAXKI
AAYWO
AAYXX
ABJNI
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
AEIPS
AEUPX
AFJKZ
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
CITATION
EFKBS
~HD
ADTOC
UNPAY
ID FETCH-LOGICAL-c360t-b70d9b927631cc34dfce052c5d2392df4f349457dbcdb04a2a2e5e03ce5c4a1e3
IEDL.DBID UNPAY
ISSN 0952-1976
1873-6769
IngestDate Sun Oct 26 05:15:41 EDT 2025
Thu Apr 24 23:06:33 EDT 2025
Sat Oct 25 05:42:13 EDT 2025
Fri Feb 23 02:48:10 EST 2024
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Keywords NSGA-II
Mobility infrastructure
KMOPSO
KNSGA-II
Meta-heuristic algorithms
ICA
MOPSO
MINLP
Clustering
HLP
SA
Dynamic hub location–allocation
Depreciation
POS
GA
ID
NDS
Language English
License This is an open access article under the CC BY license.
cc-by
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c360t-b70d9b927631cc34dfce052c5d2392df4f349457dbcdb04a2a2e5e03ce5c4a1e3
OpenAccessLink https://proxy.k.utb.cz/login?url=https://doi.org/10.1016/j.engappai.2020.104121
ParticipantIDs unpaywall_primary_10_1016_j_engappai_2020_104121
crossref_primary_10_1016_j_engappai_2020_104121
crossref_citationtrail_10_1016_j_engappai_2020_104121
elsevier_sciencedirect_doi_10_1016_j_engappai_2020_104121
PublicationCentury 2000
PublicationDate February 2021
2021-02-00
PublicationDateYYYYMMDD 2021-02-01
PublicationDate_xml – month: 02
  year: 2021
  text: February 2021
PublicationDecade 2020
PublicationTitle Engineering applications of artificial intelligence
PublicationYear 2021
Publisher Elsevier Ltd
Publisher_xml – name: Elsevier Ltd
References Jena, Cordeau, Gendron (b27) 2016; 67
Bashiri, Rezanezhad, Tavakkoli-Moghaddam, Hasanzadeh (b3) 2018; 54
Qin, Gao (b44) 2017; 28
Mohammadi, Jolai, Tavakkoli-Moghaddam (b35) 2013; 37
Sadeghi, Tavakkoli-Moghaddam, Babazadeh (b50) 2018; 25
Ghiani, Quaranta, Triki (b19) 2007; 22
Sohn, Park (b54) 1998; 108
Paydar, Olfati, Triki (b43) 2020
Sung, Jin (b56) 2001; 132
Musmanno, Scordino, Triki, Violi (b40) 2010; 21
Mousavi, Mirdamadi, Siadat, Dantan, Tavakkoli-Moghaddam (b39) 2015; 39
Taguchi (b59) 1986
Zhalechian, Tavakkoli-Moghaddam, Rahimi, Jolai (b69) 2017; 52
Çetiner, Sepil, Süral (b8) 2010; 181
Catanzaro, Gourdin, Labbé, Özsoy (b7) 2011; 38
Zhalechian, Tavakkoli-Moghaddam, Rahimi (b68) 2017; 62
Halim, Ismail, Das (b21) 2020
O’kelly (b42) 1987; 32
Farahani, Hekmatfar, Arabani, Nikbakhsh (b16) 2013; 64
Triki, Al-Hinai (b61) 2016; 27
Tirkolaee, Mahmoodkhani, Bourani, Tavakkoli-Moghaddam (b60) 2019; 18
Karimi, Bashiri (b30) 2011; 18
Kara, Tansel (b29) 2003; 54
Correia, Nickel, Saldanha-da Gama (b10) 2018; 74
Salehi, Tavakkoli-Moghaddam (b51) 2009; 22
Vidović, Zečević, Kilibarda, Vlajić, Bjelić, Tadić (b63) 2011; 11
Miller, Friesz, Tobin, Kwon (b33) 2007; 7
Rabbani, Mokhtarzadeh, Farrokhi-Asl (b47) 2018; 5
Zitzler, Brockhoff, Thiele (b70) 2007
Yang, Liu, Yang (b67) 2013; 13
Yang, Liu (b66) 2015; 19
Halper, Raghavan, Sahin (b22) 2015; 62
Mohammadi, Jula, Tavakkoli-Moghaddam (b36) 2019; 123
Mohammadi, Torabi, Tavakkoli-Moghaddam (b38) 2014; 62
Rabbani, Heidari, Farrokhi-Asl, Rahimi (b46) 2018; 170
Campbell (b6) 1994; 72
Wagner (b65) 2008; 59
Ebrahimi-Zade, Hosseini-Nasab, Zahmatkesh (b13) 2016; 40
Mohammadi, Tavakkoli-Moghaddam, Siadat, Rahimi (b37) 2016; 50
Atta, Sen (b2) 2020
Srinivas, Deb (b55) 1994; 2
Hörhammer, A.M., 2014. Dynamic hub location problems with single allocation and multiple capacity levels. In: The Prof. of the 47th IEEE Hawaii International Conference on System Sciences, pp. 994–1003.
Mock (b34) 2011
Ebery, Krishnamoorthy, Ernst, Boland (b12) 2000; 120
Ghaffarinasab, Kara (b18) 2019; 19
Taghipourian, Mahdavi, Mahdavi-Amiri, Makui (b58) 2012; 36
O’kelly (b41) 1986; 20
Vasconcelos, Nassi, Lopes (b62) 2011; 38
Alumur, Nickel, Saldanha-da Gama, Seçerdin (b1) 2016; 246
Kara (b28) 1999
Jamili, Shafia, Sadjadi, Tavakkoli-Moghaddam (b26) 2012; 25
Khodemani-Yazdi, Tavakkoli-Moghaddam, Bashiri, Rahimi (b31) 2019; 78
Rabbani, Heidari, Farrokhi-Asl (b45) 2018
Berman, Drezner, Wesolowsky (b5) 2007; 179
Baumgartner, Magele, Renhart (b4) 2004; 40
Ghaderi, Jabalameli (b17) 2013; 57
Hasani Goodarzi, Amiri-Aref, Amini (b23) 2020; 149
Rodriguez-Martin, Salazar-Gonzalez (b49) 2008; 184
Haghjoo, Tavakkoli-Moghaddam, Shahmoradi-Moghadam, Rahimi (b20) 2020; 90
Rahimi, Torabi, Tavakkoli-Moghaddam (b48) 2019; 86
Eiben, Smit (b14) 2011; 1
Shirvani (b52) 2020; 90
Suo, Yu, Li (b57) 2017; 44
Danach, Gelareh, Monemi (b11) 2019; 8
Eskandari-Khanghahi, Tavakkoli-Moghaddam, Taleizadeh, Amin (b15) 2018; 71
Melo, Nickel, Da Gama (b32) 2006; 33
Ishfaq, Sox (b25) 2012; 220
Wagner (b64) 2007; 178
Skorin-Kapov, Skorin-Kapov (b53) 1994; 73
Coello, Pulido, Lechuga (b9) 2004; 8
Skorin-Kapov (10.1016/j.engappai.2020.104121_b53) 1994; 73
Khodemani-Yazdi (10.1016/j.engappai.2020.104121_b31) 2019; 78
Bashiri (10.1016/j.engappai.2020.104121_b3) 2018; 54
Paydar (10.1016/j.engappai.2020.104121_b43) 2020
Zhalechian (10.1016/j.engappai.2020.104121_b69) 2017; 52
Wagner (10.1016/j.engappai.2020.104121_b64) 2007; 178
Baumgartner (10.1016/j.engappai.2020.104121_b4) 2004; 40
Ebery (10.1016/j.engappai.2020.104121_b12) 2000; 120
Sadeghi (10.1016/j.engappai.2020.104121_b50) 2018; 25
Rodriguez-Martin (10.1016/j.engappai.2020.104121_b49) 2008; 184
Srinivas (10.1016/j.engappai.2020.104121_b55) 1994; 2
Vidović (10.1016/j.engappai.2020.104121_b63) 2011; 11
Musmanno (10.1016/j.engappai.2020.104121_b40) 2010; 21
Shirvani (10.1016/j.engappai.2020.104121_b52) 2020; 90
Kara (10.1016/j.engappai.2020.104121_b29) 2003; 54
Mohammadi (10.1016/j.engappai.2020.104121_b37) 2016; 50
Sohn (10.1016/j.engappai.2020.104121_b54) 1998; 108
Campbell (10.1016/j.engappai.2020.104121_b6) 1994; 72
Taguchi (10.1016/j.engappai.2020.104121_b59) 1986
Hasani Goodarzi (10.1016/j.engappai.2020.104121_b23) 2020; 149
Melo (10.1016/j.engappai.2020.104121_b32) 2006; 33
Qin (10.1016/j.engappai.2020.104121_b44) 2017; 28
Rabbani (10.1016/j.engappai.2020.104121_b45) 2018
Rabbani (10.1016/j.engappai.2020.104121_b46) 2018; 170
Coello (10.1016/j.engappai.2020.104121_b9) 2004; 8
Ghiani (10.1016/j.engappai.2020.104121_b19) 2007; 22
Jamili (10.1016/j.engappai.2020.104121_b26) 2012; 25
Rahimi (10.1016/j.engappai.2020.104121_b48) 2019; 86
Taghipourian (10.1016/j.engappai.2020.104121_b58) 2012; 36
Vasconcelos (10.1016/j.engappai.2020.104121_b62) 2011; 38
Danach (10.1016/j.engappai.2020.104121_b11) 2019; 8
Mohammadi (10.1016/j.engappai.2020.104121_b35) 2013; 37
Eiben (10.1016/j.engappai.2020.104121_b14) 2011; 1
Sung (10.1016/j.engappai.2020.104121_b56) 2001; 132
Halper (10.1016/j.engappai.2020.104121_b22) 2015; 62
Triki (10.1016/j.engappai.2020.104121_b61) 2016; 27
Alumur (10.1016/j.engappai.2020.104121_b1) 2016; 246
Eskandari-Khanghahi (10.1016/j.engappai.2020.104121_b15) 2018; 71
Ishfaq (10.1016/j.engappai.2020.104121_b25) 2012; 220
Wagner (10.1016/j.engappai.2020.104121_b65) 2008; 59
Catanzaro (10.1016/j.engappai.2020.104121_b7) 2011; 38
Kara (10.1016/j.engappai.2020.104121_b28) 1999
Mock (10.1016/j.engappai.2020.104121_b34) 2011
Mousavi (10.1016/j.engappai.2020.104121_b39) 2015; 39
O’kelly (10.1016/j.engappai.2020.104121_b41) 1986; 20
Karimi (10.1016/j.engappai.2020.104121_b30) 2011; 18
Correia (10.1016/j.engappai.2020.104121_b10) 2018; 74
Tirkolaee (10.1016/j.engappai.2020.104121_b60) 2019; 18
Yang (10.1016/j.engappai.2020.104121_b66) 2015; 19
Yang (10.1016/j.engappai.2020.104121_b67) 2013; 13
Berman (10.1016/j.engappai.2020.104121_b5) 2007; 179
Zhalechian (10.1016/j.engappai.2020.104121_b68) 2017; 62
Çetiner (10.1016/j.engappai.2020.104121_b8) 2010; 181
10.1016/j.engappai.2020.104121_b24
Haghjoo (10.1016/j.engappai.2020.104121_b20) 2020; 90
Rabbani (10.1016/j.engappai.2020.104121_b47) 2018; 5
O’kelly (10.1016/j.engappai.2020.104121_b42) 1987; 32
Suo (10.1016/j.engappai.2020.104121_b57) 2017; 44
Ebrahimi-Zade (10.1016/j.engappai.2020.104121_b13) 2016; 40
Halim (10.1016/j.engappai.2020.104121_b21) 2020
Miller (10.1016/j.engappai.2020.104121_b33) 2007; 7
Ghaffarinasab (10.1016/j.engappai.2020.104121_b18) 2019; 19
Atta (10.1016/j.engappai.2020.104121_b2) 2020
Mohammadi (10.1016/j.engappai.2020.104121_b38) 2014; 62
Salehi (10.1016/j.engappai.2020.104121_b51) 2009; 22
Zitzler (10.1016/j.engappai.2020.104121_b70) 2007
Mohammadi (10.1016/j.engappai.2020.104121_b36) 2019; 123
Farahani (10.1016/j.engappai.2020.104121_b16) 2013; 64
Ghaderi (10.1016/j.engappai.2020.104121_b17) 2013; 57
Jena (10.1016/j.engappai.2020.104121_b27) 2016; 67
References_xml – volume: 73
  start-page: 502
  year: 1994
  end-page: 509
  ident: b53
  article-title: On tabu search for the location of interacting hub facilities
  publication-title: European J. Oper. Res.
– volume: 90
  year: 2020
  ident: b20
  article-title: Reliable blood supply chain network design with facility disruption: A real-world application
  publication-title: Eng. Appl. Artif. Intell.
– volume: 22
  start-page: 1179
  year: 2009
  end-page: 1187
  ident: b51
  article-title: Application of genetic algorithm to computer-aided process planning in preliminary and detailed planning
  publication-title: Eng. Appl. Artif. Intell.
– start-page: 1
  year: 2020
  end-page: 17
  ident: b2
  article-title: Multiple allocation p-hub location problem for content placement in VoD services: a differential evolution based approach
  publication-title: Appl. Intell.
– volume: 18
  start-page: 1571
  year: 2011
  end-page: 1578
  ident: b30
  article-title: Hub covering location problems with different coverage types
  publication-title: Sci. Iranica
– volume: 27
  start-page: 341
  year: 2016
  end-page: 355
  ident: b61
  article-title: Optimisation techniques for planning the petrol replenishment to retail stations over a multi-period horizon
  publication-title: Int. J. Oper. Res.
– volume: 50
  start-page: 1
  year: 2016
  end-page: 19
  ident: b37
  article-title: A game-based meta-heuristic for a fuzzy bi-objective reliable hub location problem
  publication-title: Eng. Appl. Artif. Intell.
– volume: 64
  start-page: 1096
  year: 2013
  end-page: 1109
  ident: b16
  article-title: Hub location problems: A review of models, classification, solution techniques, and applications
  publication-title: Comput. Ind. Eng.
– volume: 54
  start-page: 151
  year: 2018
  end-page: 169
  ident: b3
  article-title: Mathematical modeling for a p-mobile hub location problem in a dynamic environment by a genetic algorithm
  publication-title: Appl. Math. Model.
– volume: 59
  start-page: 932
  year: 2008
  end-page: 938
  ident: b65
  article-title: Model formulations for hub covering problems
  publication-title: J. Oper. Res. Soc.
– volume: 8
  start-page: 256
  year: 2004
  end-page: 279
  ident: b9
  article-title: Handling multiple objectives with particle swarm optimization
  publication-title: IEEE Trans. Evol. Comput.
– volume: 132
  start-page: 88
  year: 2001
  end-page: 105
  ident: b56
  article-title: Dual-based approach for a hub network design problem under non-restrictive policy
  publication-title: European J. Oper. Res.
– volume: 71
  start-page: 236
  year: 2018
  end-page: 250
  ident: b15
  article-title: Designing and optimizing a sustainable supply chain network for a blood platelet bank under uncertainty
  publication-title: Eng. Appl. Artif. Intell.
– volume: 20
  start-page: 92
  year: 1986
  end-page: 106
  ident: b41
  article-title: The location of interacting hub facilities
  publication-title: Transp. Sci.
– volume: 18
  start-page: 677
  year: 2019
  end-page: 694
  ident: b60
  article-title: A self-learning particle swarm optimization for robust multi-echelon capacitated location–allocation–inventory problem
  publication-title: J. Adv. Manuf. Syst.
– volume: 1
  start-page: 19
  year: 2011
  end-page: 31
  ident: b14
  article-title: Parameter tuning for configuring and analyzing evolutionary algorithms
  publication-title: Swarm Evol. Comput.
– volume: 2
  start-page: 221
  year: 1994
  end-page: 248
  ident: b55
  article-title: Multiobjective optimization using non-dominated sorting in genetic algorithms
  publication-title: Evol. Comput.
– volume: 220
  start-page: 629
  year: 2012
  end-page: 641
  ident: b25
  article-title: Design of intermodal logistics networks with hub delays
  publication-title: European J. Oper. Res.
– volume: 37
  start-page: 10053
  year: 2013
  end-page: 10073
  ident: b35
  article-title: Solving a new stochastic multi-mode p-hub covering location problem considering risk by a novel multi-objective algorithm
  publication-title: Appl. Math. Model.
– volume: 40
  start-page: 1172
  year: 2004
  end-page: 1175
  ident: b4
  article-title: Pareto Optimality and particle swarm optimization
  publication-title: IEEE Trans. Magn.
– volume: 22
  start-page: 971
  year: 2007
  end-page: 983
  ident: b19
  article-title: New policies for the dynamic traveling salesman problem
  publication-title: Optim. Methods Softw.
– volume: 123
  start-page: 90
  year: 2019
  end-page: 120
  ident: b36
  article-title: Reliable single-allocation hub location problem with disruptions
  publication-title: Transp. Res. E
– volume: 184
  start-page: 468
  year: 2008
  end-page: 479
  ident: b49
  article-title: Solving a capacitated hub location problem
  publication-title: European J. Oper. Res.
– volume: 78
  start-page: 53
  year: 2019
  end-page: 70
  ident: b31
  article-title: Solving a new bi-objective hierarchical hub location problem with an M
  publication-title: Eng. Appl. Artif. Intell.
– volume: 38
  start-page: 539
  year: 2011
  end-page: 549
  ident: b7
  article-title: A branch-and-cut algorithm for the partitioning-hub location-routing problem
  publication-title: Comput. Oper. Res.
– volume: 38
  start-page: 1656
  year: 2011
  end-page: 1666
  ident: b62
  article-title: The uncapacitated hub location problem in networks under decentralized management
  publication-title: Comput. Oper. Res.
– volume: 7
  start-page: 77
  year: 2007
  end-page: 97
  ident: b33
  article-title: Reaction function based dynamic location modeling in Stackelberg–Nash–Cournot competition
  publication-title: Netw. Spat. Econ.
– volume: 13
  start-page: 2624
  year: 2013
  end-page: 2632
  ident: b67
  article-title: Solving fuzzy p-hub center problem by genetic algorithm incorporating local search
  publication-title: Appl. Soft Comput.
– volume: 246
  start-page: 289
  year: 2016
  end-page: 312
  ident: b1
  article-title: Multi-period hub network design problems with modular capacities
  publication-title: Ann. Oper. Res.
– volume: 36
  start-page: 3257
  year: 2012
  end-page: 3270
  ident: b58
  article-title: A fuzzy programming approach for dynamic virtual hub location problem
  publication-title: Appl. Math. Model.
– volume: 108
  start-page: 118
  year: 1998
  end-page: 126
  ident: b54
  article-title: Efficient solution procedure and reduced size formulations for p-hub location problems
  publication-title: European J. Oper. Res.
– volume: 39
  start-page: 157
  year: 2015
  end-page: 167
  ident: b39
  article-title: An intuitionistic fuzzy grey model for selection problems with an application to the inspection planning in manufacturing firms
  publication-title: Eng. Appl. Artif. Intell.
– volume: 25
  year: 2018
  ident: b50
  article-title: An efficient artificial bee colony algorithm for a p-hub covering location problem with travel time reliability
  publication-title: Int. J. Ind. Eng.
– volume: 40
  start-page: 2968
  year: 2016
  end-page: 2982
  ident: b13
  article-title: Multi-period hub set covering problems with flexible radius: A modified genetic solution
  publication-title: Appl. Math. Model.
– volume: 32
  start-page: 393
  year: 1987
  end-page: 404
  ident: b42
  article-title: A quadratic integer program for the location of interacting hub facilities
  publication-title: European J. Oper. Res.
– start-page: 1
  year: 2018
  end-page: 20
  ident: b45
  article-title: A bi-objective mixed-model assembly line sequencing problem considering customer satisfaction and customer buying behaviour
  publication-title: Eng. Optim.
– volume: 62
  start-page: 1
  year: 2017
  end-page: 16
  ident: b68
  article-title: A self-adaptive evolutionary algorithm for a fuzzy multi-objective hub location problem: An integration of responsiveness and social responsibility
  publication-title: Eng. Appl. Artif. Intell.
– start-page: 1
  year: 2020
  end-page: 87
  ident: b21
  article-title: Performance assessment of the metaheuristic optimization algorithms: An exhaustive review
  publication-title: Artif. Intell. Rev.
– year: 1999
  ident: b28
  article-title: Modeling and Analysis of Issues in Hub Location Problems
– volume: 21
  start-page: 165
  year: 2010
  end-page: 181
  ident: b40
  article-title: A multistage formulation for GENCOs in a multi-auction electricity market
  publication-title: IMA J. Manag. Math.
– volume: 19
  start-page: 2337
  year: 2015
  end-page: 2353
  ident: b66
  article-title: Developing equilibrium optimization methods for hub location problems
  publication-title: Soft Comput.
– volume: 25
  start-page: 793
  year: 2012
  end-page: 800
  ident: b26
  article-title: Solving a periodic single-track train timetabling problem by an efficient hybrid algorithm
  publication-title: Eng. Appl. Artif. Intell.
– volume: 19
  start-page: 83
  year: 2019
  end-page: 108
  ident: b18
  article-title: Benders decomposition algorithms for two variants of the single allocation hub location problem
  publication-title: Netw. Spat. Econ.
– volume: 86
  start-page: 68
  year: 2019
  end-page: 82
  ident: b48
  article-title: A new robust-possibilistic reliable hub protection model with elastic demands and backup hubs under risk
  publication-title: Eng. Appl. Artif. Intell.
– volume: 178
  start-page: 391
  year: 2007
  end-page: 401
  ident: b64
  article-title: An exact solution procedure for a cluster hub location problem
  publication-title: European J. Oper. Res.
– volume: 11
  start-page: 295
  year: 2011
  end-page: 314
  ident: b63
  article-title: The p-hub model with hub-catchment areas, existing hubs, and simulation: A case study of Serbian intermodal terminals
  publication-title: Netw. Spat. Econ.
– start-page: 862
  year: 2007
  end-page: 876
  ident: b70
  article-title: The hypervolume indicator revisited: On the design of Pareto-compliant indicators via weighted integration
  publication-title: Proceedings of the International Conference on Evolutionary Multi-Criterion Optimization
– volume: 74
  start-page: 122
  year: 2018
  end-page: 134
  ident: b10
  article-title: A stochastic multi-period capacitated multiple allocation hub location problem: Formulation and inequalities
  publication-title: Omega
– volume: 28
  start-page: 705
  year: 2017
  end-page: 716
  ident: b44
  article-title: Uncapacitated p-hub location problem with fixed costs and uncertain flows
  publication-title: J. Intell. Manuf.
– volume: 5
  start-page: 234
  year: 2018
  end-page: 255
  ident: b47
  article-title: A new mathematical model for designing a municipal solid waste system considering environmentally issues
  publication-title: Int. J. Supply Oper. Manag.
– reference: Hörhammer, A.M., 2014. Dynamic hub location problems with single allocation and multiple capacity levels. In: The Prof. of the 47th IEEE Hawaii International Conference on System Sciences, pp. 994–1003.
– volume: 170
  start-page: 227
  year: 2018
  end-page: 241
  ident: b46
  article-title: Using metaheuristic algorithms to solve a multi-objective industrial hazardous waste location-routing problem considering incompatible waste types
  publication-title: J. Cleaner Prod.
– volume: 72
  start-page: 387
  year: 1994
  end-page: 405
  ident: b6
  article-title: Integer programming formulations of discrete hub location problems
  publication-title: European J. Oper. Res.
– start-page: 808
  year: 2011
  end-page: 809
  ident: b34
  article-title: Pareto Optimality
  publication-title: Encyclopedia of Global Justice
– volume: 52
  start-page: 699
  year: 2017
  end-page: 713
  ident: b69
  article-title: An interactive possibilistic programming approach for a multi-objective hub location problem: Economic and environmental design
  publication-title: Appl. Soft Comput.
– volume: 90
  year: 2020
  ident: b52
  article-title: A hybrid meta-heuristic algorithm for scientific workflow scheduling in heterogeneous distributed computing systems
  publication-title: Eng. Appl. Artif. Intell.
– volume: 120
  start-page: 614
  year: 2000
  end-page: 631
  ident: b12
  article-title: The capacitated multiple allocation hub location problem: Formulations and algorithms
  publication-title: European J. Oper. Res.
– volume: 149
  year: 2020
  ident: b23
  article-title: A new bi-objective vehicle routing-scheduling problem with cross-docking: Mathematical model and algorithms
  publication-title: Comput. Ind. Eng.
– year: 1986
  ident: b59
  article-title: Introduction to Quality Engineering: Designing Quality Into Products and Processes
– volume: 62
  start-page: 210
  year: 2015
  end-page: 223
  ident: b22
  article-title: Local search heuristics for the mobile facility location problem
  publication-title: Comput. Oper. Res.
– volume: 8
  start-page: 597
  year: 2019
  end-page: 631
  ident: b11
  article-title: The capacitated single-allocation p-hub location routing problem: A Lagrangian relaxation and a hyper-heuristic approach
  publication-title: EURO J. Transp. Logist.
– volume: 33
  start-page: 181
  year: 2006
  end-page: 208
  ident: b32
  article-title: Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning
  publication-title: Comput. Oper. Res.
– volume: 62
  start-page: 89
  year: 2014
  end-page: 115
  ident: b38
  article-title: Sustainable hub location under mixed uncertainty
  publication-title: Transp. Res. E
– volume: 181
  start-page: 109
  year: 2010
  end-page: 124
  ident: b8
  article-title: Hubbing and routing in postal delivery systems
  publication-title: Ann. Oper. Res.
– volume: 67
  start-page: 143
  year: 2016
  end-page: 154
  ident: b27
  article-title: Solving a dynamic facility location problem with partial closing and reopening
  publication-title: Comput. Oper. Res.
– year: 2020
  ident: b43
  article-title: Designing a clothing supply chain network considering pricing and demand sensitivity to discounts and advertisement
  publication-title: RAIRO Oper. Res.
– volume: 44
  start-page: 425
  year: 2017
  end-page: 445
  ident: b57
  article-title: Subset simulation for multi-objective optimization
  publication-title: Appl. Math. Model.
– volume: 57
  start-page: 382
  year: 2013
  end-page: 400
  ident: b17
  article-title: Modeling the budget-constrained dynamic uncapacitated facility location–network design problem and solving it via two efficient heuristics: a case study of health care
  publication-title: Math. Comput. Modelling
– volume: 54
  start-page: 59
  year: 2003
  end-page: 64
  ident: b29
  article-title: The single-assignment hub covering problem: Models and linearizations
  publication-title: J. Oper. Res. Soc.
– volume: 179
  start-page: 978
  year: 2007
  end-page: 989
  ident: b5
  article-title: The transfer point location problem
  publication-title: European J. Oper. Res.
– volume: 149
  year: 2020
  ident: 10.1016/j.engappai.2020.104121_b23
  article-title: A new bi-objective vehicle routing-scheduling problem with cross-docking: Mathematical model and algorithms
  publication-title: Comput. Ind. Eng.
– volume: 73
  start-page: 502
  issue: 3
  year: 1994
  ident: 10.1016/j.engappai.2020.104121_b53
  article-title: On tabu search for the location of interacting hub facilities
  publication-title: European J. Oper. Res.
  doi: 10.1016/0377-2217(94)90245-3
– volume: 28
  start-page: 705
  issue: 3
  year: 2017
  ident: 10.1016/j.engappai.2020.104121_b44
  article-title: Uncapacitated p-hub location problem with fixed costs and uncertain flows
  publication-title: J. Intell. Manuf.
  doi: 10.1007/s10845-014-0990-8
– volume: 50
  start-page: 1
  year: 2016
  ident: 10.1016/j.engappai.2020.104121_b37
  article-title: A game-based meta-heuristic for a fuzzy bi-objective reliable hub location problem
  publication-title: Eng. Appl. Artif. Intell.
  doi: 10.1016/j.engappai.2015.12.009
– volume: 39
  start-page: 157
  year: 2015
  ident: 10.1016/j.engappai.2020.104121_b39
  article-title: An intuitionistic fuzzy grey model for selection problems with an application to the inspection planning in manufacturing firms
  publication-title: Eng. Appl. Artif. Intell.
  doi: 10.1016/j.engappai.2014.12.004
– volume: 40
  start-page: 2968
  issue: 4
  year: 2016
  ident: 10.1016/j.engappai.2020.104121_b13
  article-title: Multi-period hub set covering problems with flexible radius: A modified genetic solution
  publication-title: Appl. Math. Model.
  doi: 10.1016/j.apm.2015.09.064
– volume: 19
  start-page: 83
  issue: 1
  year: 2019
  ident: 10.1016/j.engappai.2020.104121_b18
  article-title: Benders decomposition algorithms for two variants of the single allocation hub location problem
  publication-title: Netw. Spat. Econ.
  doi: 10.1007/s11067-018-9424-z
– volume: 184
  start-page: 468
  issue: 2
  year: 2008
  ident: 10.1016/j.engappai.2020.104121_b49
  article-title: Solving a capacitated hub location problem
  publication-title: European J. Oper. Res.
  doi: 10.1016/j.ejor.2006.11.026
– volume: 22
  start-page: 1179
  issue: 8
  year: 2009
  ident: 10.1016/j.engappai.2020.104121_b51
  article-title: Application of genetic algorithm to computer-aided process planning in preliminary and detailed planning
  publication-title: Eng. Appl. Artif. Intell.
  doi: 10.1016/j.engappai.2009.04.005
– volume: 67
  start-page: 143
  year: 2016
  ident: 10.1016/j.engappai.2020.104121_b27
  article-title: Solving a dynamic facility location problem with partial closing and reopening
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2015.10.011
– volume: 5
  start-page: 234
  issue: 3
  year: 2018
  ident: 10.1016/j.engappai.2020.104121_b47
  article-title: A new mathematical model for designing a municipal solid waste system considering environmentally issues
  publication-title: Int. J. Supply Oper. Manag.
– volume: 132
  start-page: 88
  issue: 1
  year: 2001
  ident: 10.1016/j.engappai.2020.104121_b56
  article-title: Dual-based approach for a hub network design problem under non-restrictive policy
  publication-title: European J. Oper. Res.
  doi: 10.1016/S0377-2217(00)00114-4
– volume: 38
  start-page: 1656
  issue: 12
  year: 2011
  ident: 10.1016/j.engappai.2020.104121_b62
  article-title: The uncapacitated hub location problem in networks under decentralized management
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2011.03.004
– volume: 181
  start-page: 109
  issue: 1
  year: 2010
  ident: 10.1016/j.engappai.2020.104121_b8
  article-title: Hubbing and routing in postal delivery systems
  publication-title: Ann. Oper. Res.
  doi: 10.1007/s10479-010-0705-2
– volume: 246
  start-page: 289
  issue: 1–2
  year: 2016
  ident: 10.1016/j.engappai.2020.104121_b1
  article-title: Multi-period hub network design problems with modular capacities
  publication-title: Ann. Oper. Res.
  doi: 10.1007/s10479-015-1805-9
– year: 1986
  ident: 10.1016/j.engappai.2020.104121_b59
– volume: 18
  start-page: 1571
  issue: 6
  year: 2011
  ident: 10.1016/j.engappai.2020.104121_b30
  article-title: Hub covering location problems with different coverage types
  publication-title: Sci. Iranica
  doi: 10.1016/j.scient.2011.09.018
– volume: 8
  start-page: 256
  issue: 3
  year: 2004
  ident: 10.1016/j.engappai.2020.104121_b9
  article-title: Handling multiple objectives with particle swarm optimization
  publication-title: IEEE Trans. Evol. Comput.
  doi: 10.1109/TEVC.2004.826067
– volume: 7
  start-page: 77
  issue: 1
  year: 2007
  ident: 10.1016/j.engappai.2020.104121_b33
  article-title: Reaction function based dynamic location modeling in Stackelberg–Nash–Cournot competition
  publication-title: Netw. Spat. Econ.
  doi: 10.1007/s11067-006-9013-4
– volume: 123
  start-page: 90
  year: 2019
  ident: 10.1016/j.engappai.2020.104121_b36
  article-title: Reliable single-allocation hub location problem with disruptions
  publication-title: Transp. Res. E
  doi: 10.1016/j.tre.2019.01.008
– volume: 18
  start-page: 677
  issue: 04
  year: 2019
  ident: 10.1016/j.engappai.2020.104121_b60
  article-title: A self-learning particle swarm optimization for robust multi-echelon capacitated location–allocation–inventory problem
  publication-title: J. Adv. Manuf. Syst.
  doi: 10.1142/S0219686719500355
– volume: 74
  start-page: 122
  year: 2018
  ident: 10.1016/j.engappai.2020.104121_b10
  article-title: A stochastic multi-period capacitated multiple allocation hub location problem: Formulation and inequalities
  publication-title: Omega
  doi: 10.1016/j.omega.2017.01.011
– volume: 52
  start-page: 699
  year: 2017
  ident: 10.1016/j.engappai.2020.104121_b69
  article-title: An interactive possibilistic programming approach for a multi-objective hub location problem: Economic and environmental design
  publication-title: Appl. Soft Comput.
  doi: 10.1016/j.asoc.2016.10.002
– volume: 21
  start-page: 165
  issue: 2
  year: 2010
  ident: 10.1016/j.engappai.2020.104121_b40
  article-title: A multistage formulation for GENCOs in a multi-auction electricity market
  publication-title: IMA J. Manag. Math.
– volume: 13
  start-page: 2624
  issue: 5
  year: 2013
  ident: 10.1016/j.engappai.2020.104121_b67
  article-title: Solving fuzzy p-hub center problem by genetic algorithm incorporating local search
  publication-title: Appl. Soft Comput.
  doi: 10.1016/j.asoc.2012.11.024
– volume: 62
  start-page: 89
  year: 2014
  ident: 10.1016/j.engappai.2020.104121_b38
  article-title: Sustainable hub location under mixed uncertainty
  publication-title: Transp. Res. E
  doi: 10.1016/j.tre.2013.12.005
– volume: 86
  start-page: 68
  year: 2019
  ident: 10.1016/j.engappai.2020.104121_b48
  article-title: A new robust-possibilistic reliable hub protection model with elastic demands and backup hubs under risk
  publication-title: Eng. Appl. Artif. Intell.
  doi: 10.1016/j.engappai.2019.08.019
– start-page: 1
  year: 2020
  ident: 10.1016/j.engappai.2020.104121_b2
  article-title: Multiple allocation p-hub location problem for content placement in VoD services: a differential evolution based approach
  publication-title: Appl. Intell.
– volume: 38
  start-page: 539
  issue: 2
  year: 2011
  ident: 10.1016/j.engappai.2020.104121_b7
  article-title: A branch-and-cut algorithm for the partitioning-hub location-routing problem
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2010.07.014
– volume: 90
  year: 2020
  ident: 10.1016/j.engappai.2020.104121_b20
  article-title: Reliable blood supply chain network design with facility disruption: A real-world application
  publication-title: Eng. Appl. Artif. Intell.
  doi: 10.1016/j.engappai.2020.103493
– volume: 33
  start-page: 181
  issue: 1
  year: 2006
  ident: 10.1016/j.engappai.2020.104121_b32
  article-title: Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2004.07.005
– volume: 62
  start-page: 1
  year: 2017
  ident: 10.1016/j.engappai.2020.104121_b68
  article-title: A self-adaptive evolutionary algorithm for a fuzzy multi-objective hub location problem: An integration of responsiveness and social responsibility
  publication-title: Eng. Appl. Artif. Intell.
  doi: 10.1016/j.engappai.2017.03.006
– volume: 170
  start-page: 227
  year: 2018
  ident: 10.1016/j.engappai.2020.104121_b46
  article-title: Using metaheuristic algorithms to solve a multi-objective industrial hazardous waste location-routing problem considering incompatible waste types
  publication-title: J. Cleaner Prod.
  doi: 10.1016/j.jclepro.2017.09.029
– volume: 40
  start-page: 1172
  issue: 2
  year: 2004
  ident: 10.1016/j.engappai.2020.104121_b4
  article-title: Pareto Optimality and particle swarm optimization
  publication-title: IEEE Trans. Magn.
  doi: 10.1109/TMAG.2004.825430
– start-page: 808
  year: 2011
  ident: 10.1016/j.engappai.2020.104121_b34
  article-title: Pareto Optimality
– volume: 62
  start-page: 210
  year: 2015
  ident: 10.1016/j.engappai.2020.104121_b22
  article-title: Local search heuristics for the mobile facility location problem
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2014.09.004
– volume: 120
  start-page: 614
  issue: 3
  year: 2000
  ident: 10.1016/j.engappai.2020.104121_b12
  article-title: The capacitated multiple allocation hub location problem: Formulations and algorithms
  publication-title: European J. Oper. Res.
  doi: 10.1016/S0377-2217(98)00395-6
– volume: 54
  start-page: 151
  year: 2018
  ident: 10.1016/j.engappai.2020.104121_b3
  article-title: Mathematical modeling for a p-mobile hub location problem in a dynamic environment by a genetic algorithm
  publication-title: Appl. Math. Model.
  doi: 10.1016/j.apm.2017.09.032
– volume: 54
  start-page: 59
  issue: 1
  year: 2003
  ident: 10.1016/j.engappai.2020.104121_b29
  article-title: The single-assignment hub covering problem: Models and linearizations
  publication-title: J. Oper. Res. Soc.
  doi: 10.1057/palgrave.jors.2601473
– volume: 64
  start-page: 1096
  issue: 4
  year: 2013
  ident: 10.1016/j.engappai.2020.104121_b16
  article-title: Hub location problems: A review of models, classification, solution techniques, and applications
  publication-title: Comput. Ind. Eng.
  doi: 10.1016/j.cie.2013.01.012
– volume: 2
  start-page: 221
  issue: 3
  year: 1994
  ident: 10.1016/j.engappai.2020.104121_b55
  article-title: Multiobjective optimization using non-dominated sorting in genetic algorithms
  publication-title: Evol. Comput.
  doi: 10.1162/evco.1994.2.3.221
– volume: 19
  start-page: 2337
  issue: 8
  year: 2015
  ident: 10.1016/j.engappai.2020.104121_b66
  article-title: Developing equilibrium optimization methods for hub location problems
  publication-title: Soft Comput.
  doi: 10.1007/s00500-014-1427-1
– volume: 27
  start-page: 341
  issue: 1–2
  year: 2016
  ident: 10.1016/j.engappai.2020.104121_b61
  article-title: Optimisation techniques for planning the petrol replenishment to retail stations over a multi-period horizon
  publication-title: Int. J. Oper. Res.
  doi: 10.1504/IJOR.2016.078469
– year: 2020
  ident: 10.1016/j.engappai.2020.104121_b43
  article-title: Designing a clothing supply chain network considering pricing and demand sensitivity to discounts and advertisement
  publication-title: RAIRO Oper. Res.
– start-page: 1
  year: 2020
  ident: 10.1016/j.engappai.2020.104121_b21
  article-title: Performance assessment of the metaheuristic optimization algorithms: An exhaustive review
  publication-title: Artif. Intell. Rev.
– volume: 32
  start-page: 393
  issue: 3
  year: 1987
  ident: 10.1016/j.engappai.2020.104121_b42
  article-title: A quadratic integer program for the location of interacting hub facilities
  publication-title: European J. Oper. Res.
  doi: 10.1016/S0377-2217(87)80007-3
– volume: 37
  start-page: 10053
  issue: 24
  year: 2013
  ident: 10.1016/j.engappai.2020.104121_b35
  article-title: Solving a new stochastic multi-mode p-hub covering location problem considering risk by a novel multi-objective algorithm
  publication-title: Appl. Math. Model.
  doi: 10.1016/j.apm.2013.05.063
– volume: 25
  issue: 1
  year: 2018
  ident: 10.1016/j.engappai.2020.104121_b50
  article-title: An efficient artificial bee colony algorithm for a p-hub covering location problem with travel time reliability
  publication-title: Int. J. Ind. Eng.
– volume: 22
  start-page: 971
  issue: 6
  year: 2007
  ident: 10.1016/j.engappai.2020.104121_b19
  article-title: New policies for the dynamic traveling salesman problem
  publication-title: Optim. Methods Softw.
  doi: 10.1080/10556780701550026
– start-page: 862
  year: 2007
  ident: 10.1016/j.engappai.2020.104121_b70
  article-title: The hypervolume indicator revisited: On the design of Pareto-compliant indicators via weighted integration
– volume: 25
  start-page: 793
  issue: 4
  year: 2012
  ident: 10.1016/j.engappai.2020.104121_b26
  article-title: Solving a periodic single-track train timetabling problem by an efficient hybrid algorithm
  publication-title: Eng. Appl. Artif. Intell.
  doi: 10.1016/j.engappai.2012.01.020
– volume: 20
  start-page: 92
  issue: 2
  year: 1986
  ident: 10.1016/j.engappai.2020.104121_b41
  article-title: The location of interacting hub facilities
  publication-title: Transp. Sci.
  doi: 10.1287/trsc.20.2.92
– volume: 72
  start-page: 387
  issue: 2
  year: 1994
  ident: 10.1016/j.engappai.2020.104121_b6
  article-title: Integer programming formulations of discrete hub location problems
  publication-title: European J. Oper. Res.
  doi: 10.1016/0377-2217(94)90318-2
– volume: 108
  start-page: 118
  issue: 1
  year: 1998
  ident: 10.1016/j.engappai.2020.104121_b54
  article-title: Efficient solution procedure and reduced size formulations for p-hub location problems
  publication-title: European J. Oper. Res.
  doi: 10.1016/S0377-2217(97)00201-4
– volume: 90
  year: 2020
  ident: 10.1016/j.engappai.2020.104121_b52
  article-title: A hybrid meta-heuristic algorithm for scientific workflow scheduling in heterogeneous distributed computing systems
  publication-title: Eng. Appl. Artif. Intell.
– volume: 11
  start-page: 295
  issue: 2
  year: 2011
  ident: 10.1016/j.engappai.2020.104121_b63
  article-title: The p-hub model with hub-catchment areas, existing hubs, and simulation: A case study of Serbian intermodal terminals
  publication-title: Netw. Spat. Econ.
  doi: 10.1007/s11067-009-9126-7
– volume: 44
  start-page: 425
  year: 2017
  ident: 10.1016/j.engappai.2020.104121_b57
  article-title: Subset simulation for multi-objective optimization
  publication-title: Appl. Math. Model.
  doi: 10.1016/j.apm.2017.02.005
– volume: 78
  start-page: 53
  year: 2019
  ident: 10.1016/j.engappai.2020.104121_b31
  article-title: Solving a new bi-objective hierarchical hub location problem with an M∕ M∕ c queuing framework
  publication-title: Eng. Appl. Artif. Intell.
  doi: 10.1016/j.engappai.2018.10.004
– volume: 179
  start-page: 978
  issue: 3
  year: 2007
  ident: 10.1016/j.engappai.2020.104121_b5
  article-title: The transfer point location problem
  publication-title: European J. Oper. Res.
  doi: 10.1016/j.ejor.2005.08.030
– volume: 1
  start-page: 19
  issue: 1
  year: 2011
  ident: 10.1016/j.engappai.2020.104121_b14
  article-title: Parameter tuning for configuring and analyzing evolutionary algorithms
  publication-title: Swarm Evol. Comput.
  doi: 10.1016/j.swevo.2011.02.001
– volume: 36
  start-page: 3257
  issue: 7
  year: 2012
  ident: 10.1016/j.engappai.2020.104121_b58
  article-title: A fuzzy programming approach for dynamic virtual hub location problem
  publication-title: Appl. Math. Model.
  doi: 10.1016/j.apm.2011.10.016
– volume: 57
  start-page: 382
  issue: 3–4
  year: 2013
  ident: 10.1016/j.engappai.2020.104121_b17
  article-title: Modeling the budget-constrained dynamic uncapacitated facility location–network design problem and solving it via two efficient heuristics: a case study of health care
  publication-title: Math. Comput. Modelling
  doi: 10.1016/j.mcm.2012.06.017
– ident: 10.1016/j.engappai.2020.104121_b24
  doi: 10.1109/HICSS.2014.131
– volume: 178
  start-page: 391
  issue: 2
  year: 2007
  ident: 10.1016/j.engappai.2020.104121_b64
  article-title: An exact solution procedure for a cluster hub location problem
  publication-title: European J. Oper. Res.
  doi: 10.1016/j.ejor.2006.02.011
– volume: 59
  start-page: 932
  issue: 7
  year: 2008
  ident: 10.1016/j.engappai.2020.104121_b65
  article-title: Model formulations for hub covering problems
  publication-title: J. Oper. Res. Soc.
  doi: 10.1057/palgrave.jors.2602424
– volume: 8
  start-page: 597
  issue: 5
  year: 2019
  ident: 10.1016/j.engappai.2020.104121_b11
  article-title: The capacitated single-allocation p-hub location routing problem: A Lagrangian relaxation and a hyper-heuristic approach
  publication-title: EURO J. Transp. Logist.
  doi: 10.1007/s13676-019-00141-w
– year: 1999
  ident: 10.1016/j.engappai.2020.104121_b28
– volume: 71
  start-page: 236
  year: 2018
  ident: 10.1016/j.engappai.2020.104121_b15
  article-title: Designing and optimizing a sustainable supply chain network for a blood platelet bank under uncertainty
  publication-title: Eng. Appl. Artif. Intell.
  doi: 10.1016/j.engappai.2018.03.004
– volume: 220
  start-page: 629
  issue: 3
  year: 2012
  ident: 10.1016/j.engappai.2020.104121_b25
  article-title: Design of intermodal logistics networks with hub delays
  publication-title: European J. Oper. Res.
  doi: 10.1016/j.ejor.2012.03.010
– start-page: 1
  year: 2018
  ident: 10.1016/j.engappai.2020.104121_b45
  article-title: A bi-objective mixed-model assembly line sequencing problem considering customer satisfaction and customer buying behaviour
  publication-title: Eng. Optim.
SSID ssj0003846
Score 2.4883728
Snippet Hubs act as intermediate points for the transfer of materials in the transportation system. In this study, a novel p-mobile hub location–allocation problem is...
SourceID unpaywall
crossref
elsevier
SourceType Open Access Repository
Enrichment Source
Index Database
Publisher
StartPage 104121
SubjectTerms Clustering
Depreciation
Dynamic hub location–allocation
Meta-heuristic algorithms
Mobility infrastructure
SummonAdditionalLinks – databaseName: Science Direct
  dbid: .~1
  link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3NbtQwELaqXuAC5U-UApoDV3cd_2ySY1VRVUhwgUq9RY496W6VTaJuAuoF8Q4ceD-ehHHilHJAReIYyyNHmfF84_ibGcbeuEpbhSh4ToDAtXIVz3JvOOaZsFla5Ti2ZHn_YXl6pt-dm_MddjznwgRaZfT9k08fvXUcWcSvuejW68VHCg5ou9FmJjtVhKMhg12noYvB4dffNA-VTck6NJmH2beyhC8PsbmwXWfXdE6U43VnIpO_AdS9oens9Rdb17cA6GSPPYiRIxxNL_eI7WDzmD2MUSTEPbqloblRwzz2hP04gtV1SM2CtgJXD6E4AkEW2MbDBnvLVzhMFZvB1hft1bpfbbbQt0CG-RnBQsc3bUn-A1ZDCQH-gjp_fvsebu2nB4idaSD82AWKKmHk2EbNg2u3fVg8yFfWBUIuHdGfsrOTt5-OT3nsyMCdWoqel6nweZlLckqJc0r7yqEw0hkvKc7yla5CtRuT-tL5UmgrrUSDQjk0TtsE1TO227QNPmfgcpQGc0yWNNEJVabKh7NkkjmnKYzdZ2ZWQ-FiufLQNaMuZl7aZTGrrwjqKyb17bPFjVw3Fey4UyKftVz8YXoFocqdsuLGLP5xuRf_sdwBuy8Dp2Zkjb9ku_3VgK8oKOrL16PV_wID7Q6H
  priority: 102
  providerName: Elsevier
Title A hybrid of clustering and meta-heuristic algorithms to solve a p-mobile hub location–allocation problem with the depreciation cost of hub facilities
URI https://dx.doi.org/10.1016/j.engappai.2020.104121
https://doi.org/10.1016/j.engappai.2020.104121
UnpaywallVersion publishedVersion
Volume 98
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Baden-Württemberg Complete Freedom Collection (Elsevier)
  customDbUrl:
  eissn: 1873-6769
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0003846
  issn: 0952-1976
  databaseCode: GBLVA
  dateStart: 20110101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: Elsevier SD Complete Freedom Collection [SCCMFC]
  customDbUrl:
  eissn: 1873-6769
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0003846
  issn: 0952-1976
  databaseCode: ACRLP
  dateStart: 19950201
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals [SCFCJ]
  customDbUrl:
  eissn: 1873-6769
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0003846
  issn: 0952-1976
  databaseCode: AIKHN
  dateStart: 19950201
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: Science Direct
  customDbUrl:
  eissn: 1873-6769
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0003846
  issn: 0952-1976
  databaseCode: .~1
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVLSH
  databaseName: Elsevier Journals
  customDbUrl:
  mediaType: online
  eissn: 1873-6769
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0003846
  issn: 0952-1976
  databaseCode: AKRWK
  dateStart: 19880301
  isFulltext: true
  providerName: Library Specific Holdings
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Lj9MwELagPXBieYpFUM2Bq0tebuJjhVgVKgpCVCynyBlPtrukSbRNQMsB8R848P_4JdiJs1oQaJdTFCuTh2bs-Sae-YaxJ5hHKiTyuDQOgUch5jyRWnCSiaeSOJfUtWR5tZot1tHLQ3HoAkVbC_Pb_n2Xh0XlkaprdWxiuaDbkvRt3fh4Jgz2HrHxevVm_qEn1Au4L7tucn4Sh9zmbl4oCf77jf7ljW60Za3OPquiuOBtDvbY6-E9-ySTj9O2yab45Q8Kx6t_yC120wFPmPeWcptdo_IO23MgFNwU35mhoc_DMHaX_ZjD5sxWdkGVAxat5VYwHg9UqWFLjeIbanvCZ1DFUXV63Gy2O2gqMHb9iUBBzbdVZpYf2LQZWO9preHnt-92078_AdfYBux_YTCgFLoUXWc4gNWusQ-38rlCm89rIvx7bH3w_N2zBXcNHTiGM6_hWexpmcnArGk-YhjpHMkTAQodGJim8yi3ZDki1hnqzItUoAIS5IVIAiPlU3ifjcqqpAcMUFIgSJI_MxeiF2ZxqG0o6ieIkUHB-0wMik3RsZ3bphtFOqS1naSDQlKrkLRXyD57ei5X93wfl0rIwW5Sh1p6NJIaE7hU1js3tCs-7uH_izxio-a0pccGPTXZhF2ffvUnbDx_sVys7HH59v1y4ibSL1PXHsk
linkProvider Unpaywall
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb9QwELZKOZQLb9QHjzlwdTex4018rCqqBdpeaKXeIseZdLfKJlE3oeoF8R964P_xSxgnTikHVCSOsTxylHnH38ww9t4WkZGIAdfkEHgkbcETnSuOOglMEhca-5EsR8fT2Wn06UydrbH9sRbGwSq97R9sem-t_crEf81Js1hMvlBwQOpGykxyKsmPPmAPIyVil4HtfvuN85DJUK1Du7nbfqdM-GIXq3PTNGZBiaLo7ztDEf7NQ210VWOur0xZ3vFAB0_ZYx86wt7wds_YGlbP2RMfRoJX0hUtjZMaxrUX7McezK9dbRbUBdiyc90RyGeBqXJYYmv4HLuhZTOY8ry-XLTz5QraGkgyvyIYaPiyzsiAwLzLwPk_x8-f32_ctf3wAH40Dbg_u0BhJfQgW896sPWqdYc7-sJYh8ilHP0lOz34cLI_434kA7dyGrQ8i4NcZ1qQVQqtlVFeWAyUsCoXFGjlRVS4djcqzjObZ0FkhBGoMJAWlY1MiPIVW6_qCjcZWI1CocZwShttILNY5i6ZDBNrI4pjt5ga2ZBa36_cjc0o0xGYdpGO7Esd-9KBfVtsckvXDB077qXQI5fTP2QvJbdyL21wKxb_eNz2fxz3jm3MTo4O08OPx5932CPhADY9hPw1W28vO3xDEVKbve014BeklBGq
linkToUnpaywall http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Lb9QwELbQ9sCJ8hStaDUHri7Ow5v4uEKtKiQKB1Yqp8geT7qFbBJ1E1A58R848P_4JbUTpyoI1HKMlYkTzWfPN_E8GHuJZaoTIsGVMwg8TbDkubKSk8qFzrNS0dCS5e3J_HiZvjmVp8FR9Lkwv53fD3FYVJ_pttXnzpeLhyPJyOeNb82l494ztrU8eb_4OBbUi3mkhm5yUZ4l3Mdu3kgJ_vuD_mWN7vd1qy-_6qq6YW2Ottm76T3HIJPPB31nDvDbHyUc7_4hD9mDQDxhMSLlEbtH9WO2HUgohCW-cUNTn4dp7An7uYDVpc_sgqYErHpfW8FZPNC1hTV1mq-oHws-g67OmovzbrXeQNeAw_UXAg0tXzfGbT-w6g146-nR8Ov7D3_oP15AaGwD_r8wOFIKQ4huAA5gs-n85F6-1OjjeZ2H_5Qtjw4_vD7moaEDx2QuOm4yYZVRsdvTIsQktSWSkDFKGzuaZsu09MVyZGYNWiNSHeuYJIkESWKqI0qesVnd1PScASqKJSmK5u5GFInJEutd0ShHTB0L3mFyUmyBodq5b7pRFVNY26diUkjhFVKMCtlhr67l2rHex60SasJNEVjLyEYKB4FbZcU10O443e7_i7xgs-6ipz3HnjqzH5bMFeSrGpo
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+hybrid+of+clustering+and+meta-heuristic+algorithms+to+solve+a+p-mobile+hub+location%E2%80%93allocation+problem+with+the+depreciation+cost+of+hub+facilities&rft.jtitle=Engineering+applications+of+artificial+intelligence&rft.au=Mokhtarzadeh%2C+Mahdi&rft.au=Tavakkoli-Moghaddam%2C+Reza&rft.au=Triki%2C+Chefi&rft.au=Rahimi%2C+Yaser&rft.date=2021-02-01&rft.issn=0952-1976&rft.volume=98&rft.spage=104121&rft_id=info:doi/10.1016%2Fj.engappai.2020.104121&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_engappai_2020_104121
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0952-1976&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0952-1976&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0952-1976&client=summon