A Diffused Memetic Optimizer for reactive berth allocation and scheduling at marine container terminals in response to disruptions

•A Diffused Memetic Optimizer (DMO) is developed for reactive berth allocation and scheduling.•The algorithm addresses the issue of limited interactions within the diffusion grid.•DMO deploys tailored hybridization techniques to facilitate the search within the diffusion grid.•DMO showcases its supe...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Swarm and evolutionary computation Jg. 80; S. 101334
1. Verfasser: Dulebenets, Maxim A.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 01.07.2023
Schlagworte:
ISSN:2210-6502
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract •A Diffused Memetic Optimizer (DMO) is developed for reactive berth allocation and scheduling.•The algorithm addresses the issue of limited interactions within the diffusion grid.•DMO deploys tailored hybridization techniques to facilitate the search within the diffusion grid.•DMO showcases its superiority against the exact optimization method and well-known state-of-the-art metaheuristics.•Some important managerial insights are derived that could assist with the real-time berth schedule recovery. The economic development of numerous countries is defined by maritime supply chains to a great extent. Substantial volumes of containerized cargoes delivered by ships are handled at marine container terminals. However, these terminals often face different types of disruptive events, and it is critical to provide an effective response to unexpected disruptions. This study proposes a novel optimization model for reactive berth allocation and scheduling at marine terminals that explicitly captures various recovery strategies along with the handling resources available at the terminal. Due to the computational complexity of the model, a novel Diffused Memetic Optimizer (DMO) is developed. The proposed DMO algorithm addresses the issue of limited interactions between the individuals located on the opposite sides of the diffusion grid, which is viewed as a common limitation of diffused algorithms. Furthermore, the proposed DMO deploys problem-specific tailored hybridization techniques inspired by exact optimization to facilitate the search for good-quality solutions within the diffusion grid. The computational experiments showcase the competitive DMO performance against the exact mixed-integer non-linear programming method (BARON) and some of the well-known state-of-the-art metaheuristics. Furthermore, it is discovered that slow diffusion alone by means of imposing the diffusion grid is not sufficient for the successful performance. The periodic migration between the designated areas of the diffusion grid and the application of problem-specific hybridization techniques are essential for explorative capabilities of the developed DMO algorithm. Last but not least, important managerial insights are revealed using the proposed methodology, which can assist with the berth schedule recovery.
AbstractList •A Diffused Memetic Optimizer (DMO) is developed for reactive berth allocation and scheduling.•The algorithm addresses the issue of limited interactions within the diffusion grid.•DMO deploys tailored hybridization techniques to facilitate the search within the diffusion grid.•DMO showcases its superiority against the exact optimization method and well-known state-of-the-art metaheuristics.•Some important managerial insights are derived that could assist with the real-time berth schedule recovery. The economic development of numerous countries is defined by maritime supply chains to a great extent. Substantial volumes of containerized cargoes delivered by ships are handled at marine container terminals. However, these terminals often face different types of disruptive events, and it is critical to provide an effective response to unexpected disruptions. This study proposes a novel optimization model for reactive berth allocation and scheduling at marine terminals that explicitly captures various recovery strategies along with the handling resources available at the terminal. Due to the computational complexity of the model, a novel Diffused Memetic Optimizer (DMO) is developed. The proposed DMO algorithm addresses the issue of limited interactions between the individuals located on the opposite sides of the diffusion grid, which is viewed as a common limitation of diffused algorithms. Furthermore, the proposed DMO deploys problem-specific tailored hybridization techniques inspired by exact optimization to facilitate the search for good-quality solutions within the diffusion grid. The computational experiments showcase the competitive DMO performance against the exact mixed-integer non-linear programming method (BARON) and some of the well-known state-of-the-art metaheuristics. Furthermore, it is discovered that slow diffusion alone by means of imposing the diffusion grid is not sufficient for the successful performance. The periodic migration between the designated areas of the diffusion grid and the application of problem-specific hybridization techniques are essential for explorative capabilities of the developed DMO algorithm. Last but not least, important managerial insights are revealed using the proposed methodology, which can assist with the berth schedule recovery.
ArticleNumber 101334
Author Dulebenets, Maxim A.
Author_xml – sequence: 1
  givenname: Maxim A.
  orcidid: 0000-0001-8456-9736
  surname: Dulebenets
  fullname: Dulebenets, Maxim A.
  email: mdulebenets@eng.famu.fsu.edu
  organization: Department of Civil & Environmental Engineering, Florida A&M University-Florida State University (FAMU-FSU) College of Engineering, 2035 E Paul Dirac Dr., Sliger Building, Suite 275, Tallahassee, FL 32310, USA
BookMark eNqFkMtOAjEUhrvARESewE1fAOxlZqALFwSvCYaNrptOe0YOGVrSFowufXIHcOVCz6YnJ_3-5P8uSM8HD4RccTbmjFfX63F6h30YCybk4SJl0SN9ITgbVSUT52SY0pp1UzFRlqpPvmb0Fptml8DRZ9hARkuX24wb_IRImxBpBGMz7oHWEPOKmrYN1mQMnhrvaLIrcLsW_Rs1mW5MRA_UBp9Nt0SaIW7QmzZR9F1S2gafgOZAHaa42x5i0iU5a7ofMPx5B-T1_u5l_jhaLB-e5rPFyEom80gwJlUpnarrklfKTGqnCqaqamqmEyi4UcZOiroQZW2t5LVQ06ZxpnS8mRhlCzkg6pRrY0gpQqMt5mOTHA22mjN9cKjX-uhQHxzqk8OOlb_YbcSu7cc_1M2Jgq7WHiHqZBG8BYcRbNYu4J_8N-sHk64
CitedBy_id crossref_primary_10_1016_j_swevo_2025_102133
crossref_primary_10_1371_journal_pone_0300036
crossref_primary_10_1016_j_engappai_2023_106962
crossref_primary_10_1016_j_cie_2023_109767
crossref_primary_10_3233_JIFS_241796
crossref_primary_10_3389_fenvs_2023_1237763
crossref_primary_10_1016_j_apm_2025_115933
crossref_primary_10_1016_j_heliyon_2023_e22456
crossref_primary_10_1016_j_engappai_2023_107459
crossref_primary_10_1016_j_engappai_2023_107416
crossref_primary_10_3390_su16051908
crossref_primary_10_1016_j_pdisas_2024_100331
crossref_primary_10_3390_buildings14030808
crossref_primary_10_1016_j_asoc_2025_113544
crossref_primary_10_3390_su151914383
crossref_primary_10_1016_j_asoc_2024_111446
crossref_primary_10_1016_j_sasc_2023_200064
crossref_primary_10_3390_su151512021
crossref_primary_10_1016_j_sasc_2024_200105
crossref_primary_10_1016_j_swevo_2025_102009
crossref_primary_10_3390_buildings13092178
crossref_primary_10_3390_su151411360
crossref_primary_10_4995_ijpme_2025_22928
crossref_primary_10_3390_math13132057
crossref_primary_10_1109_TITS_2024_3416349
crossref_primary_10_3390_su152115347
crossref_primary_10_1016_j_heliyon_2024_e37241
crossref_primary_10_1016_j_engappai_2024_107884
crossref_primary_10_1109_TITS_2024_3388468
crossref_primary_10_1016_j_sasc_2024_200091
crossref_primary_10_1177_14750902241267039
crossref_primary_10_1016_j_asoc_2023_111135
crossref_primary_10_1038_s41598_024_61578_2
crossref_primary_10_1016_j_cor_2024_106789
crossref_primary_10_3390_su151511761
crossref_primary_10_1016_j_sasc_2024_200099
crossref_primary_10_3390_su151411399
crossref_primary_10_1109_TITS_2024_3477996
crossref_primary_10_1016_j_susoc_2024_11_001
crossref_primary_10_1108_MABR_12_2023_0086
crossref_primary_10_3390_su151511527
crossref_primary_10_3390_su16135407
crossref_primary_10_1007_s10586_024_04812_w
crossref_primary_10_1016_j_ins_2024_121106
crossref_primary_10_1007_s00500_023_09553_3
crossref_primary_10_1016_j_swevo_2023_101444
crossref_primary_10_3390_app14177510
crossref_primary_10_1007_s11356_023_31265_2
crossref_primary_10_3390_su16031117
crossref_primary_10_1007_s10696_024_09587_1
crossref_primary_10_1109_TCE_2023_3332878
crossref_primary_10_1109_TITS_2024_3360420
crossref_primary_10_1016_j_aei_2025_103633
crossref_primary_10_3390_su151410898
crossref_primary_10_3390_su151511791
crossref_primary_10_1016_j_ins_2024_121031
crossref_primary_10_1016_j_ocecoaman_2024_107113
crossref_primary_10_1016_j_heliyon_2024_e31759
crossref_primary_10_3390_su16041511
crossref_primary_10_1080_23311916_2024_2321757
crossref_primary_10_1007_s00500_025_10588_x
crossref_primary_10_1016_j_engappai_2023_107321
crossref_primary_10_1016_j_sasc_2024_200087
crossref_primary_10_1016_j_sasc_2024_200127
crossref_primary_10_1016_j_aei_2023_102291
crossref_primary_10_1016_j_sasc_2024_200125
crossref_primary_10_1007_s00500_024_09903_9
crossref_primary_10_1080_21693277_2024_2332285
crossref_primary_10_1109_TITS_2024_3465234
crossref_primary_10_1111_itor_13552
crossref_primary_10_1007_s00500_024_09888_5
crossref_primary_10_1016_j_engappai_2024_109009
crossref_primary_10_3390_su151914511
crossref_primary_10_1016_j_tre_2025_104104
crossref_primary_10_3390_pr11092543
crossref_primary_10_1080_03088839_2025_2451363
crossref_primary_10_1016_j_autcon_2024_105894
crossref_primary_10_1016_j_aei_2024_102786
crossref_primary_10_1016_j_sasc_2024_200155
crossref_primary_10_3390_buildings13102563
crossref_primary_10_3390_jmse11122240
crossref_primary_10_1016_j_heliyon_2024_e30319
crossref_primary_10_1016_j_eswa_2024_124393
crossref_primary_10_1016_j_ins_2024_121522
Cites_doi 10.1016/j.swevo.2020.100830
10.1108/MABR-08-2019-0032
10.1016/j.cie.2016.04.008
10.1109/TEVC.2002.800880
10.1016/j.tre.2014.09.013
10.1016/j.swevo.2018.02.016
10.1016/j.ejor.2021.03.016
10.1016/j.tre.2012.07.006
10.3390/jmse9050527
10.1016/j.ejor.2010.07.018
10.1016/j.aei.2021.101418
10.1007/s11067-018-9434-x
10.1057/mel.2011.21
10.3141/2479-07
10.1109/TEVC.2003.810751
10.14716/ijtech.v13i3.5269
10.1016/j.cor.2013.07.018
10.1016/j.cie.2019.106040
10.1016/j.cie.2018.09.033
10.1007/s12293-019-00292-3
10.1016/j.cie.2021.107240
10.1016/j.swevo.2020.100748
10.1016/j.swevo.2020.100720
10.1016/j.cie.2021.107417
10.1080/01605682.2020.1776168
10.1016/j.trb.2019.02.013
10.1016/j.aei.2022.101623
10.3390/jmse10050563
10.1016/j.tranpol.2021.05.011
10.1016/j.swevo.2021.100935
10.1016/j.tre.2022.102793
10.1007/s10462-017-9605-z
10.1016/j.ejor.2021.12.040
10.1007/s13748-014-0056-3
10.1016/j.ins.2021.02.039
10.1080/07408179208964244
10.1007/s10951-016-0480-2
10.1016/j.swevo.2020.100751
10.1007/s10479-010-0820-0
10.1016/j.cie.2021.107585
10.1016/j.trb.2022.05.011
ContentType Journal Article
Copyright 2023 Elsevier B.V.
Copyright_xml – notice: 2023 Elsevier B.V.
DBID AAYXX
CITATION
DOI 10.1016/j.swevo.2023.101334
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
ExternalDocumentID 10_1016_j_swevo_2023_101334
S2210650223001074
GroupedDBID --K
--M
.~1
0R~
1~.
1~5
4.4
457
4G.
5VS
7-5
8P~
AAAKF
AABVA
AACTN
AAEDT
AAEDW
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AARIN
AATLK
AAXUO
AAYFN
ABAOU
ABBOA
ABGRD
ABMAC
ABUCO
ABXDB
ABYKQ
ACAZW
ACDAQ
ACGFS
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADMUD
ADQTV
ADTZH
AEBSH
AECPX
AEKER
AENEX
AEQOU
AFKWA
AFTJW
AFXIZ
AGHFR
AGUBO
AGYEJ
AHJVU
AHZHX
AIALX
AIEXJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
APLSM
ARUGR
AXJTR
BJAXD
BKOJK
BLXMC
CBWCG
EBS
EFJIC
EFLBG
EJD
FDB
FEDTE
FIRID
FNPLU
FYGXN
GBLVA
GBOLZ
HAMUX
HVGLF
HZ~
J1W
JJJVA
KOM
M41
MHUIS
MO0
N9A
O-L
O9-
OAUVE
P-8
P-9
PC.
Q38
RIG
ROL
SDF
SES
SPC
SPCBC
SSA
SSB
SSD
SST
SSV
SSW
SSZ
T5K
~G-
AATTM
AAXKI
AAYWO
AAYXX
ABJNI
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
AEIPS
AEUPX
AFJKZ
AFPUW
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
CITATION
EFKBS
~HD
ID FETCH-LOGICAL-c303t-2003953d9bb5169a7bd9409668a87e41a9ac74b425bcc31b298ffda5d1f7a9c43
ISICitedReferencesCount 99
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001009471000001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2210-6502
IngestDate Wed Nov 05 20:48:57 EST 2025
Tue Nov 18 22:37:48 EST 2025
Fri Feb 23 02:36:45 EST 2024
IsPeerReviewed true
IsScholarly true
Keywords Berth allocation and scheduling
Diffused algorithms
Hybridization
Migration
Disruptions
Exact optimization
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c303t-2003953d9bb5169a7bd9409668a87e41a9ac74b425bcc31b298ffda5d1f7a9c43
ORCID 0000-0001-8456-9736
ParticipantIDs crossref_citationtrail_10_1016_j_swevo_2023_101334
crossref_primary_10_1016_j_swevo_2023_101334
elsevier_sciencedirect_doi_10_1016_j_swevo_2023_101334
PublicationCentury 2000
PublicationDate July 2023
2023-07-00
PublicationDateYYYYMMDD 2023-07-01
PublicationDate_xml – month: 07
  year: 2023
  text: July 2023
PublicationDecade 2020
PublicationTitle Swarm and evolutionary computation
PublicationYear 2023
Publisher Elsevier B.V
Publisher_xml – name: Elsevier B.V
References Guo, Zheng, Du, Du, Zhu (bib0016) 2022; 164
Fathollahi-Fard, Dulebenets, Hajiaghaei–Keshteli, Tavakkoli-Moghaddam, Safaeian, Mirzahosseinian (bib0054) 2021; 50
Guo, Wang, Zheng (bib0031) 2021; 158
Rodrigues, Agra (bib0023) 2021; 295
Xiang, Liu, Miao (bib0029) 2018; 126
Liu, Zheng, Zhang (bib0027) 2016; 97
Tsui (bib0051) 1992; 24
Foo, Kirley (bib0040) 2008
Yan, Lu, Hsieh, Lin (bib0022) 2019; 19
Kim, Park, Park, Cho (bib0032) 2021; 9
Lakshminarayanan, Kaur (bib0053) 2018; 42
Gmys, Carneiro, Melab, Talbi, Tuyttens (bib0006) 2020; 57
Pasha, Nwodu, Fathollahi-Fard, Tian, Li, Wang, Dulebenets (bib0047) 2022; 52
Salgotra, Singh, Saha, Gandomi (bib0057) 2021; 60
Bernstein, Li (bib0039) 2003
Zhen, Zhuge, Wang, Wang (bib0036) 2022; 162
Alba, Tomassini (bib0011) 2002; 6
Eiben, Smith (bib0045) 2015
Kay, G., 2021. Hurricane Ida aftermath will worsen supply chain bottlenecks and lead to even more shortages and price hikes, experts warn. Available at
Park, Cho, Lee (bib0033) 2021; 160
Xu, Chen, Quan (bib0019) 2012; 192
Pardo, Argüeso-Alejandro, González, Banga, Doallo (bib0007) 2020; 59
Elmi, Singh, Meriga, Goniewicz, Borowska-Stefańska, Wiśniewski, Dulebenets (bib0005) 2022; 10
Roy (bib0052) 2010
Dulebenets (bib0014) 2020; 12
Rodrigues, Agra (bib0001) 2022; 303
Cruz-Duarte, Amaya, Ortiz-Bayliss, Conant-Pablos, Terashima-Marín, Shi (bib0009) 2021; 66
Lewis, Mostaghim, Randall (bib0012) 2009
Branke, Schmeck, Deb (bib0044) 2004
Prayogo, Komarudin, Mubarak (bib0035) 2022; 13
Tomassini (bib0013) 2005
I.C.E. Cargo. 2021. How bad weather impacts shipping (and how to deal with it). Available at
Li, Jin, Lu (bib0026) 2015; 2479
Krink, Thomsen (bib0037) 2001
Han, Lu, Xi (bib0017) 2010; 207
Narasimha, Jena, Majhi (bib0004) 2021; 110
Xiang, Liu (bib0024) 2021; 104
(Accessed: 12 June 2022).
Golias (bib0018) 2011; 13
Zhen, Sun, Zhang, Wang, Yi (bib0025) 2021; 72
Imai, Yamakawa, Huang (bib0050) 2014; 72
Bara'a, Abbood, Hasan, Pizzuti, Al-Ani, Özdemir, Al-Dabbagh (bib0008) 2021; 63
Rodriguez-Molins, Ingolotti, Barber, Salido, Sierra, Puente (bib0021) 2014; 2
Umang, Bierlaire, Erera (bib0028) 2017; 20
Imai, Nishimura, Papadimitriou (bib0049) 2013; 49
Deb, Zope, Jain (bib0043) 2003
Dulebenets (bib0046) 2021; 565
Golias, Portal, Konur, Kaisar, Kolomvos (bib0020) 2014; 41
Morquecho, Torres, Castro (bib0010) 2021; 61
Hussain, Mohd Salleh, Cheng, Shi (bib0056) 2019; 52
Van Veldhuizen, Zydallis, Lamont (bib0041) 2002
Dokeroglu, Sevinc, Kucukyilmaz, Cosar (bib0055) 2019; 137
Iris, Lam (bib0030) 2019; 122
Theophilus, Dulebenets, Pasha, Lau, Fathollahi-Fard, Mazaheri (bib0048) 2021; 156
Van Veldhuizen, Zydallis, Lamont (bib0042) 2003; 7
Tan, He (bib0034) 2021
Kavoosi, Dulebenets, Abioye, Pasha, Theophilus, Wang, Kampmann, Mikijeljević (bib0015) 2020; 5
Ursem (bib0038) 2002
Hussain (10.1016/j.swevo.2023.101334_bib0056) 2019; 52
Rodriguez-Molins (10.1016/j.swevo.2023.101334_bib0021) 2014; 2
Bernstein (10.1016/j.swevo.2023.101334_bib0039) 2003
Narasimha (10.1016/j.swevo.2023.101334_bib0004) 2021; 110
Yan (10.1016/j.swevo.2023.101334_bib0022) 2019; 19
Dulebenets (10.1016/j.swevo.2023.101334_bib0046) 2021; 565
Morquecho (10.1016/j.swevo.2023.101334_bib0010) 2021; 61
Kavoosi (10.1016/j.swevo.2023.101334_bib0015) 2020; 5
Golias (10.1016/j.swevo.2023.101334_bib0020) 2014; 41
Golias (10.1016/j.swevo.2023.101334_bib0018) 2011; 13
Ursem (10.1016/j.swevo.2023.101334_bib0038) 2002
Fathollahi-Fard (10.1016/j.swevo.2023.101334_bib0054) 2021; 50
Umang (10.1016/j.swevo.2023.101334_bib0028) 2017; 20
Iris (10.1016/j.swevo.2023.101334_bib0030) 2019; 122
Dulebenets (10.1016/j.swevo.2023.101334_bib0014) 2020; 12
Salgotra (10.1016/j.swevo.2023.101334_bib0057) 2021; 60
Tan (10.1016/j.swevo.2023.101334_bib0034) 2021
Xiang (10.1016/j.swevo.2023.101334_bib0024) 2021; 104
Imai (10.1016/j.swevo.2023.101334_bib0050) 2014; 72
Elmi (10.1016/j.swevo.2023.101334_bib0005) 2022; 10
Gmys (10.1016/j.swevo.2023.101334_bib0006) 2020; 57
Rodrigues (10.1016/j.swevo.2023.101334_bib0001) 2022; 303
Tomassini (10.1016/j.swevo.2023.101334_bib0013) 2005
Rodrigues (10.1016/j.swevo.2023.101334_bib0023) 2021; 295
Van Veldhuizen (10.1016/j.swevo.2023.101334_bib0041) 2002
Eiben (10.1016/j.swevo.2023.101334_bib0045) 2015
Tsui (10.1016/j.swevo.2023.101334_bib0051) 1992; 24
Imai (10.1016/j.swevo.2023.101334_bib0049) 2013; 49
Guo (10.1016/j.swevo.2023.101334_bib0016) 2022; 164
Li (10.1016/j.swevo.2023.101334_bib0026) 2015; 2479
Park (10.1016/j.swevo.2023.101334_bib0033) 2021; 160
Dokeroglu (10.1016/j.swevo.2023.101334_bib0055) 2019; 137
Bara'a (10.1016/j.swevo.2023.101334_bib0008) 2021; 63
Liu (10.1016/j.swevo.2023.101334_bib0027) 2016; 97
Krink (10.1016/j.swevo.2023.101334_bib0037) 2001
Cruz-Duarte (10.1016/j.swevo.2023.101334_bib0009) 2021; 66
Prayogo (10.1016/j.swevo.2023.101334_bib0035) 2022; 13
Van Veldhuizen (10.1016/j.swevo.2023.101334_bib0042) 2003; 7
Deb (10.1016/j.swevo.2023.101334_bib0043) 2003
Branke (10.1016/j.swevo.2023.101334_bib0044) 2004
Theophilus (10.1016/j.swevo.2023.101334_bib0048) 2021; 156
Roy (10.1016/j.swevo.2023.101334_bib0052) 2010
10.1016/j.swevo.2023.101334_bib0003
10.1016/j.swevo.2023.101334_bib0002
Zhen (10.1016/j.swevo.2023.101334_bib0025) 2021; 72
Lakshminarayanan (10.1016/j.swevo.2023.101334_bib0053) 2018; 42
Lewis (10.1016/j.swevo.2023.101334_bib0012) 2009
Guo (10.1016/j.swevo.2023.101334_bib0031) 2021; 158
Han (10.1016/j.swevo.2023.101334_bib0017) 2010; 207
Pardo (10.1016/j.swevo.2023.101334_bib0007) 2020; 59
Xiang (10.1016/j.swevo.2023.101334_bib0029) 2018; 126
Kim (10.1016/j.swevo.2023.101334_bib0032) 2021; 9
Pasha (10.1016/j.swevo.2023.101334_bib0047) 2022; 52
Alba (10.1016/j.swevo.2023.101334_bib0011) 2002; 6
Zhen (10.1016/j.swevo.2023.101334_bib0036) 2022; 162
Foo (10.1016/j.swevo.2023.101334_bib0040) 2008
Xu (10.1016/j.swevo.2023.101334_bib0019) 2012; 192
References_xml – volume: 59
  year: 2020
  ident: bib0007
  article-title: Spark implementation of the enhanced Scatter Search metaheuristic: methodology and assessment
  publication-title: Swarm. Evol. Comput.
– year: 2009
  ident: bib0012
  article-title: Biologically-Inspired Optimisation Methods: Parallel Algorithms, Systems and Applications (Vol. 210)
– volume: 50
  year: 2021
  ident: bib0054
  article-title: Two hybrid meta-heuristic algorithms for a dual-channel closed-loop supply chain network design problem in the tire industry under uncertainty
  publication-title: Adv. Eng. Inf.
– volume: 12
  start-page: 51
  year: 2020
  end-page: 72
  ident: bib0014
  article-title: An Adaptive Island Evolutionary Algorithm for the berth scheduling problem
  publication-title: Memet. Comput.
– volume: 122
  start-page: 365
  year: 2019
  end-page: 389
  ident: bib0030
  article-title: Recoverable robustness in weekly berth and quay crane planning
  publication-title: Transport. Res. Part B: Methodol.
– volume: 192
  start-page: 123
  year: 2012
  end-page: 140
  ident: bib0019
  article-title: Robust berth scheduling with uncertain vessel delay and handling time
  publication-title: Ann. Oper. Res.
– start-page: 1952
  year: 2004
  end-page: 1957
  ident: bib0044
  article-title: Parallelizing multi-objective evolutionary algorithms: cone separation
  publication-title: Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No. 04TH8753)
– year: 2015
  ident: bib0045
  article-title: Introduction to Evolutionary Computing
– volume: 565
  start-page: 390
  year: 2021
  end-page: 421
  ident: bib0046
  article-title: An adaptive polyploid memetic algorithm for scheduling trucks at a cross-docking terminal
  publication-title: Inf. Sci.
– volume: 42
  start-page: 89
  year: 2018
  end-page: 98
  ident: bib0053
  article-title: Optimal maintenance scheduling of generator units using discrete integer cuckoo search optimization algorithm
  publication-title: Swarm. Evol. Comput.
– volume: 126
  start-page: 196
  year: 2018
  end-page: 216
  ident: bib0029
  article-title: Reactive strategy for discrete berth allocation and quay crane assignment problems under uncertainty
  publication-title: Comput. Ind. Eng.
– volume: 13
  start-page: 677
  year: 2022
  end-page: 689
  ident: bib0035
  article-title: Bi-objective recoverable berth allocation and quay crane assignment planning under environmental uncertainty
  publication-title: Int. J. Technol.
– volume: 63
  year: 2021
  ident: bib0008
  article-title: A review of heuristics and metaheuristics for community detection in complex networks: current usage, emerging development and future directions
  publication-title: Swarm. Evol. Comput.
– volume: 162
  start-page: 1
  year: 2022
  end-page: 27
  ident: bib0036
  article-title: Integrated berth and yard space allocation under uncertainty
  publication-title: Transport. Res. Part B: Methodol.
– volume: 97
  start-page: 258
  year: 2016
  end-page: 275
  ident: bib0027
  article-title: Behavior perception-based disruption models for berth allocation and quay crane assignment problems
  publication-title: Comput. Ind. Eng.
– start-page: 2246
  year: 2008
  end-page: 2253
  ident: bib0040
  article-title: An analysis of the effects of clustering in graph-based evolutionary algorithms
  publication-title: 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence)
– volume: 164
  year: 2022
  ident: bib0016
  article-title: The berth assignment and allocation problem considering cooperative liner carriers
  publication-title: Transport. Res. Part E: Logist. Transport. Rev.
– volume: 207
  start-page: 1327
  year: 2010
  end-page: 1340
  ident: bib0017
  article-title: A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling time
  publication-title: Eur. J. Oper. Res.
– volume: 72
  start-page: 77
  year: 2014
  end-page: 100
  ident: bib0050
  article-title: The strategic berth template problem
  publication-title: Transport. Res. Part E: Logist. Transport. Rev.
– volume: 20
  start-page: 67
  year: 2017
  end-page: 83
  ident: bib0028
  article-title: Real-time management of berth allocation with stochastic arrival and handling times
  publication-title: J. Sched.
– reference: I.C.E. Cargo. 2021. How bad weather impacts shipping (and how to deal with it). Available at:
– volume: 160
  year: 2021
  ident: bib0033
  article-title: Particle swarm optimization algorithm with time buffer insertion for robust berth scheduling
  publication-title: Comput. Ind. Eng.
– volume: 52
  year: 2022
  ident: bib0047
  article-title: Exact and metaheuristic algorithms for the vehicle routing problem with a factory-in-a-box in multi-objective settings
  publication-title: Adv. Eng. Inf.
– volume: 66
  year: 2021
  ident: bib0009
  article-title: Hyper-Heuristics to customise metaheuristics for continuous optimisation
  publication-title: Swarm. Evol. Comput.
– reference: Kay, G., 2021. Hurricane Ida aftermath will worsen supply chain bottlenecks and lead to even more shortages and price hikes, experts warn. Available at:
– volume: 2
  start-page: 177
  year: 2014
  end-page: 192
  ident: bib0021
  article-title: A genetic algorithm for robust berth allocation and quay crane assignment
  publication-title: Progress Artif. Intell.
– start-page: 595
  year: 2002
  end-page: 602
  ident: bib0041
  article-title: Issues in parallelizing multiobjective evolutionary algorithms for real world applications
  publication-title: Proceedings of the 2002 ACM symposium on Applied computing
– start-page: 534
  year: 2003
  end-page: 549
  ident: bib0043
  article-title: Distributed computing of pareto-optimal solutions with evolutionary algorithms
  publication-title: International Conference on Evolutionary Multi-Criterion Optimization
– volume: 61
  year: 2021
  ident: bib0010
  article-title: An efficient hybrid metaheuristics optimization technique applied to the AC electric transmission network expansion planning
  publication-title: Swarm. Evol. Comput.
– volume: 110
  start-page: 191
  year: 2021
  end-page: 203
  ident: bib0004
  article-title: Impact of COVID-19 on the Indian seaport transportation and maritime supply chain
  publication-title: Transp. Policy (Oxf.)
– volume: 60
  year: 2021
  ident: bib0057
  article-title: Self adaptive cuckoo search: analysis and experimentation
  publication-title: Swarm. Evol. Comput.
– volume: 9
  start-page: 527
  year: 2021
  ident: bib0032
  article-title: Rescheduling strategy for berth planning in container terminals: an empirical study from Korea
  publication-title: J. Marine Sci. Eng.
– start-page: 462
  year: 2002
  end-page: 471
  ident: bib0038
  article-title: Diversity-guided evolutionary algorithms
  publication-title: International Conference on Parallel Problem Solving from Nature
– volume: 104
  year: 2021
  ident: bib0024
  article-title: An almost robust optimization model for integrated berth allocation and quay crane assignment problem
  publication-title: Omega (Westport)
– volume: 7
  start-page: 144
  year: 2003
  end-page: 173
  ident: bib0042
  article-title: Considerations in engineering parallel multiobjective evolutionary algorithms
  publication-title: IEEE Trans. Evol. Comput.
– volume: 49
  start-page: 141
  year: 2013
  end-page: 158
  ident: bib0049
  article-title: Marine container terminal configurations for efficient handling of mega-containerships
  publication-title: Transportation Research Part E: Logistics and Transportation Review
– volume: 72
  start-page: 2225
  year: 2021
  end-page: 2240
  ident: bib0025
  article-title: Column generation for low carbon berth allocation under uncertainty
  publication-title: J. Oper. Res. Soc.
– start-page: 1155
  year: 2001
  end-page: 1161
  ident: bib0037
  article-title: Self-organized criticality and mass extinction in evolutionary algorithms
  publication-title: Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No. 01TH8546)
– volume: 13
  start-page: 419
  year: 2011
  end-page: 441
  ident: bib0018
  article-title: A bi-objective berth allocation formulation to account for vessel handling time uncertainty
  publication-title: Maritime Econ. Logistics
– volume: 10
  start-page: 563
  year: 2022
  ident: bib0005
  article-title: Uncertainties in liner shipping and ship schedule recovery: a state-of-the-art review
  publication-title: J. Mar. Sci. Eng.
– volume: 137
  year: 2019
  ident: bib0055
  article-title: A survey on new generation metaheuristic algorithms
  publication-title: Comput. Ind. Eng.
– year: 2005
  ident: bib0013
  article-title: Spatially Structured Evolutionary algorithms: Artificial Evolution in Space and Time
– volume: 156
  year: 2021
  ident: bib0048
  article-title: Truck scheduling optimization at a cold-chain cross-docking terminal with product perishability considerations
  publication-title: Comput. Ind. Eng.
– volume: 52
  start-page: 2191
  year: 2019
  end-page: 2233
  ident: bib0056
  article-title: Metaheuristic research: a comprehensive survey
  publication-title: Artif. Intell. Rev.
– volume: 2479
  start-page: 49
  year: 2015
  end-page: 59
  ident: bib0026
  article-title: Real-time disruption recovery for integrated berth allocation and crane assignment in container terminals
  publication-title: Transp. Res. Rec.
– volume: 5
  start-page: 30
  year: 2020
  end-page: 66
  ident: bib0015
  article-title: Berth scheduling at marine container terminals: a universal island-based metaheuristic approach
  publication-title: Maritime Bus. Rev.
– reference: (Accessed: 12 June 2022).
– volume: 6
  start-page: 443
  year: 2002
  end-page: 462
  ident: bib0011
  article-title: Parallelism and evolutionary algorithms
  publication-title: IEEE Trans. Evol. Comput.
– volume: 295
  start-page: 499
  year: 2021
  end-page: 516
  ident: bib0023
  article-title: An exact robust approach for the integrated berth allocation and quay crane scheduling problem under uncertain arrival times
  publication-title: Eur. J. Oper. Res.
– volume: 158
  year: 2021
  ident: bib0031
  article-title: Berth allocation problem with uncertain vessel handling times considering weather conditions
  publication-title: Comput. Ind. Eng.
– volume: 303
  start-page: 501
  year: 2022
  end-page: 524
  ident: bib0001
  article-title: Berth allocation and quay crane assignment/scheduling problem under uncertainty: a survey
  publication-title: Eur. J. Oper. Res.
– volume: 57
  year: 2020
  ident: bib0006
  article-title: A comparative study of high-productivity high-performance programming languages for parallel metaheuristics
  publication-title: Swarm. Evol. Comput.
– start-page: 1
  year: 2021
  end-page: 32
  ident: bib0034
  article-title: Integrated proactive and reactive strategies for sustainable berth allocation and quay crane assignment under uncertainty
  publication-title: Ann. Oper. Res.
– volume: 41
  start-page: 412
  year: 2014
  end-page: 422
  ident: bib0020
  article-title: Robust berth scheduling at marine container terminals via hierarchical optimization
  publication-title: Comput. Oper. Res.
– year: 2010
  ident: bib0052
  article-title: A primer on the Taguchi Method. Second Edition
– start-page: 427
  year: 2003
  end-page: 434
  ident: bib0039
  article-title: Critical dynamics in evolutionary algorithms
  publication-title: The 2003 Congress on Evolutionary Computation, 2003. CEC'03
– volume: 24
  start-page: 44
  year: 1992
  end-page: 57
  ident: bib0051
  article-title: An overview of Taguchi method and newly developed statistical methods for robust design
  publication-title: IIE Trans.
– volume: 19
  start-page: 903
  year: 2019
  end-page: 927
  ident: bib0022
  article-title: A dynamic and flexible berth allocation model with stochastic vessel arrival times
  publication-title: Netw. Spatial Econ.
– reference: (Accessed: 12 June 2022).
– volume: 61
  year: 2021
  ident: 10.1016/j.swevo.2023.101334_bib0010
  article-title: An efficient hybrid metaheuristics optimization technique applied to the AC electric transmission network expansion planning
  publication-title: Swarm. Evol. Comput.
  doi: 10.1016/j.swevo.2020.100830
– volume: 5
  start-page: 30
  issue: 1
  year: 2020
  ident: 10.1016/j.swevo.2023.101334_bib0015
  article-title: Berth scheduling at marine container terminals: a universal island-based metaheuristic approach
  publication-title: Maritime Bus. Rev.
  doi: 10.1108/MABR-08-2019-0032
– volume: 97
  start-page: 258
  year: 2016
  ident: 10.1016/j.swevo.2023.101334_bib0027
  article-title: Behavior perception-based disruption models for berth allocation and quay crane assignment problems
  publication-title: Comput. Ind. Eng.
  doi: 10.1016/j.cie.2016.04.008
– volume: 6
  start-page: 443
  issue: 5
  year: 2002
  ident: 10.1016/j.swevo.2023.101334_bib0011
  article-title: Parallelism and evolutionary algorithms
  publication-title: IEEE Trans. Evol. Comput.
  doi: 10.1109/TEVC.2002.800880
– volume: 72
  start-page: 77
  year: 2014
  ident: 10.1016/j.swevo.2023.101334_bib0050
  article-title: The strategic berth template problem
  publication-title: Transport. Res. Part E: Logist. Transport. Rev.
  doi: 10.1016/j.tre.2014.09.013
– volume: 42
  start-page: 89
  year: 2018
  ident: 10.1016/j.swevo.2023.101334_bib0053
  article-title: Optimal maintenance scheduling of generator units using discrete integer cuckoo search optimization algorithm
  publication-title: Swarm. Evol. Comput.
  doi: 10.1016/j.swevo.2018.02.016
– volume: 295
  start-page: 499
  issue: 2
  year: 2021
  ident: 10.1016/j.swevo.2023.101334_bib0023
  article-title: An exact robust approach for the integrated berth allocation and quay crane scheduling problem under uncertain arrival times
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2021.03.016
– year: 2010
  ident: 10.1016/j.swevo.2023.101334_bib0052
– start-page: 2246
  year: 2008
  ident: 10.1016/j.swevo.2023.101334_bib0040
  article-title: An analysis of the effects of clustering in graph-based evolutionary algorithms
– volume: 49
  start-page: 141
  issue: 1
  year: 2013
  ident: 10.1016/j.swevo.2023.101334_bib0049
  article-title: Marine container terminal configurations for efficient handling of mega-containerships
  publication-title: Transportation Research Part E: Logistics and Transportation Review
  doi: 10.1016/j.tre.2012.07.006
– volume: 9
  start-page: 527
  issue: 5
  year: 2021
  ident: 10.1016/j.swevo.2023.101334_bib0032
  article-title: Rescheduling strategy for berth planning in container terminals: an empirical study from Korea
  publication-title: J. Marine Sci. Eng.
  doi: 10.3390/jmse9050527
– start-page: 1
  year: 2021
  ident: 10.1016/j.swevo.2023.101334_bib0034
  article-title: Integrated proactive and reactive strategies for sustainable berth allocation and quay crane assignment under uncertainty
  publication-title: Ann. Oper. Res.
– start-page: 595
  year: 2002
  ident: 10.1016/j.swevo.2023.101334_bib0041
  article-title: Issues in parallelizing multiobjective evolutionary algorithms for real world applications
– start-page: 427
  year: 2003
  ident: 10.1016/j.swevo.2023.101334_bib0039
  article-title: Critical dynamics in evolutionary algorithms
– volume: 207
  start-page: 1327
  issue: 3
  year: 2010
  ident: 10.1016/j.swevo.2023.101334_bib0017
  article-title: A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling time
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2010.07.018
– volume: 50
  year: 2021
  ident: 10.1016/j.swevo.2023.101334_bib0054
  article-title: Two hybrid meta-heuristic algorithms for a dual-channel closed-loop supply chain network design problem in the tire industry under uncertainty
  publication-title: Adv. Eng. Inf.
  doi: 10.1016/j.aei.2021.101418
– volume: 19
  start-page: 903
  issue: 3
  year: 2019
  ident: 10.1016/j.swevo.2023.101334_bib0022
  article-title: A dynamic and flexible berth allocation model with stochastic vessel arrival times
  publication-title: Netw. Spatial Econ.
  doi: 10.1007/s11067-018-9434-x
– volume: 13
  start-page: 419
  issue: 4
  year: 2011
  ident: 10.1016/j.swevo.2023.101334_bib0018
  article-title: A bi-objective berth allocation formulation to account for vessel handling time uncertainty
  publication-title: Maritime Econ. Logistics
  doi: 10.1057/mel.2011.21
– volume: 2479
  start-page: 49
  issue: 1
  year: 2015
  ident: 10.1016/j.swevo.2023.101334_bib0026
  article-title: Real-time disruption recovery for integrated berth allocation and crane assignment in container terminals
  publication-title: Transp. Res. Rec.
  doi: 10.3141/2479-07
– start-page: 1155
  year: 2001
  ident: 10.1016/j.swevo.2023.101334_bib0037
  article-title: Self-organized criticality and mass extinction in evolutionary algorithms
– volume: 7
  start-page: 144
  issue: 2
  year: 2003
  ident: 10.1016/j.swevo.2023.101334_bib0042
  article-title: Considerations in engineering parallel multiobjective evolutionary algorithms
  publication-title: IEEE Trans. Evol. Comput.
  doi: 10.1109/TEVC.2003.810751
– volume: 13
  start-page: 677
  issue: 3
  year: 2022
  ident: 10.1016/j.swevo.2023.101334_bib0035
  article-title: Bi-objective recoverable berth allocation and quay crane assignment planning under environmental uncertainty
  publication-title: Int. J. Technol.
  doi: 10.14716/ijtech.v13i3.5269
– volume: 41
  start-page: 412
  year: 2014
  ident: 10.1016/j.swevo.2023.101334_bib0020
  article-title: Robust berth scheduling at marine container terminals via hierarchical optimization
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2013.07.018
– volume: 137
  year: 2019
  ident: 10.1016/j.swevo.2023.101334_bib0055
  article-title: A survey on new generation metaheuristic algorithms
  publication-title: Comput. Ind. Eng.
  doi: 10.1016/j.cie.2019.106040
– volume: 126
  start-page: 196
  year: 2018
  ident: 10.1016/j.swevo.2023.101334_bib0029
  article-title: Reactive strategy for discrete berth allocation and quay crane assignment problems under uncertainty
  publication-title: Comput. Ind. Eng.
  doi: 10.1016/j.cie.2018.09.033
– volume: 12
  start-page: 51
  issue: 1
  year: 2020
  ident: 10.1016/j.swevo.2023.101334_bib0014
  article-title: An Adaptive Island Evolutionary Algorithm for the berth scheduling problem
  publication-title: Memet. Comput.
  doi: 10.1007/s12293-019-00292-3
– volume: 156
  year: 2021
  ident: 10.1016/j.swevo.2023.101334_bib0048
  article-title: Truck scheduling optimization at a cold-chain cross-docking terminal with product perishability considerations
  publication-title: Comput. Ind. Eng.
  doi: 10.1016/j.cie.2021.107240
– volume: 59
  year: 2020
  ident: 10.1016/j.swevo.2023.101334_bib0007
  article-title: Spark implementation of the enhanced Scatter Search metaheuristic: methodology and assessment
  publication-title: Swarm. Evol. Comput.
  doi: 10.1016/j.swevo.2020.100748
– volume: 104
  year: 2021
  ident: 10.1016/j.swevo.2023.101334_bib0024
  article-title: An almost robust optimization model for integrated berth allocation and quay crane assignment problem
  publication-title: Omega (Westport)
– year: 2005
  ident: 10.1016/j.swevo.2023.101334_bib0013
– volume: 57
  year: 2020
  ident: 10.1016/j.swevo.2023.101334_bib0006
  article-title: A comparative study of high-productivity high-performance programming languages for parallel metaheuristics
  publication-title: Swarm. Evol. Comput.
  doi: 10.1016/j.swevo.2020.100720
– volume: 158
  year: 2021
  ident: 10.1016/j.swevo.2023.101334_bib0031
  article-title: Berth allocation problem with uncertain vessel handling times considering weather conditions
  publication-title: Comput. Ind. Eng.
  doi: 10.1016/j.cie.2021.107417
– year: 2009
  ident: 10.1016/j.swevo.2023.101334_bib0012
– volume: 72
  start-page: 2225
  issue: 10
  year: 2021
  ident: 10.1016/j.swevo.2023.101334_bib0025
  article-title: Column generation for low carbon berth allocation under uncertainty
  publication-title: J. Oper. Res. Soc.
  doi: 10.1080/01605682.2020.1776168
– start-page: 534
  year: 2003
  ident: 10.1016/j.swevo.2023.101334_bib0043
  article-title: Distributed computing of pareto-optimal solutions with evolutionary algorithms
– ident: 10.1016/j.swevo.2023.101334_bib0003
– year: 2015
  ident: 10.1016/j.swevo.2023.101334_bib0045
– volume: 122
  start-page: 365
  year: 2019
  ident: 10.1016/j.swevo.2023.101334_bib0030
  article-title: Recoverable robustness in weekly berth and quay crane planning
  publication-title: Transport. Res. Part B: Methodol.
  doi: 10.1016/j.trb.2019.02.013
– volume: 63
  year: 2021
  ident: 10.1016/j.swevo.2023.101334_bib0008
  article-title: A review of heuristics and metaheuristics for community detection in complex networks: current usage, emerging development and future directions
  publication-title: Swarm. Evol. Comput.
– volume: 52
  year: 2022
  ident: 10.1016/j.swevo.2023.101334_bib0047
  article-title: Exact and metaheuristic algorithms for the vehicle routing problem with a factory-in-a-box in multi-objective settings
  publication-title: Adv. Eng. Inf.
  doi: 10.1016/j.aei.2022.101623
– volume: 10
  start-page: 563
  issue: 5
  year: 2022
  ident: 10.1016/j.swevo.2023.101334_bib0005
  article-title: Uncertainties in liner shipping and ship schedule recovery: a state-of-the-art review
  publication-title: J. Mar. Sci. Eng.
  doi: 10.3390/jmse10050563
– volume: 110
  start-page: 191
  year: 2021
  ident: 10.1016/j.swevo.2023.101334_bib0004
  article-title: Impact of COVID-19 on the Indian seaport transportation and maritime supply chain
  publication-title: Transp. Policy (Oxf.)
  doi: 10.1016/j.tranpol.2021.05.011
– volume: 66
  year: 2021
  ident: 10.1016/j.swevo.2023.101334_bib0009
  article-title: Hyper-Heuristics to customise metaheuristics for continuous optimisation
  publication-title: Swarm. Evol. Comput.
  doi: 10.1016/j.swevo.2021.100935
– start-page: 462
  year: 2002
  ident: 10.1016/j.swevo.2023.101334_bib0038
  article-title: Diversity-guided evolutionary algorithms
– volume: 164
  year: 2022
  ident: 10.1016/j.swevo.2023.101334_bib0016
  article-title: The berth assignment and allocation problem considering cooperative liner carriers
  publication-title: Transport. Res. Part E: Logist. Transport. Rev.
  doi: 10.1016/j.tre.2022.102793
– volume: 52
  start-page: 2191
  issue: 4
  year: 2019
  ident: 10.1016/j.swevo.2023.101334_bib0056
  article-title: Metaheuristic research: a comprehensive survey
  publication-title: Artif. Intell. Rev.
  doi: 10.1007/s10462-017-9605-z
– volume: 303
  start-page: 501
  year: 2022
  ident: 10.1016/j.swevo.2023.101334_bib0001
  article-title: Berth allocation and quay crane assignment/scheduling problem under uncertainty: a survey
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2021.12.040
– ident: 10.1016/j.swevo.2023.101334_bib0002
– volume: 2
  start-page: 177
  issue: 4
  year: 2014
  ident: 10.1016/j.swevo.2023.101334_bib0021
  article-title: A genetic algorithm for robust berth allocation and quay crane assignment
  publication-title: Progress Artif. Intell.
  doi: 10.1007/s13748-014-0056-3
– volume: 565
  start-page: 390
  year: 2021
  ident: 10.1016/j.swevo.2023.101334_bib0046
  article-title: An adaptive polyploid memetic algorithm for scheduling trucks at a cross-docking terminal
  publication-title: Inf. Sci.
  doi: 10.1016/j.ins.2021.02.039
– volume: 24
  start-page: 44
  issue: 5
  year: 1992
  ident: 10.1016/j.swevo.2023.101334_bib0051
  article-title: An overview of Taguchi method and newly developed statistical methods for robust design
  publication-title: IIE Trans.
  doi: 10.1080/07408179208964244
– volume: 20
  start-page: 67
  issue: 1
  year: 2017
  ident: 10.1016/j.swevo.2023.101334_bib0028
  article-title: Real-time management of berth allocation with stochastic arrival and handling times
  publication-title: J. Sched.
  doi: 10.1007/s10951-016-0480-2
– start-page: 1952
  year: 2004
  ident: 10.1016/j.swevo.2023.101334_bib0044
  article-title: Parallelizing multi-objective evolutionary algorithms: cone separation
– volume: 60
  year: 2021
  ident: 10.1016/j.swevo.2023.101334_bib0057
  article-title: Self adaptive cuckoo search: analysis and experimentation
  publication-title: Swarm. Evol. Comput.
  doi: 10.1016/j.swevo.2020.100751
– volume: 192
  start-page: 123
  issue: 1
  year: 2012
  ident: 10.1016/j.swevo.2023.101334_bib0019
  article-title: Robust berth scheduling with uncertain vessel delay and handling time
  publication-title: Ann. Oper. Res.
  doi: 10.1007/s10479-010-0820-0
– volume: 160
  year: 2021
  ident: 10.1016/j.swevo.2023.101334_bib0033
  article-title: Particle swarm optimization algorithm with time buffer insertion for robust berth scheduling
  publication-title: Comput. Ind. Eng.
  doi: 10.1016/j.cie.2021.107585
– volume: 162
  start-page: 1
  year: 2022
  ident: 10.1016/j.swevo.2023.101334_bib0036
  article-title: Integrated berth and yard space allocation under uncertainty
  publication-title: Transport. Res. Part B: Methodol.
  doi: 10.1016/j.trb.2022.05.011
SSID ssj0000602559
Score 2.58216
Snippet •A Diffused Memetic Optimizer (DMO) is developed for reactive berth allocation and scheduling.•The algorithm addresses the issue of limited interactions within...
SourceID crossref
elsevier
SourceType Enrichment Source
Index Database
Publisher
StartPage 101334
SubjectTerms Berth allocation and scheduling
Diffused algorithms
Disruptions
Exact optimization
Hybridization
Migration
Title A Diffused Memetic Optimizer for reactive berth allocation and scheduling at marine container terminals in response to disruptions
URI https://dx.doi.org/10.1016/j.swevo.2023.101334
Volume 80
WOSCitedRecordID wos001009471000001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  issn: 2210-6502
  databaseCode: AIEXJ
  dateStart: 20110301
  customDbUrl:
  isFulltext: true
  dateEnd: 99991231
  titleUrlDefault: https://www.sciencedirect.com
  omitProxy: false
  ssIdentifier: ssj0000602559
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwELag5cCF8hSlgObALWS1edvHCIoAQUGioL1FjuOoW-2mq022XXHklzN-JbsUreiBSxRFseNkvozH429mCHkVZBWjKtEt50Hi44wv8Wxc-gGXIlQZzgK9XfDjU3ZyQicT9tXu4Le6nEDWNHS9Zov_Kmq8hsJWobM3EHffKV7AcxQ6HlHsePwnweeoxup61aIl-VnOVYyi9wX1wnz6Uy41qRDNRK3kPMWpPvPUzrvx2-mNBFzt4uyjg9R55825ig7UhHauwgQ9S56ZtSYQRhNsdfWNatouV4vB_WcN3m9XfGmqcMhL-9qKpyd0MYktFsDb1QxF3cjO-L_5ejr38tGmVyKMegarVV4hLiV9tP62NK2p2WRVJeqCyPgxr2lx41A4H7VXOLSR6n403L2dM_uPuaxnGDry2nmhOylUJ4Xp5DbZD7OEoRbfzz8cTz72LrlxqhdYqhyhG73LU6UZgdeG83dbZsM-Ob1P7tmFBeQGEA_ILdk8JAeuaAdYHf6I_MrB4QMsPqDHByA-wOEDND5gwAegGGHAB_AODD6gxwf0-IBpAw4f0F3ABj4ek-_vjk_fvPdtIQ5foIXTqd8rYklUsbJU26o8KysW49o3pZxmMg444yKLS1T_pRBRUIaM1nXFkyqoM85EHD0he81FI58SYJyGiYj5WEicPhjlMsY2SZRWlFbpODskofukhbBZ6lWxlFmxQ6KH5HXfaGGStOy-PXWyKqydaezHAgG4q-Gzmz3niNwdfo3nZK9bruQLckdcdvjFX1r0_QZlq6XE
linkProvider Elsevier
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+Diffused+Memetic+Optimizer+for+reactive+berth+allocation+and+scheduling+at+marine+container+terminals+in+response+to+disruptions&rft.jtitle=Swarm+and+evolutionary+computation&rft.au=Dulebenets%2C+Maxim+A.&rft.date=2023-07-01&rft.issn=2210-6502&rft.volume=80&rft.spage=101334&rft_id=info:doi/10.1016%2Fj.swevo.2023.101334&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_swevo_2023_101334
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2210-6502&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2210-6502&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2210-6502&client=summon