Intelligent bulk cargo terminal scheduling based on a novel chaotic-optimal thermodynamic evolutionary algorithm

This paper presents a chaotic optimal thermodynamic evolutionary algorithm (COTEA) designed to address the integrated scheduling problems of berth allocation, ship unloader scheduling, and yard allocation at bulk cargo terminals. Our proposed COTEA introduces a thermal transition crossover method th...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Complex & intelligent systems Ročník 10; číslo 6; s. 7435 - 7450
Hlavní autori: Liu, Shida, Liu, Qingsheng, Wang, Li, Chen, Xianlong
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Cham Springer International Publishing 01.12.2024
Springer Nature B.V
Springer
Predmet:
ISSN:2199-4536, 2198-6053
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract This paper presents a chaotic optimal thermodynamic evolutionary algorithm (COTEA) designed to address the integrated scheduling problems of berth allocation, ship unloader scheduling, and yard allocation at bulk cargo terminals. Our proposed COTEA introduces a thermal transition crossover method that effectively circumvents local optima in the scheduling solution process. Additionally, the method innovatively combines a good point set with chaotic dynamics within an integrated initialization framework, thereby cultivating a robust and exploratory initial population for the optimization algorithm. To further enhance the selection process, our paper proposes a refined parental selection protocol that employs a quantified hypervolume contribution metric to discern superior candidate solutions. Postevolution, our algorithm employs a Cauchy inverse cumulative distribution-based neighborhood search to effectively explore and enhance the solution spaces, significantly accelerating the convergence speed during the scheduling solution process. The proposed method is adept at achieving multiobjective optimization, simultaneously improving the service level and reducing costs for bulk cargo terminals, which in turn boosts their competitiveness. The effectiveness of our COTEA is demonstrated through extensive numerical simulations.
AbstractList Abstract This paper presents a chaotic optimal thermodynamic evolutionary algorithm (COTEA) designed to address the integrated scheduling problems of berth allocation, ship unloader scheduling, and yard allocation at bulk cargo terminals. Our proposed COTEA introduces a thermal transition crossover method that effectively circumvents local optima in the scheduling solution process. Additionally, the method innovatively combines a good point set with chaotic dynamics within an integrated initialization framework, thereby cultivating a robust and exploratory initial population for the optimization algorithm. To further enhance the selection process, our paper proposes a refined parental selection protocol that employs a quantified hypervolume contribution metric to discern superior candidate solutions. Postevolution, our algorithm employs a Cauchy inverse cumulative distribution-based neighborhood search to effectively explore and enhance the solution spaces, significantly accelerating the convergence speed during the scheduling solution process. The proposed method is adept at achieving multiobjective optimization, simultaneously improving the service level and reducing costs for bulk cargo terminals, which in turn boosts their competitiveness. The effectiveness of our COTEA is demonstrated through extensive numerical simulations.
This paper presents a chaotic optimal thermodynamic evolutionary algorithm (COTEA) designed to address the integrated scheduling problems of berth allocation, ship unloader scheduling, and yard allocation at bulk cargo terminals. Our proposed COTEA introduces a thermal transition crossover method that effectively circumvents local optima in the scheduling solution process. Additionally, the method innovatively combines a good point set with chaotic dynamics within an integrated initialization framework, thereby cultivating a robust and exploratory initial population for the optimization algorithm. To further enhance the selection process, our paper proposes a refined parental selection protocol that employs a quantified hypervolume contribution metric to discern superior candidate solutions. Postevolution, our algorithm employs a Cauchy inverse cumulative distribution-based neighborhood search to effectively explore and enhance the solution spaces, significantly accelerating the convergence speed during the scheduling solution process. The proposed method is adept at achieving multiobjective optimization, simultaneously improving the service level and reducing costs for bulk cargo terminals, which in turn boosts their competitiveness. The effectiveness of our COTEA is demonstrated through extensive numerical simulations.
Author Wang, Li
Liu, Shida
Liu, Qingsheng
Chen, Xianlong
Author_xml – sequence: 1
  givenname: Shida
  surname: Liu
  fullname: Liu, Shida
  organization: North China University of Technology
– sequence: 2
  givenname: Qingsheng
  surname: Liu
  fullname: Liu, Qingsheng
  organization: North China University of Technology
– sequence: 3
  givenname: Li
  surname: Wang
  fullname: Wang, Li
  email: li.wang@ncut.edu.cn
  organization: North China University of Technology
– sequence: 4
  givenname: Xianlong
  surname: Chen
  fullname: Chen, Xianlong
  organization: Beijing Forever Technology Co., Ltd
BookMark eNp9kU-LFDEQxRtZwXXdL-Ap4Lm1kk7S3UdZ_DOw4EXPoSZd3ZMxk4xJZpf59manRcHDHkJCeL9Xj3qvm6sQAzXNWw7vOUD_IUvoZd-CkC1wqUT7-KK5FnwcWg2qu7q8x1aqTr9qbnPeAwDv-6EDcd0cN6GQ926hUNj25H8yi2mJrFA6uICeZbuj6eRdWNgWM00sBoYsxAfyzO4wFmfbeCzuULVlV6k4nQMenGX0EP2puBgwnRn6JSZXdoc3zcsZfabbP_dN8-Pzp-93X9v7b182dx_vW6tAlFaNWkjeWxzlhBw5aVUPKdCgBQgBZIVFgAksDFMHIDUKoXSvtvNoae5ums3qO0Xcm2OqAdPZRHTm8hHTYjDV8J6M1Yqw71CN4ySt1TiCVvMguJpn4hyr17vV65jirxPlYvbxlOp2suk47wWMchiqSqwqm2LOiea_UzmYp6LMWpSpRZlLUeaxQsN_kHUFn7ZWEjr_PNqtaK5zwkLpX6pnqN_6t6um
CitedBy_id crossref_primary_10_1016_j_trc_2025_105221
Cites_doi 10.1007/s00291-010-0209-0
10.1007/s10479-018-3125-3
10.1016/j.ejor.2021.03.016
10.1016/j.cor.2021.105224
10.1016/j.tre.2020.101856
10.32604/csse.2022.029230
10.1287/trsc.2019.0946
10.1057/mel.2014.20
10.1109/4235.996017
10.3929/ethz-a-004284029
10.1109/TEVC.2007.892759
10.1016/S0191-2615(02)00023-1
10.1002/atr.5670310107
10.1016/j.trb.2020.10.010
10.1007/s10951-015-0436-y
10.1109/TASE.2017.2784483
10.1016/j.ejor.2021.12.040
10.1142/S0218213011000097
10.3141/2479-07
10.1007/s11063-023-11189-1
10.1016/j.eswa.2017.06.010
10.1016/S0191-2615(99)00057-0
10.1016/j.cie.2018.09.033
10.1155/2022/8069796
10.1007/s10732-022-09506-3
10.1016/j.ejor.2016.04.022
10.1016/j.tre.2019.03.018
10.1016/j.omega.2021.102455
10.1016/S0377-2217(00)00128-4
10.1007/s40747-023-01135-y
10.1016/j.cor.2023.106174
10.1007/s10951-017-0510-8
10.1016/j.eswa.2011.04.224
10.1080/0305215X.2018.1473390
10.1145/1570256.1570387
10.1007/978-3-030-87672-2
10.1109/FITME.2010.5655783
10.1007/978-3-030-57993-7-29
10.1002/acs.3529
ContentType Journal Article
Copyright The Author(s) 2024
The Author(s) 2024. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml – notice: The Author(s) 2024
– notice: The Author(s) 2024. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID C6C
AAYXX
CITATION
8FE
8FG
ABUWG
AFKRA
ARAPS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
HCIFZ
P5Z
P62
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
DOA
DOI 10.1007/s40747-024-01452-w
DatabaseName Springer Nature OA Free Journals
CrossRef
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials
ProQuest Central
ProQuest Technology Collection
ProQuest One
ProQuest Central Korea
SciTech Premium Collection
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
ProQuest One Academic
ProQuest One Academic (New)
ProQuest Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
Publicly Available Content Database
Advanced Technologies & Aerospace Collection
Technology Collection
ProQuest One Academic Middle East (New)
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest One Academic Eastern Edition
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Technology Collection
ProQuest SciTech Collection
ProQuest Central China
ProQuest Central
Advanced Technologies & Aerospace Database
ProQuest One Applied & Life Sciences
ProQuest One Academic UKI Edition
ProQuest Central Korea
ProQuest Central (New)
ProQuest One Academic
ProQuest One Academic (New)
DatabaseTitleList

Publicly Available Content Database
CrossRef
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
– sequence: 2
  dbid: PIMPY
  name: Publicly Available Content Database
  url: http://search.proquest.com/publiccontent
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Mathematics
EISSN 2198-6053
EndPage 7450
ExternalDocumentID oai_doaj_org_article_c65ea73a599d4cc6a9065f8215ffe11a
10_1007_s40747_024_01452_w
GrantInformation_xml – fundername: North China University of Technology YuYou Talent Training Program
  grantid: KM202310009010
– fundername: Beijing Municipal Social Science Foundation
  grantid: 4212035
  funderid: http://dx.doi.org/10.13039/100017414
GroupedDBID 0R~
8FE
8FG
AAJSJ
AAKKN
ABEEZ
ABFTD
ACACY
ACGFS
ACULB
ADINQ
ADMLS
AFGXO
AFKRA
AHBYD
AHSBF
AHYZX
ALMA_UNASSIGNED_HOLDINGS
AMKLP
ARAPS
ASPBG
AVWKF
BAPOH
BENPR
BGLVJ
C24
C6C
CCPQU
EBLON
EBS
EJD
GROUPED_DOAJ
HCIFZ
IAO
ISR
ITC
M~E
OK1
P62
PIMPY
PROAC
RSV
SOJ
AASML
AAYXX
AFFHD
CITATION
PHGZM
PHGZT
PQGLB
ABUWG
AZQEC
DWQXO
PKEHL
PQEST
PQQKQ
PQUKI
PRINS
ID FETCH-LOGICAL-c502t-5962417ca94da1a1e651e6e5060620220ec2ca00d0c08d30046a225675bf9cef3
IEDL.DBID P5Z
ISICitedReferencesCount 2
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001271465500002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2199-4536
IngestDate Fri Oct 03 12:52:27 EDT 2025
Wed Oct 08 14:20:34 EDT 2025
Sat Nov 29 05:49:04 EST 2025
Tue Nov 18 21:14:57 EST 2025
Fri Feb 21 02:37:08 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 6
Keywords Bulk terminal
Crane schedule
Stockyard allocation
Chaotic-optimal thermodynamic evolutionary algorithm
Berth allocation
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c502t-5962417ca94da1a1e651e6e5060620220ec2ca00d0c08d30046a225675bf9cef3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
OpenAccessLink https://www.proquest.com/docview/3117209488?pq-origsite=%requestingapplication%
PQID 3117209488
PQPubID 2044308
PageCount 16
ParticipantIDs doaj_primary_oai_doaj_org_article_c65ea73a599d4cc6a9065f8215ffe11a
proquest_journals_3117209488
crossref_primary_10_1007_s40747_024_01452_w
crossref_citationtrail_10_1007_s40747_024_01452_w
springer_journals_10_1007_s40747_024_01452_w
PublicationCentury 2000
PublicationDate 2024-12-01
PublicationDateYYYYMMDD 2024-12-01
PublicationDate_xml – month: 12
  year: 2024
  text: 2024-12-01
  day: 01
PublicationDecade 2020
PublicationPlace Cham
PublicationPlace_xml – name: Cham
– name: Heidelberg
PublicationTitle Complex & intelligent systems
PublicationTitleAbbrev Complex Intell. Syst
PublicationYear 2024
Publisher Springer International Publishing
Springer Nature B.V
Springer
Publisher_xml – name: Springer International Publishing
– name: Springer Nature B.V
– name: Springer
References Türkoğulları, Taşkın, Aras, Altınel (CR30) 2016; 254
Yu, Qiang, Benfei (CR36) 2019; 51
Liu, Li, Sheng, Wang (CR21) 2021; 143
Zitzler, Laumanns, Thiele (CR39) 2001
Xiang, Liu, Miao (CR34) 2018; 126
CR38
Xiang, Liu (CR33) 2021; 104
Song, Wu, Song, Stojanovic (CR28) 2023; 55
CR12
Unsal, Oguz (CR31) 2019; 126
Peng, Song, Song, Stojanovic (CR24) 2023; 9
Wang, Du, Fang, Li (CR32) 2020; 54
Nishimura, Imai, Papadimitriou (CR22) 2001; 131
de Andrade, Menezes (CR10) 2023; 29
Ernst, Oğuz, Singh, Taherkhani (CR14) 2017; 20
Xin, Negenborn, Van Vianen (CR35) 2018; 15
Raa, Dullaert, Van Schaeren (CR25) 2011; 38
Hamdan (CR15) 2011; 20
Cheimanoff, Féniès, Kitri, Tchernev (CR8) 2023; 153
CR4
Dávila de León, Lalla-Ruiz, Melián-Batista (CR9) 2022
CR6
Zhang, Li (CR37) 2007; 11
CR7
Burdett, Corry, Eustace (CR5) 2021; 130
Angelelli, Kalinowski, Kapoor, Savelsbergh (CR2) 2016; 19
Hu, Ji, Hua, Zhou, Hu (CR16) 2022; 43
Deb, Pratap, Agarwal, Meyarivan (CR13) 2002; 6
Imai, Nagaiwa, Tat (CR17) 1997; 31
Li, Jin, Lu (CR20) 2015; 2479
de León, Lalla-Ruiz, Melián-Batista, Moreno-Vega (CR11) 2017; 87
Imai, Nishimura, Papadimitriou (CR18) 2001; 35
Park, Choe, Ok, Ryu (CR23) 2010; 32
Rodrigues, Agra (CR26) 2021; 295
Rodrigues, Agra (CR27) 2022; 303
Sun, Meng, Tang, Liu, Huang, Yang (CR29) 2020; 134
Abou Kasm, Diabat, Cheng (CR1) 2020; 291
Babu, Pratap, Lahoti, Fernandes, Tiwari, Mount, Xiong (CR3) 2015; 17
Imai, Nishimura, Papadimitriou (CR19) 2003; 37
JLM de Andrade (1452_CR10) 2023; 29
1452_CR12
F Rodrigues (1452_CR27) 2022; 303
O Abou Kasm (1452_CR1) 2020; 291
E Nishimura (1452_CR22) 2001; 131
F Rodrigues (1452_CR26) 2021; 295
Q Zhang (1452_CR37) 2007; 11
A Dávila de León (1452_CR9) 2022
T Park (1452_CR23) 2010; 32
X Song (1452_CR28) 2023; 55
X Xiang (1452_CR33) 2021; 104
1452_CR7
AD de León (1452_CR11) 2017; 87
1452_CR6
D Sun (1452_CR29) 2020; 134
E Zitzler (1452_CR39) 2001
A Imai (1452_CR18) 2001; 35
X Xiang (1452_CR34) 2018; 126
AT Ernst (1452_CR14) 2017; 20
1452_CR4
MZ Li (1452_CR20) 2015; 2479
1452_CR38
O Unsal (1452_CR31) 2019; 126
B Raa (1452_CR25) 2011; 38
YB Türkoğulları (1452_CR30) 2016; 254
M Hamdan (1452_CR15) 2011; 20
T Yu (1452_CR36) 2019; 51
N Cheimanoff (1452_CR8) 2023; 153
B Liu (1452_CR21) 2021; 143
A Imai (1452_CR17) 1997; 31
A Imai (1452_CR19) 2003; 37
SAI Babu (1452_CR3) 2015; 17
RL Burdett (1452_CR5) 2021; 130
X Hu (1452_CR16) 2022; 43
Z Peng (1452_CR24) 2023; 9
J Xin (1452_CR35) 2018; 15
K Deb (1452_CR13) 2002; 6
T Wang (1452_CR32) 2020; 54
E Angelelli (1452_CR2) 2016; 19
References_xml – volume: 32
  start-page: 593
  year: 2010
  end-page: 615
  ident: CR23
  article-title: Real-time scheduling for twin rmgs in an automated container yard
  publication-title: OR Spectrum
  doi: 10.1007/s00291-010-0209-0
– volume: 291
  start-page: 435
  year: 2020
  end-page: 461
  ident: CR1
  article-title: The integrated berth allocation, quay crane assignment and scheduling problem: mathematical formulations and a case study
  publication-title: Ann Oper Res
  doi: 10.1007/s10479-018-3125-3
– volume: 295
  start-page: 499
  issue: 2
  year: 2021
  end-page: 516
  ident: CR26
  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
– volume: 130
  start-page: 105224
  year: 2021
  ident: CR5
  article-title: Stockpile scheduling with geometry constraints in dry bulk terminals
  publication-title: Comput Oper Res
  doi: 10.1016/j.cor.2021.105224
– volume: 134
  start-page: 101856
  year: 2020
  ident: CR29
  article-title: Storage space allocation problem at inland bulk material stockyard
  publication-title: Transp Res Part E
  doi: 10.1016/j.tre.2020.101856
– ident: CR4
– volume: 43
  start-page: 1285
  issue: 3
  year: 2022
  end-page: 1296
  ident: CR16
  article-title: An improved genetic algorithm for berth scheduling at bulk terminal
  publication-title: Comput Syst Sci Eng
  doi: 10.32604/csse.2022.029230
– ident: CR12
– volume: 54
  start-page: 1307
  issue: 5
  year: 2020
  end-page: 1331
  ident: CR32
  article-title: Berth allocation and quay crane assignment for the trade-off between service efficiency and operating cost considering carbon emission taxation
  publication-title: Transp Sci
  doi: 10.1287/trsc.2019.0946
– ident: CR6
– volume: 17
  start-page: 464
  year: 2015
  end-page: 492
  ident: CR3
  article-title: Minimizing delay of ships in bulk terminals by simultaneous ship scheduling, stockyard planning and train scheduling
  publication-title: Marit Econ Logist
  doi: 10.1057/mel.2014.20
– volume: 6
  start-page: 182
  issue: 2
  year: 2002
  end-page: 197
  ident: CR13
  article-title: A fast and elitist multiobjective genetic algorithm: Nsga-ii
  publication-title: IEEE Trans Evol Comput
  doi: 10.1109/4235.996017
– year: 2001
  ident: CR39
  article-title: Spea 2: Improving the strength pareto evolutionary algorithm
  publication-title: TIK Report
  doi: 10.3929/ethz-a-004284029
– volume: 11
  start-page: 712
  issue: 6
  year: 2007
  end-page: 731
  ident: CR37
  article-title: Moea/d: a multiobjective evolutionary algorithm based on decomposition
  publication-title: IEEE Trans Evol Comput
  doi: 10.1109/TEVC.2007.892759
– volume: 37
  start-page: 437
  issue: 5
  year: 2003
  end-page: 457
  ident: CR19
  article-title: Berth allocation with service priority
  publication-title: Transport Res Part B
  doi: 10.1016/S0191-2615(02)00023-1
– volume: 31
  start-page: 75
  issue: 1
  year: 1997
  end-page: 94
  ident: CR17
  article-title: Efficient planning of berth allocation for container terminals in Asia
  publication-title: J Adv Transp
  doi: 10.1002/atr.5670310107
– volume: 143
  start-page: 23
  year: 2021
  end-page: 47
  ident: CR21
  article-title: Integrated planning of berth allocation and vessel sequencing in a seaport with one-way navigation channel
  publication-title: Transp Res Part B
  doi: 10.1016/j.trb.2020.10.010
– volume: 19
  start-page: 563
  year: 2016
  end-page: 582
  ident: CR2
  article-title: A reclaimer scheduling problem arising in coal stockyard management
  publication-title: J Sched
  doi: 10.1007/s10951-015-0436-y
– volume: 15
  start-page: 1326
  issue: 3
  year: 2018
  end-page: 1336
  ident: CR35
  article-title: A hybrid dynamical approach for allocating materials in a dry bulk terminal
  publication-title: IEEE Trans Autom Sci Eng
  doi: 10.1109/TASE.2017.2784483
– volume: 303
  start-page: 501
  issue: 2
  year: 2022
  end-page: 524
  ident: CR27
  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: CR38
– volume: 20
  start-page: 209
  issue: 01
  year: 2011
  end-page: 219
  ident: CR15
  article-title: A dynamic polynomial mutation for evolutionary multi-objective optimization algorithms
  publication-title: Int J Artif Intell Tools
  doi: 10.1142/S0218213011000097
– volume: 2479
  start-page: 49
  issue: 1
  year: 2015
  end-page: 59
  ident: CR20
  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
– volume: 55
  start-page: 8997
  year: 2023
  end-page: 9018
  ident: CR28
  article-title: Switching-like event-triggered state estimation for reaction-diffusion neural networks against dos attacks
  publication-title: Neural Process Lett
  doi: 10.1007/s11063-023-11189-1
– volume: 87
  start-page: 170
  year: 2017
  end-page: 182
  ident: CR11
  article-title: A machine learning-based system for berth scheduling at bulk terminals
  publication-title: Expert Syst Appl
  doi: 10.1016/j.eswa.2017.06.010
– volume: 35
  start-page: 401
  issue: 4
  year: 2001
  end-page: 417
  ident: CR18
  article-title: The dynamic berth allocation problem for a container port
  publication-title: Transport Res Part B
  doi: 10.1016/S0191-2615(99)00057-0
– volume: 126
  start-page: 196
  year: 2018
  end-page: 216
  ident: CR34
  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
– year: 2022
  ident: CR9
  article-title: Disruption management approaches for berth scheduling in bulk terminals
  publication-title: J Adv Transp
  doi: 10.1155/2022/8069796
– volume: 29
  start-page: 39
  issue: 1
  year: 2023
  end-page: 76
  ident: CR10
  article-title: A column generation-based heuristic to solve the integrated planning, scheduling, yard allocation and berth allocation problem in bulk ports
  publication-title: J Heuristics
  doi: 10.1007/s10732-022-09506-3
– volume: 254
  start-page: 985
  issue: 3
  year: 2016
  end-page: 1001
  ident: CR30
  article-title: Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals
  publication-title: Eur J Oper Res
  doi: 10.1016/j.ejor.2016.04.022
– ident: CR7
– volume: 126
  start-page: 103
  year: 2019
  end-page: 121
  ident: CR31
  article-title: An exact algorithm for integrated planning of operations in dry bulk terminals
  publication-title: Transp Res Part E
  doi: 10.1016/j.tre.2019.03.018
– volume: 104
  start-page: 102455
  year: 2021
  ident: CR33
  article-title: An almost robust optimization model for integrated berth allocation and quay crane assignment problem
  publication-title: Omega
  doi: 10.1016/j.omega.2021.102455
– volume: 131
  start-page: 282
  issue: 2
  year: 2001
  end-page: 292
  ident: CR22
  article-title: Berth allocation planning in the public berth system by genetic algorithms
  publication-title: Eur J Oper Res
  doi: 10.1016/S0377-2217(00)00128-4
– volume: 9
  start-page: 7451
  issue: 6
  year: 2023
  end-page: 7460
  ident: CR24
  article-title: Hysteresis quantified control for switched reaction-diffusion systems and its application
  publication-title: Complex Intell Syst
  doi: 10.1007/s40747-023-01135-y
– volume: 153
  start-page: 106174
  year: 2023
  ident: CR8
  article-title: Exact and metaheuristic approaches to solve the integrated production scheduling, berth allocation and storage yard allocation problem
  publication-title: Comput Oper Res
  doi: 10.1016/j.cor.2023.106174
– volume: 20
  start-page: 459
  year: 2017
  end-page: 473
  ident: CR14
  article-title: Mathematical models for the berth allocation problem in dry bulk terminals
  publication-title: J Sched
  doi: 10.1007/s10951-017-0510-8
– volume: 38
  start-page: 14136
  issue: 11
  year: 2011
  end-page: 14147
  ident: CR25
  article-title: An enriched model for the integrated berth allocation and quay crane assignment problem
  publication-title: Expert Syst Appl
  doi: 10.1016/j.eswa.2011.04.224
– volume: 51
  start-page: 390
  issue: 3
  year: 2019
  end-page: 411
  ident: CR36
  article-title: A genetic algorithm based on spatiotemporal conflict between continuous berth-allocation and time-varying specific crane assignment
  publication-title: Eng Optim
  doi: 10.1080/0305215X.2018.1473390
– volume: 153
  start-page: 106174
  year: 2023
  ident: 1452_CR8
  publication-title: Comput Oper Res
  doi: 10.1016/j.cor.2023.106174
– volume: 104
  start-page: 102455
  year: 2021
  ident: 1452_CR33
  publication-title: Omega
  doi: 10.1016/j.omega.2021.102455
– ident: 1452_CR6
  doi: 10.1145/1570256.1570387
– volume: 131
  start-page: 282
  issue: 2
  year: 2001
  ident: 1452_CR22
  publication-title: Eur J Oper Res
  doi: 10.1016/S0377-2217(00)00128-4
– volume: 134
  start-page: 101856
  year: 2020
  ident: 1452_CR29
  publication-title: Transp Res Part E
  doi: 10.1016/j.tre.2020.101856
– volume: 6
  start-page: 182
  issue: 2
  year: 2002
  ident: 1452_CR13
  publication-title: IEEE Trans Evol Comput
  doi: 10.1109/4235.996017
– volume: 126
  start-page: 196
  year: 2018
  ident: 1452_CR34
  publication-title: Comput Ind Eng
  doi: 10.1016/j.cie.2018.09.033
– volume: 87
  start-page: 170
  year: 2017
  ident: 1452_CR11
  publication-title: Expert Syst Appl
  doi: 10.1016/j.eswa.2017.06.010
– volume: 37
  start-page: 437
  issue: 5
  year: 2003
  ident: 1452_CR19
  publication-title: Transport Res Part B
  doi: 10.1016/S0191-2615(02)00023-1
– volume: 126
  start-page: 103
  year: 2019
  ident: 1452_CR31
  publication-title: Transp Res Part E
  doi: 10.1016/j.tre.2019.03.018
– ident: 1452_CR12
  doi: 10.1007/978-3-030-87672-2
– volume: 15
  start-page: 1326
  issue: 3
  year: 2018
  ident: 1452_CR35
  publication-title: IEEE Trans Autom Sci Eng
  doi: 10.1109/TASE.2017.2784483
– volume: 291
  start-page: 435
  year: 2020
  ident: 1452_CR1
  publication-title: Ann Oper Res
  doi: 10.1007/s10479-018-3125-3
– volume: 32
  start-page: 593
  year: 2010
  ident: 1452_CR23
  publication-title: OR Spectrum
  doi: 10.1007/s00291-010-0209-0
– volume: 11
  start-page: 712
  issue: 6
  year: 2007
  ident: 1452_CR37
  publication-title: IEEE Trans Evol Comput
  doi: 10.1109/TEVC.2007.892759
– volume: 254
  start-page: 985
  issue: 3
  year: 2016
  ident: 1452_CR30
  publication-title: Eur J Oper Res
  doi: 10.1016/j.ejor.2016.04.022
– year: 2022
  ident: 1452_CR9
  publication-title: J Adv Transp
  doi: 10.1155/2022/8069796
– volume: 54
  start-page: 1307
  issue: 5
  year: 2020
  ident: 1452_CR32
  publication-title: Transp Sci
  doi: 10.1287/trsc.2019.0946
– volume: 19
  start-page: 563
  year: 2016
  ident: 1452_CR2
  publication-title: J Sched
  doi: 10.1007/s10951-015-0436-y
– ident: 1452_CR7
  doi: 10.1109/FITME.2010.5655783
– volume: 43
  start-page: 1285
  issue: 3
  year: 2022
  ident: 1452_CR16
  publication-title: Comput Syst Sci Eng
  doi: 10.32604/csse.2022.029230
– volume: 2479
  start-page: 49
  issue: 1
  year: 2015
  ident: 1452_CR20
  publication-title: Transp Res Rec
  doi: 10.3141/2479-07
– volume: 20
  start-page: 209
  issue: 01
  year: 2011
  ident: 1452_CR15
  publication-title: Int J Artif Intell Tools
  doi: 10.1142/S0218213011000097
– volume: 31
  start-page: 75
  issue: 1
  year: 1997
  ident: 1452_CR17
  publication-title: J Adv Transp
  doi: 10.1002/atr.5670310107
– volume: 303
  start-page: 501
  issue: 2
  year: 2022
  ident: 1452_CR27
  publication-title: Eur J Oper Res
  doi: 10.1016/j.ejor.2021.12.040
– volume: 51
  start-page: 390
  issue: 3
  year: 2019
  ident: 1452_CR36
  publication-title: Eng Optim
  doi: 10.1080/0305215X.2018.1473390
– volume: 55
  start-page: 8997
  year: 2023
  ident: 1452_CR28
  publication-title: Neural Process Lett
  doi: 10.1007/s11063-023-11189-1
– volume: 17
  start-page: 464
  year: 2015
  ident: 1452_CR3
  publication-title: Marit Econ Logist
  doi: 10.1057/mel.2014.20
– volume: 38
  start-page: 14136
  issue: 11
  year: 2011
  ident: 1452_CR25
  publication-title: Expert Syst Appl
  doi: 10.1016/j.eswa.2011.04.224
– volume: 130
  start-page: 105224
  year: 2021
  ident: 1452_CR5
  publication-title: Comput Oper Res
  doi: 10.1016/j.cor.2021.105224
– year: 2001
  ident: 1452_CR39
  publication-title: TIK Report
  doi: 10.3929/ethz-a-004284029
– volume: 143
  start-page: 23
  year: 2021
  ident: 1452_CR21
  publication-title: Transp Res Part B
  doi: 10.1016/j.trb.2020.10.010
– ident: 1452_CR4
  doi: 10.1007/978-3-030-57993-7-29
– volume: 20
  start-page: 459
  year: 2017
  ident: 1452_CR14
  publication-title: J Sched
  doi: 10.1007/s10951-017-0510-8
– volume: 295
  start-page: 499
  issue: 2
  year: 2021
  ident: 1452_CR26
  publication-title: Eur J Oper Res
  doi: 10.1016/j.ejor.2021.03.016
– volume: 9
  start-page: 7451
  issue: 6
  year: 2023
  ident: 1452_CR24
  publication-title: Complex Intell Syst
  doi: 10.1007/s40747-023-01135-y
– volume: 29
  start-page: 39
  issue: 1
  year: 2023
  ident: 1452_CR10
  publication-title: J Heuristics
  doi: 10.1007/s10732-022-09506-3
– volume: 35
  start-page: 401
  issue: 4
  year: 2001
  ident: 1452_CR18
  publication-title: Transport Res Part B
  doi: 10.1016/S0191-2615(99)00057-0
– ident: 1452_CR38
  doi: 10.1002/acs.3529
SSID ssj0001778302
ssib044733412
ssib045327741
Score 2.289798
Snippet This paper presents a chaotic optimal thermodynamic evolutionary algorithm (COTEA) designed to address the integrated scheduling problems of berth allocation,...
Abstract This paper presents a chaotic optimal thermodynamic evolutionary algorithm (COTEA) designed to address the integrated scheduling problems of berth...
SourceID doaj
proquest
crossref
springer
SourceType Open Website
Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 7435
SubjectTerms Berth allocation
Bulk cargo
Bulk terminal
Chaotic-optimal thermodynamic evolutionary algorithm
Complexity
Computational Intelligence
Crane schedule
Data Structures and Information Theory
Engineering
Evolutionary algorithms
Genetic algorithms
Multiple objective analysis
Optimization
Original Article
Scheduling
Ship terminals
Solution space
Stockyard allocation
Thermodynamics
SummonAdditionalLinks – databaseName: DOAJ Directory of Open Access Journals
  dbid: DOA
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1Lb9QwELZQxQEOiPIQ2wfygRtYxI4dx8e2ogIJKg6AeosmfrQV2aTKplvx7zt2smmLBFw45JJMIscz9jfjsb8h5I0CoYtax6w_DnIpnWYAWWAQVPACcghpKfvHZ31yUp6emq93Sn3FPWEjPfDYce9toTzoHJQxTlpbgEHQDCUiVQie8-QaZdrcCabQkqTUeS5vgVuqXOhNjZm0-qJ1JL6Klee4MUymHObOfK5ORlp5hvDFYtZNsOt7qJXI_e95pL8lURM2HT8lTyankh6MP7NNHvj2GXn8ZWZkXT0nl59m7s2B1lfNT2qhP-votBmmoRjlIurEw-k0IpujXUuBtt3aN9SeQ4efYR3OL0uUjU7jsnNjMXvq15P5Qv-LQnPW9RfD-fIF-X784dvRRzZVW2BWZWJgsQyP5NqCkQ44cF8ovHwkICxEPI_rrbCQZS6zWekiUVcBOBlgwFEHY33IX5Kttmv9K0JB5MGFIJ2SUtZc1so4Y9GZweDOOhEWhG96s7ITFXmsiNFUM4ly0kCFGqiSBqrrBXk7v3M5EnH8VfowKmmWjCTa6QaaVjWZVvUv01qQvY2Kq2lkr6qco8uHMXFZLsi7jdpvH_-5STv_o0m75JGIZpn20-yRraG_8vvkoV0PF6v-dRoDN-PkBSk
  priority: 102
  providerName: Directory of Open Access Journals
– databaseName: Springer Nature OA Free Journals
  dbid: C24
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1Lb9QwELagcIADb8SWgnzgBpZix07iI1RUIEHFAVBv1sSP7arZuMqmW_XfY7tOSpGKBIcckkyixB7PwzPzDUJvBLC6ausY9Q-LnHNTE4DCEXDCWQYluLSV_fNLfXjYHB3Jb7kobDNlu08hySSp52I3HrHeSdApJIbCGDm_je4I2siYyLd_hTnOeV2WPCvttNNS1xHkKnaZo1ISnuKVuze_9pqGSkD-16zPPwKmSQ8dPPy_P3iEHmS7E7-_ZJTH6Jbtn6D7v6ERhrOvM4Tr5ik6_TyDdY64PetOsIZh6XHOnulwcIuDmorV7DiqQoN9jwH3fms7rI_Bh9cQHwTSOtBGK3PtzUUP65XGdpv5HYYLDN3SD6vxeP0M_Tj4-H3_E8ntGYgWBRtJ7NvDaa1BcgMUqK1EOGxELKxYLOC1mmkoClPoojER2auCID2Ch9I6qa0rn6Od3vf2BcLASmec40ZwzlvKWyGN1MH6Cd6gNswtEJ2mROmMXR5baHRqRl1OY6vC2Ko0tup8gd7Oz5xeInf8lfpDnOmZMqJupwt-WKq8iJWuhIW6BCGl4VpXIIMB55pgNTlnKYUF2pv4RGVRsFElDTZicKKbZoHeTXxxdfvmT9r9N_KX6B6LrJVSbfbQzjic2Vfort6Oq83wOi2RX6d4Cc4
  priority: 102
  providerName: Springer Nature
Title Intelligent bulk cargo terminal scheduling based on a novel chaotic-optimal thermodynamic evolutionary algorithm
URI https://link.springer.com/article/10.1007/s40747-024-01452-w
https://www.proquest.com/docview/3117209488
https://doaj.org/article/c65ea73a599d4cc6a9065f8215ffe11a
Volume 10
WOSCitedRecordID wos001271465500002&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: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 2198-6053
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001778302
  issn: 2199-4536
  databaseCode: DOA
  dateStart: 20150101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources (ISSN International Center)
  customDbUrl:
  eissn: 2198-6053
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssib044733412
  issn: 2199-4536
  databaseCode: M~E
  dateStart: 20150101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
– providerCode: PRVPQU
  databaseName: Advanced Technologies & Aerospace Database
  customDbUrl:
  eissn: 2198-6053
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001778302
  issn: 2199-4536
  databaseCode: P5Z
  dateStart: 20151201
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central Database Suite (ProQuest)
  customDbUrl:
  eissn: 2198-6053
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001778302
  issn: 2199-4536
  databaseCode: BENPR
  dateStart: 20151201
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Publicly Available Content Database
  customDbUrl:
  eissn: 2198-6053
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001778302
  issn: 2199-4536
  databaseCode: PIMPY
  dateStart: 20151201
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/publiccontent
  providerName: ProQuest
– providerCode: PRVAVX
  databaseName: Springer Nature OA Free Journals
  customDbUrl:
  eissn: 2198-6053
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001778302
  issn: 2199-4536
  databaseCode: C24
  dateStart: 20151201
  isFulltext: true
  titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22
  providerName: Springer Nature
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb9QwELZoywEOvCu2lJUP3MAicZw4OSFataISXUUIUOESTfzYVmSTJZtu1X-Px02yKhK9cMgldixH856xvyHkTQxcJqXEqr8TciG0ZACBZWBjazhEYH0q-_tnOZulZ2dZ3ifcVv2xykEnekWtG4U58vdR6Eyti0XS9MPyN8OuUVhd7VtobJEdREnA1g15_HPgJyFkFImN-RZxxOXQacbnYKRE-CvsPxdmGRO-krk33q4TCC7PnBFjWHvj7OqW7fIQ_7f80r9Kqd5CHT_-3397Qh71vin9eMNMT8k9Uz8jD09HYNfVc7I8GSE8O1peVr-ognbe0P5MTUVdsOyMF95xp2ggNW1qCrRu1qai6hwatwxrnJpauLnoey4afV3D4kJRs-6lANprCtXcbbA7X7wg346Pvh5-Yn3TBqbigHcMu_mIUCrIhIYQQpPE7jGIY5hwvNZrFFcQBDpQQaoR7ysBp1Nc3FLaTBkb7ZLtuqnNS0KBR1ZbK3QshChDUcaZzpTziVyMqDS3ExIO5ChUj2iOjTWqYsRi9iQsHAkLT8LiakLejt8sb_A87px9gFQeZyIWt3_RtPOiF-1CJbEBGUGcZVoolUDm3DqbOn601oQhTMj-QPWiVxCrYkPyCXk38M1m-N9b2rt7tVfkAUeO9Qdu9sl2116a1-S-WncXq3ZKdg6OZvmXKdk65GLq8w9TLzJuJD85zX_8AWOYF9U
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9NAEB6VFAk48EakFNgDnGCFvV7b8QEhXlWjJlEOBZWTO95HWpHYIUkT5U_xG9lxbEdForceOPhir1f27jez3-7sfgPwKkQRR1lMUX9n5FLqmCN6lqMNrREYoC2Xsr_34sGgc3KSDHfgd30WhrZV1j6xdNS6ULRG_i7w3VDr5iKdzofpL05Zoyi6WqfQ2MDiyKxXbso2f9_94vr3tRAHX48_H_IqqwBXoScWnNLNSD9WmEiNPvomCt1lSGgvEnTu1Cih0PO0p7yOJkGqCB3oHbHObKKMDVy9N2BXEthbsDvs9oc_agRLGQeB3BIGGQYirnPblKs-cUyCW5Txzk8SLsvY6V5znk-SnD13wyanaJ_gq0ujZZlU4BIT_it4W46JB_f-t9a8D3cr9s0-bszlAeyY_CHc6TfStfNHMO02IqULll2MfzKFs1HBql1DYzZ3MNe0f3_EiAJoVuQMWV4szZipMyxcNbxwjnjiyhK7nhR6nePkXDGzrOwcZ2uG45FrkMXZ5DF8u5ZffgKtvMjNU2AoAqutlTqUUma-zMJEJ8qxPjcLVlrYNvh196eq0myn1CHjtFGbLiGTOsikJWTSVRveNO9MN4olV5b-RKhqSpLaeHmjmI3SynmlKgoNxgGGSaKlUhEmjrjajmOL1hrfxzbs1yhLKxc4T7cQa8PbGqfbx__-pL2ra3sJtw6P-7201x0cPYPbgqyl3F60D63F7MI8h5tquTifz15Uxsng9LoR_Aekzm6a
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb9QwELagIASH8ipi2wI-cAOrceI8fITCioqy6gFQb9bEj-2KbLLKplv13-PxZtMWqUiIQw5JJpZjz3hmPJ5vCHmbQpxnZY5Rfy_kQpicAUSOgUudjSEBF7ayfx7nk0lxeipPrmXxh9Pum5DkOqcBUZrq7mBh3MGQ-CYQ9515_cIwLBazi7vkHkakkMcPr_DHhciTRPQKPOy65DkCXmHFOS4lEyF2uXt7sze0VQD1v2GJ_hE8DTpp_Pj__-YJ2e7tUfphzUBPyR1bPyOPrqEU-rtvA7Tr8jlZHA0gnh0tz6tfVEM7bWh_qqai3l326guz3CmqSEObmgKtm5WtqD6DxjfDGr9QzT0tWp_zxlzWMJ9pale9HEB7SaGaNu2sO5vvkB_jz98Pv7C-bAPTaRR3DOv5CJ5rkMIAB26z1F8WkQyzGBN7rY41RJGJdFQYRPzKwK8q3nMpndTWJS_IVt3U9iWhECfOOCdMKoQouShTaaT2VpH3ErWJ3YjwzfQo3WOaY2mNSg1ozGFslR9bFcZWXYzIu-GbxRrR46_UH3HWB0pE4w4PmnaqeuFWOkst5AmkUhqhdQbSG3au8NaUc5ZzGJH9Dc-ofolYqoR729E710UxIu83PHL1-vYu7f4b-Rvy4OTTWB0fTb7ukYcxclk4jbNPtrr23L4i9_Wqmy3b10FyfgMjaxWX
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=Intelligent+bulk+cargo+terminal+scheduling+based+on+a+novel+chaotic-optimal+thermodynamic+evolutionary+algorithm&rft.jtitle=Complex+%26+intelligent+systems&rft.au=Liu%2C+Shida&rft.au=Liu%2C+Qingsheng&rft.au=Wang%2C+Li&rft.au=Chen%2C+Xianlong&rft.date=2024-12-01&rft.pub=Springer+Nature+B.V&rft.issn=2199-4536&rft.eissn=2198-6053&rft.volume=10&rft.issue=6&rft.spage=7435&rft.epage=7450&rft_id=info:doi/10.1007%2Fs40747-024-01452-w
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2199-4536&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2199-4536&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2199-4536&client=summon