A LAGRANGIAN RELAXATION-BASED ALGORITHM FOR THE ALLOCATION OF YARD CRANES FOR YARD ACTIVITIES WITH DIFFERENT PRIORITIES

This paper proposes a mixed integer programming model for the allocation of rail mounted gantry cranes for four basic yard activities with different priorities. The model pays special attention to the typical features of this kind of gantry cranes, such as a restricted traveling range and a limited...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of systems science and systems engineering Vol. 22; no. 2; pp. 227 - 252
Main Authors:	Zhang, Canrong, Wu, Tao, Zheng, Li, Miao, Lixin
Format:	Journal Article
Language:	English
Published:	Heidelberg SP Systems Engineering Society of China 01.06.2013 Springer Springer Nature B.V Department of Industrial Engineering, Tsinghua University, Beijing 10084, China%Business Analytics and Optimization, University of Phoenix, Apollo Group, Inc., Phoenix, AZ 85040, U.S.A.%Department of Industrial Engineering, Tsinghua University, Beijing 10084, China%Logistics Engineering and Simulation Laboratory, Graduate School at Shenzhen, Tsinghua University, Shenzhen 518055, China Logistics Engineering and Simulation Laboratory, Graduate School at Shenzhen, Tsinghua University, Shenzhen 518055, China
Subjects:	Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Branch and bound methods Complexity Computer science; control theory; systems Economic Theory/Quantitative Economics/Mathematical Methods Engineering Exact sciences and technology Gantry cranes Ground, air and sea transportation, marine construction Heuristic Integer programming Marine and water way transportation and traffic Mathematical programming Mixed integer NP-hard Operational research and scientific management Operational research. Management science Operations Research/Decision Theory Priorities Theoretical computing 业务分配优先级启发式算法堆场拉格朗日松弛算法混合整数规划模型龙门起重机 Crane allocation container terminal sub-gradient Lagrangian relaxation yard crane Program library Branch and bound method Priority Port terminal Competitiveness Gantry crane Software package Activity Mixed integer programming Crane Computational complexity Modeling Lagrange multiplier Rail Heuristic method NP hard problem Container transportation Relaxation method
ISSN:	1004-3756, 1861-9576
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	This paper proposes a mixed integer programming model for the allocation of rail mounted gantry cranes for four basic yard activities with different priorities. The model pays special attention to the typical features of this kind of gantry cranes, such as a restricted traveling range and a limited number of adjustments during loading and discharging operations. In contrast to most of the literature dealing with these four yard activities individually, this paper models them into an integrated problem, whose computational complexity is proved to be NP-hard. We are therefore motivated to develop a Lagrangian relaxation-based heuristic to solve the problem. We compare the proposed heuristic with the branch-and-bound method that uses commercial software packages. Extensive computational results show that the proposed heuristic achieves competitive solution qualities for solving the tested problems.
AbstractList	This paper proposes a mixed integer programming model for the allocation of rail mounted gantry cranes for four basic yard activities with different priorities. The model pays special attention to the typical features of this kind of gantry cranes, such as a restricted traveling range and a limited number of adjustments during loading and discharging operations. In contrast to most of the literature dealing with these four yard activities individually, this paper models them into an integrated problem, whose computational complexity is proved to be NP-hard. We are therefore motivated to develop a Lagrangian relaxation-based heuristic to solve the problem. We compare the proposed heuristic with the branch-and-bound method that uses commercial software packages. Extensive computational results show that the proposed heuristic achieves competitive solution qualities for solving the tested problems.
Author	Canrong ZHANG Tao WU LiZHENG Lixin MIAO
AuthorAffiliation	Logistics Engineering and Simulation Laboratory, Graduate School at Shenzhen, Tsinghua University, Shenzhen 518055, China Business Analytics and Optimization, University of Phoenix, Apollo Group, Inc., Phoenix, AZ 85040, U.S.A. Department of lndustrial Engineering, Tsinghua University, Beijing 10084, China
AuthorAffiliation_xml	– name: Logistics Engineering and Simulation Laboratory, Graduate School at Shenzhen, Tsinghua University, Shenzhen 518055, China;Department of Industrial Engineering, Tsinghua University, Beijing 10084, China%Business Analytics and Optimization, University of Phoenix, Apollo Group, Inc., Phoenix, AZ 85040, U.S.A.%Department of Industrial Engineering, Tsinghua University, Beijing 10084, China%Logistics Engineering and Simulation Laboratory, Graduate School at Shenzhen, Tsinghua University, Shenzhen 518055, China
Author_xml	– sequence: 1 givenname: Canrong surname: Zhang fullname: Zhang, Canrong organization: Logistics Engineering and Simulation Laboratory, Graduate School at Shenzhen, Tsinghua University, Department of Industrial Engineering, Tsinghua University – sequence: 2 givenname: Tao surname: Wu fullname: Wu, Tao organization: Business Analytics and Optimization, University of Phoenix, Apollo Group, Inc – sequence: 3 givenname: Li surname: Zheng fullname: Zheng, Li organization: Department of Industrial Engineering, Tsinghua University – sequence: 4 givenname: Lixin surname: Miao fullname: Miao, Lixin email: lxmiao@tsinghua.edu.cn organization: Logistics Engineering and Simulation Laboratory, Graduate School at Shenzhen, Tsinghua University
BackLink	http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=27541240$$DView record in Pascal Francis
BookMark	eNp9kV1v0zAUhiM0JLbBD-DOCHGZ4ePP9NKkSRspNCgLX1eW4yWlo0u2ONO6f4_bFCZxsSvbx8_zHsvnLDjp-q4JgreALwBj-dEBcIhCDDTkBHgYvQhOIRIQzrgUJ36PMQup5OJVcObcNcZUzACfBg8K5WpRqtUiUytUJrn6oaqsWIWf1GUyRypfFGVWLT-jtChRtUx8JS_iA4KKFP1U5RzFXk8uD8ThrOIq-5ZVma999y6aZ2malMmqQl_KbB_nb14HL1uzdc2b43oefE2TKl6GebHIYpWHlgGMIVzVpOaADbvCuLacG04iy6ltGUQgCbMEQ13jlpmaE2Ej3EYgiJGWUrCyoefBxZT7YLrWdGt93d8Pne-od-Pv3eNuXNtdrRufQjHBWHjh_STcDv3dfePGJ4PM_I8KKmfUUx-OlHHWbNvBdHbj9O2wuTHDoyaSMyAMe05OnB1654am1XYzmnHTd-NgNlsNWO_Hp6fxaf8KvR-fjrwJ_5l_w59zyOQ4z3brZnh6-3PSu2OjX323vvPev05MMBYJSegfeaKuAg
CitedBy_id	crossref_primary_10_1080_0305215X_2016_1170826 crossref_primary_10_1007_s11518_023_5563_y crossref_primary_10_1016_j_cor_2014_06_012
Cites_doi	10.1007/s00291-007-0100-9 10.1142/S0217595911003351 10.1007/s00291-010-0206-3 10.1007/BFb0120690 10.1287/trsc.36.1.79.568 10.1016/j.dss.2003.11.002 10.1142/S0217595909002146 10.1016/S0360-8352(97)00219-2 10.1016/S0377-2217(02)00293-X 10.1287/inte.1040.0120 10.1007/s00291-006-0045-4 10.1287/trsc.33.1.17 10.1007/s00291-008-0127-6 10.1080/07408170304384 10.1007/s00291-003-0157-z 10.1007/s00291-010-0200-9 10.1016/j.ejor.2003.11.025 10.1016/j.ijpe.2006.08.003 10.1016/j.ejor.2009.05.031 10.1016/S0191-2615(01)00017-0 10.1016/S0191-2615(01)00033-9
ContentType	Journal Article
Copyright	Systems Engineering Society of China and Springer-Verlag Berlin Heidelberg 2013 2014 INIST-CNRS Systems Engineering Society of China and Springer-Verlag Berlin Heidelberg 2013. Copyright © Wanfang Data Co. Ltd. All Rights Reserved.
Copyright_xml	– notice: Systems Engineering Society of China and Springer-Verlag Berlin Heidelberg 2013 – notice: 2014 INIST-CNRS – notice: Systems Engineering Society of China and Springer-Verlag Berlin Heidelberg 2013. – notice: Copyright © Wanfang Data Co. Ltd. All Rights Reserved.
DBID	2RA 92L CQIGP ~WA AAYXX CITATION IQODW 8FE 8FG ABJCF AFKRA ARAPS BENPR BGLVJ CCPQU DWQXO HCIFZ L6V M7S P5Z P62 PHGZM PHGZT PKEHL PQEST PQGLB PQQKQ PQUKI PTHSS 2B. 4A8 92I 93N PSX TCJ
DOI	10.1007/s11518-013-5215-8
DatabaseName	维普_期刊中文科技期刊数据库-CALIS站点中文科技期刊数据库-7.0平台中文科技期刊数据库- 镜像站点 CrossRef Pascal-Francis ProQuest SciTech Collection ProQuest Technology Collection Materials Science & Engineering Collection ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central ProQuest Technology Collection ProQuest One ProQuest Central Korea SciTech Collection (ProQuest) ProQuest Engineering Collection Engineering Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic (New) 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 Engineering Collection Wanfang Data Journals - Hong Kong WANFANG Data Centre Wanfang Data Journals 万方数据期刊 - 香港版 China Online Journals (COJ) China Online Journals (COJ)
DatabaseTitle	CrossRef Advanced Technologies & Aerospace Collection Engineering Database Technology Collection ProQuest One Academic Middle East (New) ProQuest Advanced Technologies & Aerospace Collection ProQuest One Academic Eastern Edition SciTech Premium Collection ProQuest One Community College ProQuest Technology Collection ProQuest SciTech Collection ProQuest Central Advanced Technologies & Aerospace Database ProQuest One Applied & Life Sciences ProQuest Engineering Collection ProQuest One Academic UKI Edition ProQuest Central Korea Materials Science & Engineering Collection ProQuest Central (New) ProQuest One Academic ProQuest One Academic (New) Engineering Collection
DatabaseTitleList	Advanced Technologies & Aerospace Collection
Database_xml	– sequence: 1 dbid: P5Z name: Advanced Technologies & Aerospace Database url: https://search.proquest.com/hightechjournals sourceTypes: Aggregation Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Applied Sciences
DocumentTitleAlternate	A LAGRANGIAN RELAXATION-BASED ALGORITHM FOR THE ALLOCATION OF YARD CRANES FOR YARD ACTIVITIES WITH DIFFERENT PRIORITIES
EISSN	1861-9576
EndPage	252
ExternalDocumentID	xtkxyxtgcxb_e201302006 27541240 10_1007_s11518_013_5215_8 46448672
GrantInformation_xml	– fundername: This research was supported by the National Nature Science Foundation of China under grant numbers 71102011and 51105394,and Guangdong provincial department of science and technology funderid: (Number 2011B090400384)
GroupedDBID	-5B -5G -BR -EM -Y2 -~C .86 .VR 06D 0R~ 0VY 1N0 29L 29~ 2B. 2C. 2J2 2JN 2JY 2KG 2KM 2LR 2RA 2VQ 2~H 30V 4.4 406 408 40D 40E 5GY 5VR 5VS 6NX 8TC 92E 92I 92L 92Q 93N 95- 95. 95~ 96X AAAVM AABHQ AAFGU AAHNG AAIAL AAJKR AANZL AARHV AARTL AATNV AATVU AAUYE AAWCG AAYFA AAYIU AAYQN AAYTO ABBBX ABDZT ABECU ABFGW ABFTD ABFTV ABHQN ABJCF ABJNI ABJOX ABKAS ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABSXP ABTEG ABTHY ABTKH ABTMW ABWNU ABXPI ACAOD ACBMV ACBRV ACBXY ACBYP ACGFO ACGFS ACHSB ACHXU ACIGE ACIPQ ACKNC ACMDZ ACMLO ACOKC ACOMO ACREN ACSNA ACTTH ACVWB ACWMK ACZOJ ADHHG ADHIR ADINQ ADKNI ADKPE ADMDM ADOXG ADRFC ADTPH ADURQ ADYFF ADYOE ADZKW AEBTG AEFTE AEGAL AEGNC AEJHL AEJRE AEKMD AENEX AEOHA AEPYU AESKC AESTI AETLH AEVLU AEVTX AEXYK AFGCZ AFKRA AFLOW AFNRJ AFQWF AFUIB AFWTZ AFYQB AFZKB AGAYW AGDGC AGGBP AGJBK AGMZJ AGQMX AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AIAKS AIIXL AILAN AIMYW AITGF AJBLW AJDOV AJRNO AKQUC ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMTXH AMXSW AMYLF AMYQR AOCGG ARAPS ARMRJ AXYYD B-. BA0 BDATZ BENPR BGLVJ BGNMA CAG CCEZO CCVFK CHBEP COF CQIGP CS3 CSCUP CW9 DDRTE DNIVK DPUIP DU5 EBLON EBS EIOEI EJD ESBYG FA0 FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 HCIFZ HF~ HG6 HLICF HMJXF HRMNR HVGLF HZ~ H~9 IHE IJ- IKXTQ IWAJR IXD I~X I~Z J-C JBSCW JZLTJ KOV LLZTM M4Y M7S MA- N2Q NPVJJ NQJWS NU0 O9- O9J P2P P9P PF0 PT4 PTHSS QOS R89 R9I REI ROL RPX RSV S16 S1Z S27 S3B SAP SCL SDH SEG SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 TCJ TGP TSG TUC U2A UG4 UNUBA UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z7R Z7X ZMTXR ~A9 ~WA -SA -S~ 5XA 5XB AACDK AAJBT AASML AAXDM AAYZH ABAKF ABQSL ACDTI ACPIV AEFQL AEMSY AFBBN AGQEE AGRTI AIGIU BSONS CAJEA CCPQU H13 Q-- U1G U5K AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG AEZWR AFDZB AFFHD AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION PHGZM PHGZT PQGLB ADTIX CDYEO IPNFZ IQODW XXP 8FE 8FG DWQXO L6V P62 PKEHL PQEST PQQKQ PQUKI 4A8 ACMFV PMFND PSX
ID	FETCH-LOGICAL-c411t-1db2b510a4d00bc55a528c53cf4181724c201bb0f4ab526c80f8162a7c331c7e3
IEDL.DBID	M7S
ISICitedReferencesCount	3
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000320987100006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1004-3756
IngestDate	Thu May 29 04:13:37 EDT 2025 Wed Nov 05 03:06:46 EST 2025 Fri Nov 25 01:07:30 EST 2022 Tue Nov 18 21:07:25 EST 2025 Sat Nov 29 01:40:56 EST 2025 Fri Feb 21 02:32:54 EST 2025 Wed Feb 14 10:41:12 EST 2024
IsPeerReviewed	true
IsScholarly	true
Issue	2
Keywords	Crane allocation container terminal sub-gradient Lagrangian relaxation yard crane Program library Branch and bound method Priority Port terminal Competitiveness Gantry crane Software package Activity Mixed integer programming Crane Computational complexity Modeling Lagrange multiplier Rail Heuristic method NP hard problem Container transportation Relaxation method
Language	English
License	http://www.springer.com/tdm CC BY 4.0
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c411t-1db2b510a4d00bc55a528c53cf4181724c201bb0f4ab526c80f8162a7c331c7e3
Notes	Crane allocation, container terminal, Lagrangian relaxation, sub-gradient, yard crane 11-2983/N This paper proposes a mixed integer programming model for the allocation of rail mounted gantry cranes for four basic yard activities with different priorities. The model pays special attention to the typical features of this kind of gantry cranes, such as a restricted traveling range and a limited number of adjustments during loading and discharging operations. In contrast to most of the literature dealing with these four yard activities individually, this paper models them into an integrated problem, whose computational complexity is proved to be NP-hard. We are therefore motivated to develop a Lagrangian relaxation-based heuristic to solve the problem. We compare the proposed heuristic with the branch-and-bound method that uses commercial software packages. Extensive computational results show that the proposed heuristic achieves competitive solution qualities for solving the tested problems. ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
PQID	2918663793
PQPubID	2044147
PageCount	26
ParticipantIDs	wanfang_journals_xtkxyxtgcxb_e201302006 proquest_journals_2918663793 pascalfrancis_primary_27541240 crossref_citationtrail_10_1007_s11518_013_5215_8 crossref_primary_10_1007_s11518_013_5215_8 springer_journals_10_1007_s11518_013_5215_8 chongqing_primary_46448672
PublicationCentury	2000
PublicationDate	2013-06-01
PublicationDateYYYYMMDD	2013-06-01
PublicationDate_xml	– month: 06 year: 2013 text: 2013-06-01 day: 01
PublicationDecade	2010
PublicationPlace	Heidelberg
PublicationPlace_xml	– name: Heidelberg
PublicationTitle	Journal of systems science and systems engineering
PublicationTitleAbbrev	J. Syst. Sci. Syst. Eng
PublicationTitleAlternate	Journal of Systems Science and Systems Engineering
PublicationTitle_FL	Journal of Systems Science and Systems Engineering
PublicationYear	2013
Publisher	SP Systems Engineering Society of China Springer Springer Nature B.V Department of Industrial Engineering, Tsinghua University, Beijing 10084, China%Business Analytics and Optimization, University of Phoenix, Apollo Group, Inc., Phoenix, AZ 85040, U.S.A.%Department of Industrial Engineering, Tsinghua University, Beijing 10084, China%Logistics Engineering and Simulation Laboratory, Graduate School at Shenzhen, Tsinghua University, Shenzhen 518055, China Logistics Engineering and Simulation Laboratory, Graduate School at Shenzhen, Tsinghua University, Shenzhen 518055, China
Publisher_xml	– name: SP Systems Engineering Society of China – name: Springer – name: Springer Nature B.V – name: Logistics Engineering and Simulation Laboratory, Graduate School at Shenzhen, Tsinghua University, Shenzhen 518055, China – name: Department of Industrial Engineering, Tsinghua University, Beijing 10084, China%Business Analytics and Optimization, University of Phoenix, Apollo Group, Inc., Phoenix, AZ 85040, U.S.A.%Department of Industrial Engineering, Tsinghua University, Beijing 10084, China%Logistics Engineering and Simulation Laboratory, Graduate School at Shenzhen, Tsinghua University, Shenzhen 518055, China
References	Cormen, Leiserson, Rivest, Stein (CR3) 2001 Lee, Cao, Meng (CR12) 2007; 107 Bierwirth, Meisel (CR1) 2010; 202 Cheung, Li, Lin (CR2) 2002; 36 Han, Lee, Chew, Tan (CR6) 2008; 30 Dorndorf, Schneider (CR4) 2010; 32 Geoffrion (CR5) 1974; 2 Murty, Liu, Wan, Linn (CR15) 2005; 39 Kim, Kim (CR9) 1997; 33 Linn, Zhang (CR14) 2003; 35 Stahlbock, VoB (CR18) 2008; 30 Zhou, Wu (CR23) 2009; 26 Kim, Kim (CR8) 1999; 33 Ku, Lee, Chew, Tan (CR11) 2010; 32 Zhang, Zhang, Zheng, Miao (CR22) 2011; 28 Kim, Kim (CR10) 1999; 59 Murty, Wan, Liu, Tseng, Leung, Lai, Chiu (CR16) 2005; 35 Kim, Kim (CR7) 2002; 36 Vis, Koster (CR20) 2003; 147 Lee, Chew, Tan, Han (CR13) 2006; 28 Ng (CR17) 2005; 164 Zhang, Wan, Liu, Linn (CR21) 2002; 36 Steenken, VoB, Stahlbock (CR19) 2004; 26 AM Geoffrion (5215_CR5) 1974; 2 KG Murty (5215_CR15) 2005; 39 C Bierwirth (5215_CR1) 2010; 202 U Dorndorf (5215_CR4) 2010; 32 L Lee (5215_CR13) 2006; 28 D Steenken (5215_CR19) 2004; 26 Y Han (5215_CR6) 2008; 30 KG Murty (5215_CR16) 2005; 35 C Zhang (5215_CR21) 2002; 36 KY Kim (5215_CR9) 1997; 33 D Lee (5215_CR12) 2007; 107 IFA Vis (5215_CR20) 2003; 147 TH Cormen (5215_CR3) 2001 C Zhang (5215_CR22) 2011; 28 LP Ku (5215_CR11) 2010; 32 KY Kim (5215_CR10) 1999; 59 R Stahlbock (5215_CR18) 2008; 30 W Zhou (5215_CR23) 2009; 26 RK Cheung (5215_CR2) 2002; 36 KH Kim (5215_CR7) 2002; 36 WC Ng (5215_CR17) 2005; 164 KH Kim (5215_CR8) 1999; 33 RJ Linn (5215_CR14) 2003; 35
References_xml	– volume: 30 start-page: 1 issue: 1 year: 2008 end-page: 52 ident: CR18 article-title: Operations research at container terminals: a literature update publication-title: OR Spectrum doi: 10.1007/s00291-007-0100-9 – volume: 28 start-page: 803 issue: 6 year: 2011 end-page: 829 ident: CR22 article-title: A decision support system for the allocation of yard cranes and blocks in container terminals publication-title: Asia-Pacificc Journal of Operational Research doi: 10.1142/S0217595911003351 – volume: 32 start-page: 617 issue: 3 year: 2010 end-page: 632 ident: CR4 article-title: Scheduling automated triple cross-over stacking cranes in a container yard publication-title: OR Spectrum doi: 10.1007/s00291-010-0206-3 – volume: 2 start-page: 82 year: 1974 end-page: 114 ident: CR5 article-title: Lagrangean relaxation for integer programming publication-title: Mathematical Programming Study doi: 10.1007/BFb0120690 – volume: 36 start-page: 79 issue: 1 year: 2002 end-page: 93 ident: CR2 article-title: Interblock crane deployment in container terminals publication-title: Transportation Science doi: 10.1287/trsc.36.1.79.568 – year: 2001 ident: CR3 publication-title: Introduction to Algorithms – volume: 39 start-page: 309 issue: 3 year: 2005 end-page: 332 ident: CR15 article-title: A decision support system for operations in a container terminal publication-title: Decision Support Systems doi: 10.1016/j.dss.2003.11.002 – volume: 26 start-page: 31 issue: 1 year: 2009 end-page: 58 ident: CR23 article-title: An efficient optimal solution of a two-crane scheduling problem publication-title: Asia-Pacific Journal of Operational Research doi: 10.1142/S0217595909002146 – volume: 33 start-page: 673 issue: 3–4 year: 1997 end-page: 676 ident: CR9 article-title: A routing algorithm for a single transfer crane to load export containers onto a containership publication-title: Computers & Industrial Engineering doi: 10.1016/S0360-8352(97)00219-2 – volume: 147 start-page: 1 issue: 1 year: 2003 end-page: 16 ident: CR20 article-title: Transshipment of containers at a container terminal: an overview publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(02)00293-X – volume: 35 start-page: 61 issue: 1 year: 2005 end-page: 75 ident: CR16 article-title: Hongkong international terminals gains elastic capacity using a data-intensive decision-support system publication-title: Interfaces doi: 10.1287/inte.1040.0120 – volume: 28 start-page: 539 issue: 4 year: 2006 end-page: 561 ident: CR13 article-title: An optimization model for storage yard management in transshipment hubs publication-title: OR Spectrum doi: 10.1007/s00291-006-0045-4 – volume: 33 start-page: 17 issue: 1 year: 1999 end-page: 33 ident: CR8 article-title: An optimal routing algorithm for a transfer crane in port container terminals publication-title: Transportation Science doi: 10.1287/trsc.33.1.17 – volume: 30 start-page: 697 issue: 4 year: 2008 end-page: 720 ident: CR6 article-title: A yard storage strategy for minimizing traffic congestion in a marine container transshipment hub publication-title: OR Spectrum doi: 10.1007/s00291-008-0127-6 – volume: 35 start-page: 161 issue: 2 year: 2003 end-page: 174 ident: CR14 article-title: A heuristic for dynamic yard crane deployment in a container terminal publication-title: IIE Transactions doi: 10.1080/07408170304384 – volume: 26 start-page: 3 issue: 1 year: 2004 end-page: 49 ident: CR19 article-title: Container terminal operation and operations research — a classiffication and literature review publication-title: OR Spectrum doi: 10.1007/s00291-003-0157-z – volume: 32 start-page: 519 issue: 3 year: 2010 end-page: 541 ident: CR11 article-title: An optimisation framework for yard planning in a container terminal: case with automated rail-mounted gantry cranes publication-title: OR Spectrum doi: 10.1007/s00291-010-0200-9 – volume: 164 start-page: 64 issue: 1 year: 2005 end-page: 78 ident: CR17 article-title: Crane scheduling in container yards with inter-crane interference publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2003.11.025 – volume: 59 start-page: 425 issue: 1–3 year: 1999 end-page: 433 ident: CR10 article-title: A routing algorithm for a single straddle carrier to load export containers onto a containership publication-title: International Journal of Production Economics – volume: 107 start-page: 115 issue: 1 year: 2007 end-page: 124 ident: CR12 article-title: Scheduling of two-transtainer systems for loading outbound containers in port container terminals with simulated annealing algorithm publication-title: International Journal of Production Economics doi: 10.1016/j.ijpe.2006.08.003 – volume: 202 start-page: 615 issue: 3 year: 2010 end-page: 627 ident: CR1 article-title: A survey of berth allocation and quay crane scheduling problems in container terminals publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2009.05.031 – volume: 36 start-page: 537 issue: 6 year: 2002 end-page: 555 ident: CR21 article-title: Dynamic crane deployment in container storage yards publication-title: Transportation Research Part B doi: 10.1016/S0191-2615(01)00017-0 – volume: 36 start-page: 821 issue: 9 year: 2002 end-page: 835 ident: CR7 article-title: The optimal sizing of the storage space and handling facilities for import containers publication-title: Transportation Research Part B doi: 10.1016/S0191-2615(01)00033-9 – volume: 202 start-page: 615 issue: 3 year: 2010 ident: 5215_CR1 publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2009.05.031 – volume-title: Introduction to Algorithms year: 2001 ident: 5215_CR3 – volume: 36 start-page: 79 issue: 1 year: 2002 ident: 5215_CR2 publication-title: Transportation Science doi: 10.1287/trsc.36.1.79.568 – volume: 33 start-page: 17 issue: 1 year: 1999 ident: 5215_CR8 publication-title: Transportation Science doi: 10.1287/trsc.33.1.17 – volume: 33 start-page: 673 issue: 3–4 year: 1997 ident: 5215_CR9 publication-title: Computers & Industrial Engineering doi: 10.1016/S0360-8352(97)00219-2 – volume: 28 start-page: 803 issue: 6 year: 2011 ident: 5215_CR22 publication-title: Asia-Pacificc Journal of Operational Research doi: 10.1142/S0217595911003351 – volume: 32 start-page: 617 issue: 3 year: 2010 ident: 5215_CR4 publication-title: OR Spectrum doi: 10.1007/s00291-010-0206-3 – volume: 35 start-page: 61 issue: 1 year: 2005 ident: 5215_CR16 publication-title: Interfaces doi: 10.1287/inte.1040.0120 – volume: 36 start-page: 537 issue: 6 year: 2002 ident: 5215_CR21 publication-title: Transportation Research Part B doi: 10.1016/S0191-2615(01)00017-0 – volume: 32 start-page: 519 issue: 3 year: 2010 ident: 5215_CR11 publication-title: OR Spectrum doi: 10.1007/s00291-010-0200-9 – volume: 35 start-page: 161 issue: 2 year: 2003 ident: 5215_CR14 publication-title: IIE Transactions doi: 10.1080/07408170304384 – volume: 26 start-page: 3 issue: 1 year: 2004 ident: 5215_CR19 publication-title: OR Spectrum doi: 10.1007/s00291-003-0157-z – volume: 30 start-page: 1 issue: 1 year: 2008 ident: 5215_CR18 publication-title: OR Spectrum doi: 10.1007/s00291-007-0100-9 – volume: 36 start-page: 821 issue: 9 year: 2002 ident: 5215_CR7 publication-title: Transportation Research Part B doi: 10.1016/S0191-2615(01)00033-9 – volume: 59 start-page: 425 issue: 1–3 year: 1999 ident: 5215_CR10 publication-title: International Journal of Production Economics – volume: 107 start-page: 115 issue: 1 year: 2007 ident: 5215_CR12 publication-title: International Journal of Production Economics doi: 10.1016/j.ijpe.2006.08.003 – volume: 28 start-page: 539 issue: 4 year: 2006 ident: 5215_CR13 publication-title: OR Spectrum doi: 10.1007/s00291-006-0045-4 – volume: 30 start-page: 697 issue: 4 year: 2008 ident: 5215_CR6 publication-title: OR Spectrum doi: 10.1007/s00291-008-0127-6 – volume: 39 start-page: 309 issue: 3 year: 2005 ident: 5215_CR15 publication-title: Decision Support Systems doi: 10.1016/j.dss.2003.11.002 – volume: 26 start-page: 31 issue: 1 year: 2009 ident: 5215_CR23 publication-title: Asia-Pacific Journal of Operational Research doi: 10.1142/S0217595909002146 – volume: 147 start-page: 1 issue: 1 year: 2003 ident: 5215_CR20 publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(02)00293-X – volume: 2 start-page: 82 year: 1974 ident: 5215_CR5 publication-title: Mathematical Programming Study doi: 10.1007/BFb0120690 – volume: 164 start-page: 64 issue: 1 year: 2005 ident: 5215_CR17 publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2003.11.025
SSID	ssj0036910
Score	1.9056634
Snippet	This paper proposes a mixed integer programming model for the allocation of rail mounted gantry cranes for four basic yard activities with different...
SourceID	wanfang proquest pascalfrancis crossref springer chongqing
SourceType	Aggregation Database Index Database Enrichment Source Publisher
StartPage	227
SubjectTerms	Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Branch and bound methods Complexity Computer science; control theory; systems Economic Theory/Quantitative Economics/Mathematical Methods Engineering Exact sciences and technology Gantry cranes Ground, air and sea transportation, marine construction Heuristic Integer programming Marine and water way transportation and traffic Mathematical programming Mixed integer NP-hard Operational research and scientific management Operational research. Management science Operations Research/Decision Theory Priorities Theoretical computing 业务分配优先级启发式算法堆场拉格朗日松弛算法混合整数规划模型龙门起重机
SummonAdditionalLinks	– databaseName: SpringerLINK Contemporary 1997-Present dbid: RSV link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3db9UgFCc6fdAYv80658KDiYmGpEAp9HExLj4si_EreyNAoVucvfO2m91_76Et9-4mZok-NnCAwo9zDhzOOQi95soVzFeUlJw5UhgriWEyEBAmgrqgynzKWnIoj47U8XH1afbj7tJr92SSHDn12tkNqOPDKw6HJyqIuo3ugLRTMV_D5y_fE_vlZTWHIIhX_lKUyZT5tyZiQIWTRdv8gu42BNODc9PBHIUpucWG9rkymI5uPm0wbXNNIh08-q9_eYwezgoo3p8Q8wTd8u1TdP9aWMJn6Pc-PjQNDKoB7ODo7TKM60eiyKuxOWsWy9P-5CcGhReDAomj8X66-sOLgK8AdNgBue_GGuN39J-4HKO34nj1i1Nilh7DyGNzUPIcfTv48PX9RzInaCCuoLQntLbMwqY2RZ3n1glhBFNOcBcKWGvJCgfqhbV5AAwIVjqVB0VLZqTjnDrp-Qu01S5av40wc6J2dVA1NTR65xtfVbWwrrIi9zL4DO2sVkqfT4E4dBEPl6VkGcrT0mk3hzaPGTbO9Dooc5xwDROu44RrlaG3K5LU3A2V9zbwsKJgUsTs3XmGdhNA9MwDOs2qGEyQAwPM0LsEg3XxDb29mXG1rjz0P4aroW_cYLVno7UZ2OXOP7X7Et1jUy4PAN4u2uqXF_4Vuusu-9NuuTduoj8L8hbI priority: 102 providerName: Springer Nature
Title	A LAGRANGIAN RELAXATION-BASED ALGORITHM FOR THE ALLOCATION OF YARD CRANES FOR YARD ACTIVITIES WITH DIFFERENT PRIORITIES
URI	http://lib.cqvip.com/qk/84205A/201302/46448672.html https://link.springer.com/article/10.1007/s11518-013-5215-8 https://www.proquest.com/docview/2918663793 https://d.wanfangdata.com.cn/periodical/xtkxyxtgcxb-e201302006
Volume	22
WOSCitedRecordID	wos000320987100006&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: PRVPQU databaseName: Advanced Technologies & Aerospace Database customDbUrl: eissn: 1861-9576 dateEnd: 20241213 omitProxy: false ssIdentifier: ssj0036910 issn: 1004-3756 databaseCode: P5Z dateStart: 20030301 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: Engineering Database customDbUrl: eissn: 1861-9576 dateEnd: 20241213 omitProxy: false ssIdentifier: ssj0036910 issn: 1004-3756 databaseCode: M7S dateStart: 20030301 isFulltext: true titleUrlDefault: http://search.proquest.com providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1861-9576 dateEnd: 20241213 omitProxy: false ssIdentifier: ssj0036910 issn: 1004-3756 databaseCode: BENPR dateStart: 20030301 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1861-9576 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0036910 issn: 1004-3756 databaseCode: RSV dateStart: 20030301 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/eLvHCXMwpV1Nb9QwELWg5QCq-Cwipax8QEICWcROHCcnVFArDtVq1QKquFiO46SIkt02aUn_PTNOstu97IVLpFVsJ9l5mZnMeOYR8jZKbSxcxlkSCctikytmhCoZGBPJbZkmYc9acqym0_TsLJsNAbdm2FY56kSvqIu5xRj5R5Fha7YI4PRpccmQNQqzqwOFxn2yjV0SuN-6dzpq4ijJhm4EGP1XMhmzmr50DobjNq4IPsW4ZCn2Vjif19UlWIw1G7WzMA38XWXPc7HmiC5zp77ipy5NXd0xTkdP_vexnpLHg1tKD3ocPSP3XP2cPLrTrPAF-XtAj00F91cBoijWwHReqgwNYUHNRQXrtud_KLjBFNxKiin9PiBI5yW9BShSC9Nd40f431hVceN7ulIMCNORrqWl8Mi4HJzZJd-PDr99-coG2gZmY85bxotc5PCqm7gIw9xKaaRIrYxsGQMClIgtOB15HpaADCkSm4ZlyhNhlI0ibpWLXpKtel67V4QKKwtblGnBDceafeOyrJC5zXIZOlW6gOwthaYXfXsOHeMnZ6JEQMJRitoODc-Rd-NCr1o1Iwg0gEAjCHQakPfLKeNyGwZP1qCxnCGURE7vMCD7o8z1oBkavRJ4QD6M-Fmd3nC1dwPEVoO79nd327WV7XLthM9BgxLd23zZ1-Sh6Ck9AP37ZKu9unZvyAN70_5qriZk-_PhdHYy8S8SHGfyJxxPTn_8A65eJUg
linkProvider	ProQuest
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9QwEB6VggQI8UaklOIDCAlkkThxHgeEKqBq1WWFRJF6M47jpFVLdtuENvun-I2MnXi3e9lbDxyj2E5sf-MZezzzAbwOUxUxnQU0DpmikcwTKllSUlQmPFBlGvs9a8koGY_Tw8Ps-xr8dbEw5lqlWxPtQl1MlDkj_8Ayk5otRDh9mp5RwxplvKuOQqOHxb6eXeKWrfm49wXn9w1jO18PPu_SgVWAqigIWhoUOcsRiTIqfD9XnEvOUsVDVUb4gwmLFOrEPPdL_HHOYpX6ZRrETCYqDAOV6BDbvQE30Yxgmb0q-MOt_GGcDdkPjLch4bHzotpQPey7uTYW4tYv4DQ1uRyOJnV1hhpqSSfem8oGp6fseTWWDN-5r9ZGGNWlrKsrynDnwf82jA_h_mB2k-1eTh7Bmq4fw90ryRifwOU2GckKx6NCiSEmxqezqKVG0RdEnlbYj_boN0Ezn6DZTMyVhf7Ak0xKMkNRIwqr68aWsM8mauTC5qwl5sCbODqaluAQm-bwzVP4eS09fwbr9aTWz4EwxQtVlGkRyMDkJJA6ywqeqyznvk5K7cHGHCRi2qcfEZHZUscJ88B3qBFqSOhueEVOxSIVtQGdQNAJAzqRevBuXsU1t6Lw1hIU5zVYwg1nue_BpsOYGFa-RiwA5sF7h9fF6xVfeztAelG4a0-6WddWqsuFZtbHjkpiY_VnX8Ht3YNvIzHaG--_gDuspy9ByduE9fb8j34Jt9RFe9ycb1nhJfDrumH-D47VfPE
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3da9UwFD_oFJmIX1PsnDMPgqCUNWnTpI9DvSheLgM_2FtI06Qbbr3X2zq7_96Tfty7CzIQH0uSkyb5JTnJyfkdgFexNAmzGQ3TmJkw0bkINRMuxM2EU-NkGvVRS6ZiNpPHx9nREOe0Hl-7jybJ3qfBszRVzcGicAdrxzeU5B9hxXiQojyUN-FW4t_R--P6l-_jUhyn2UBH4K__BU9Hs-bfRHhyhZN5Vf7Eqjc2qXsLXWN_uT7QxYYmujKedi4_ldNVeWV3mjz473Y9hPuDYkoOeyQ9ghu2egx3r9AV7sDvQzLVJf5giZgi3gum7cY19FthQfRZOV-eNifnBBVhgool8Ub9_kqQzB25RDASg8Vt3eXovr1fxUXH6kr8lTAZA7Y0BFvhxWHKE_g2-fD13cdwCNwQmoTSJqRFznKc7Dopoig3nGvOpOGxcQliQLDEoNqR55FDbHCWGhk5SVOmhYljaoSNn8JWNa_sMyDM8MIUThZUU--1r22WFTw3Wc4jK5wNYHc1amrRE3SoxB86U8ECiMZhVGagPPeRN87UmqzZd7jCDle-w5UM4M2qyCjumsz7G9hYlWCC-6jeUQB7I1jUsDbUimWeZDDGhTGAtyMk1snX1PZ6wNg6c9v8aC_bpjRtrizrrNC4jO7-k9yXcOfo_URNP80-P4dt1of7QAzuwVaz_GVfwG1z0ZzWy_1ubv0BRwMikA
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+LAGRANGIAN+RELAXATION-BASED+ALGORITHM+FOR+THE+ALLOCATION+OF+YARD+CRANES+FOR+YARD+ACTIVITIES+WITH+DIFFERENT+PRIORITIES&rft.jtitle=Journal+of+systems+science+and+systems+engineering&rft.au=CANRONG+ZHANG&rft.au=TAO+WU&rft.au=LI+ZHENG&rft.au=LIXIN+MIAO&rft.date=2013-06-01&rft.pub=Springer&rft.issn=1004-3756&rft.eissn=1861-9576&rft.volume=22&rft.issue=2&rft.spage=227&rft.epage=252&rft_id=info:doi/10.1007%2Fs11518-013-5215-8&rft.externalDBID=n%2Fa&rft.externalDocID=27541240
thumbnail_s	http://cvtisr.summon.serialssolutions.com/2.0.0/image/custom?url=http%3A%2F%2Fimage.cqvip.com%2Fvip1000%2Fqk%2F84205A%2F84205A.jpg http://cvtisr.summon.serialssolutions.com/2.0.0/image/custom?url=http%3A%2F%2Fwww.wanfangdata.com.cn%2Fimages%2FPeriodicalImages%2Fxtkxyxtgcxb-e%2Fxtkxyxtgcxb-e.jpg