A storage allocation algorithm for outbound containers based on the outer–inner cellular automaton
The storage allocation problem of outbound containers in container yard is usually optimized by two successive stages, yard-bay allocation problem (YBAP) and space allocation problem (SAP), but they cannot obtain global optimal solution. This paper proposes an outer–inner cellular automaton algorith...
Uloženo v:
| Vydáno v: | Information sciences Ročník 281; s. 147 - 171 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier Inc
10.10.2014
|
| Témata: | |
| ISSN: | 0020-0255, 1872-6291 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | The storage allocation problem of outbound containers in container yard is usually optimized by two successive stages, yard-bay allocation problem (YBAP) and space allocation problem (SAP), but they cannot obtain global optimal solution. This paper proposes an outer–inner cellular automaton algorithm (CAOI) to solve this problem, using YBAP and SAP as an integrated optimization process. Our work can be divided into several parts: (1) The outer cellular automaton (CAO) model is established to solve YBAP, and the inner cellular automaton (CAI) model is established to solve SAP. (2) In CAO model, an End–Front–Front–End (EFFE) transition rule is designed to make a cell change its state more instructive. (3) In CAI model, cells are initialized through a branch and bound method based on least-cost priority queue (LCBB). LCBB makes initial CAI cell space in an approximate optimal state. (4) An integrated strategy for CAO and CAI model is proposed, by which CAO and CAI execute co-evolution under the control of CAOI. Extensive experiments show CAOI achieves a better performance in solving storage allocation problem than other state-of-the-art methods, which synchronously optimizes the container transportation distance, the number of allocated yard-bays and rehandles. |
|---|---|
| AbstractList | The storage allocation problem of outbound containers in container yard is usually optimized by two successive stages, yard-bay allocation problem (YBAP) and space allocation problem (SAP), but they cannot obtain global optimal solution. This paper proposes an outer-inner cellular automaton algorithm (CAOI) to solve this problem, using YBAP and SAP as an integrated optimization process. Our work can be divided into several parts: (1) The outer cellular automaton (CAO) model is established to solve YBAP, and the inner cellular automaton (CAI) model is established to solve SAP. (2) In CAO model, an End-Front-Front-End (EFFE) transition rule is designed to make a cell change its state more instructive. (3) In CAI model, cells are initialized through a branch and bound method based on least-cost priority queue (LCBB). LCBB makes initial CAI cell space in an approximate optimal state. (4) An integrated strategy for CAO and CAI model is proposed, by which CAO and CAI execute co-evolution under the control of CAOI. Extensive experiments show CAOI achieves a better performance in solving storage allocation problem than other state-of-the-art methods, which synchronously optimizes the container transportation distance, the number of allocated yard-bays and rehandles. |
| Author | Wang, Huan Min, Zhenyu Hu, Wenbin |
| Author_xml | – sequence: 1 givenname: Wenbin surname: Hu fullname: Hu, Wenbin email: hwb@whu.edu.cn – sequence: 2 givenname: Huan surname: Wang fullname: Wang, Huan – sequence: 3 givenname: Zhenyu surname: Min fullname: Min, Zhenyu |
| BookMark | eNp9kL9KBDEQh4MoeJ4-gF1Km10n2d3kDisR_4Fgo3VIsrOaYy_RJCvY-Q6-oU9izrOysJqB-b5h5ndAdn3wSMgxg5oBE6er2vlUc2BtDV0NnO-QGVtIXgm-ZLtkBsChAt51--QgpRUAtFKIGenPacoh6iekehyD1dkFX9qnEF1-XtMhRBqmbMLke2qDz9p5jIkanbCnBc3PuAEwfn18Ol9m1OI4TqOOVE85rHUO_pDsDXpMePRb5-Tx6vLh4qa6u7--vTi_q2zTQK4YXxjTNDiwJXaDlNIMsFgspZWmt8a00rSal052KETLUBjBCisGxnvNODZzcrLd-xLD64Qpq7VLm3O0xzAlxUTLuWDQtQWVW9TGkFLEQVmXf57PUbtRMVCbXNVKlVzVJlcFnSq5FpP9MV-iW-v4_q9ztnWwfP_mMKpkHXqLvYtos-qD-8f-BlsGlek |
| CitedBy_id | crossref_primary_10_1007_s10696_022_09457_8 crossref_primary_10_1016_j_ins_2016_11_023 crossref_primary_10_1155_2019_9132315 crossref_primary_10_1007_s13042_017_0676_6 crossref_primary_10_1007_s10489_015_0701_y crossref_primary_10_1016_j_ins_2017_02_012 crossref_primary_10_3390_jmse11112109 crossref_primary_10_1016_j_ocecoaman_2023_106915 crossref_primary_10_1016_j_trb_2022_02_012 crossref_primary_10_1007_s00034_017_0518_5 crossref_primary_10_1016_j_measurement_2020_108206 crossref_primary_10_1109_TGRS_2017_2650938 crossref_primary_10_3390_machines9110280 crossref_primary_10_1109_JSTARS_2016_2640274 crossref_primary_10_1007_s00521_016_2508_0 crossref_primary_10_1109_JSTARS_2016_2646138 crossref_primary_10_1155_2015_548762 |
| Cites_doi | 10.1016/j.ins.2010.05.025 10.1287/ijoc.1070.0250 10.1016/j.dam.2008.05.020 10.1016/j.tre.2011.09.004 10.1109/TASE.2004.829412 10.1016/j.ejor.2012.10.045 10.1080/03052151003650092 10.1016/j.ijpe.2010.09.019 10.1108/03321640910992001 10.1016/j.cie.2008.03.012 10.1016/j.tre.2011.04.005 10.1016/j.tre.2011.06.004 10.1109/ICAL.2009.5262906 10.1016/S1874-8651(09)60001-6 10.1016/S0191-2615(02)00089-9 10.1080/00207540902998331 10.1016/S0360-8352(98)00182-X 10.1016/j.tre.2009.03.003 10.1287/ijoc.1040.0128 |
| ContentType | Journal Article |
| Copyright | 2014 Elsevier Inc. |
| Copyright_xml | – notice: 2014 Elsevier Inc. |
| DBID | AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1016/j.ins.2014.05.022 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Library & Information Science |
| EISSN | 1872-6291 |
| EndPage | 171 |
| ExternalDocumentID | 10_1016_j_ins_2014_05_022 S0020025514005611 |
| GroupedDBID | --K --M --Z -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN 9JO AAAKF AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AARIN AAXUO AAYFN ABAOU ABBOA ABFNM ABJNI ABMAC ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFS ACRLP ACZNC ADBBV ADEZE ADGUI ADTZH AEBSH AECPX AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR AXJTR BJAXD BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX IHE J1W JJJVA KOM LG9 LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 RIG ROL RPZ SDF SDG SDP SES SPC SPCBC SSB SSD SST SSV SSW SSZ T5K TN5 TWZ WH7 XPP ZMT ~02 ~G- 1OL 29I 77I 9DU AAAKG AAQXK AATTM AAXKI AAYWO AAYXX ABEFU ABWVN ACLOT ACNNM ACRPL ACVFH ADCNI ADJOM ADMUD ADNMO ADVLN AEIPS AEUPX AFFNX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS FEDTE FGOYB HLZ HVGLF HZ~ H~9 R2- SBC SDS SEW UHS WUQ YYP ZY4 ~HD 7SC 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c330t-128bb33ef19e5f777bf08897c7bdcbb47b4a2dcb75e6641e6b61f196f12da12e3 |
| ISICitedReferencesCount | 26 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000340315600010&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0020-0255 |
| IngestDate | Thu Oct 02 03:39:59 EDT 2025 Tue Nov 18 20:53:00 EST 2025 Sat Nov 29 06:24:54 EST 2025 Fri Feb 23 02:23:17 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Integrated optimization Bay allocation Branch and bound method Outer–inner cellular automaton Space allocation |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c330t-128bb33ef19e5f777bf08897c7bdcbb47b4a2dcb75e6641e6b61f196f12da12e3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
| PQID | 1642261054 |
| PQPubID | 23500 |
| PageCount | 25 |
| ParticipantIDs | proquest_miscellaneous_1642261054 crossref_citationtrail_10_1016_j_ins_2014_05_022 crossref_primary_10_1016_j_ins_2014_05_022 elsevier_sciencedirect_doi_10_1016_j_ins_2014_05_022 |
| PublicationCentury | 2000 |
| PublicationDate | 2014-10-10 |
| PublicationDateYYYYMMDD | 2014-10-10 |
| PublicationDate_xml | – month: 10 year: 2014 text: 2014-10-10 day: 10 |
| PublicationDecade | 2010 |
| PublicationTitle | Information sciences |
| PublicationYear | 2014 |
| Publisher | Elsevier Inc |
| Publisher_xml | – name: Elsevier Inc |
| References | Xie, He, Chang (b0105) 2008; 4 Kim, Lee (b0050) 2006 Mohammad (b0070) 2009; 56 Kim, Bae (b0045) 1998; 35 Perboli, Tadei (b0085) 2008; 20 Chen, Fu, Lim, Rodrigues (b0020) 2004; 1 Dohn, Clausen (b0035) 2010; 48 Chen, Lee, Cao (b0005) 2012; 48 Zhou, Kang (b0135) 2008; 28 Crainic, Perboli, Tadei (b0030) 2008; 20 Y.W. Zhang et al., Storage planning for outbound container on maritime container terminals, in: Proceedings of the 2009 IEEE International Conference on Automation and Logistics, IEEE, 2009, pp. 320–325. Chen, Fu, Lim (b0015) 2002 Shi, Liu, Gao, Zhang (b0100) 2011; 181 Ng (b0075) 2010; 42 Malucelli, Pallottino, Pretolani (b0060) 2008; 156 Yu, Qi (b0115) 2012; 226 Lee, Jin, Chen (b0055) 2012; 48 Zhang, Shi (b0125) 2007; 5 Chen, Lu (b0010) 2010; 135 Nishimura, Imai, Janssens, Papadimitriou (b0080) 2009; 45 Mi (b0065) 2009; 28 Saurí, Martín (b0095) 2011; 47 Salido, Rodriguez-Molins, Barber (b0090) 2011 Cordeau, Gaudioso, Laporte, Moccia (b0025) 2006; 18 Xie, Yan (b0110) 2008 Hu, Min, Du (b0040) 2013 Zhang, Liu, Wan, Murty, Linn (b0120) 2003; 37 Zhang (10.1016/j.ins.2014.05.022_b0125) 2007; 5 Chen (10.1016/j.ins.2014.05.022_b0020) 2004; 1 Hu (10.1016/j.ins.2014.05.022_b0040) 2013 Nishimura (10.1016/j.ins.2014.05.022_b0080) 2009; 45 Kim (10.1016/j.ins.2014.05.022_b0050) 2006 Shi (10.1016/j.ins.2014.05.022_b0100) 2011; 181 Zhou (10.1016/j.ins.2014.05.022_b0135) 2008; 28 Kim (10.1016/j.ins.2014.05.022_b0045) 1998; 35 10.1016/j.ins.2014.05.022_b0130 Perboli (10.1016/j.ins.2014.05.022_b0085) 2008; 20 Saurí (10.1016/j.ins.2014.05.022_b0095) 2011; 47 Chen (10.1016/j.ins.2014.05.022_b0010) 2010; 135 Cordeau (10.1016/j.ins.2014.05.022_b0025) 2006; 18 Zhang (10.1016/j.ins.2014.05.022_b0120) 2003; 37 Mi (10.1016/j.ins.2014.05.022_b0065) 2009; 28 Lee (10.1016/j.ins.2014.05.022_b0055) 2012; 48 Chen (10.1016/j.ins.2014.05.022_b0005) 2012; 48 Mohammad (10.1016/j.ins.2014.05.022_b0070) 2009; 56 Salido (10.1016/j.ins.2014.05.022_b0090) 2011 Yu (10.1016/j.ins.2014.05.022_b0115) 2012; 226 Xie (10.1016/j.ins.2014.05.022_b0105) 2008; 4 Chen (10.1016/j.ins.2014.05.022_b0015) 2002 Xie (10.1016/j.ins.2014.05.022_b0110) 2008 Ng (10.1016/j.ins.2014.05.022_b0075) 2010; 42 Crainic (10.1016/j.ins.2014.05.022_b0030) 2008; 20 Dohn (10.1016/j.ins.2014.05.022_b0035) 2010; 48 Malucelli (10.1016/j.ins.2014.05.022_b0060) 2008; 156 |
| References_xml | – volume: 48 start-page: 266 year: 2012 end-page: 275 ident: b0005 article-title: A combinatorial benders’ cuts algorithm for the quayside operation problem at container terminals publication-title: Transp. Res. Part E: Logis. Transp. Rev. – volume: 28 start-page: 161 year: 2008 end-page: 169 ident: b0135 article-title: Study on berth and quay-crane allocation under stochastic environments in container terminal publication-title: Syst. Eng. – Theory Pract. – reference: Y.W. Zhang et al., Storage planning for outbound container on maritime container terminals, in: Proceedings of the 2009 IEEE International Conference on Automation and Logistics, IEEE, 2009, pp. 320–325. – volume: 42 start-page: 1039 year: 2010 end-page: 1054 ident: b0075 article-title: Yard planning for vessel services with a cyclical calling pattern publication-title: Eng. Optim. – start-page: 1 year: 2013 end-page: 18 ident: b0040 article-title: A novel algorithm based on the unified neutral theory of biodiversity and biogeography model for block allocation of outbound container publication-title: Int. J. Comput. Integr. Manuf. – start-page: 295 year: 2011 end-page: 308 ident: b0090 article-title: Artificial intelligence techniques for the berth allocation and container stacking problems in container terminals publication-title: Research and Development in Intelligent Systems XXVII – volume: 5 start-page: 32 year: 2007 end-page: 38 ident: b0125 article-title: Storage space allocation for outbound containers publication-title: Chin. J. Constr. Mach. – volume: 35 start-page: 655 year: 1998 end-page: 658 ident: b0045 article-title: Re-marshaling export containers in port container terminals publication-title: Comput. Indust. Eng. – volume: 48 start-page: 516 year: 2012 end-page: 528 ident: b0055 article-title: Terminal and yard allocation problem for a container transshipment hub with multiple terminals publication-title: Transp. Res. Part E: Logis. Transp. Rev. – volume: 1 start-page: 26 year: 2004 end-page: 37 ident: b0020 article-title: Port yard storage optimization publication-title: IEEE Trans. Autom. Sci. Eng. – volume: 4 start-page: 021 year: 2008 ident: b0105 article-title: Dynamic storage space allocation strategy for outbound containers based on hybrid stack mode publication-title: J. Shanghai Marit. Univ. – volume: 45 start-page: 771 year: 2009 end-page: 786 ident: b0080 article-title: Container storage and transshipment marine terminals publication-title: Transp. Res. Part E: Logis. Transp. Rev. – start-page: 3 year: 2002 end-page: 8 ident: b0015 article-title: The yard allocation problem publication-title: Proceedings of the National Conference on Artificial Intelligence – volume: 181 start-page: 4460 year: 2011 end-page: 4493 ident: b0100 article-title: Cellular particle swarm optimization publication-title: Inform. Sci. – volume: 18 start-page: 433 year: 2006 end-page: 443 ident: b0025 article-title: A memetic heuristic for the generalized quadratic assignment problem publication-title: INFORMS J. Comput. – volume: 47 start-page: 1038 year: 2011 end-page: 1057 ident: b0095 article-title: Space allocating strategies for improving import yard performance at marine terminals publication-title: Transp. Res. Part E: Logis. Transp. Rev. – start-page: 672 year: 2008 end-page: 677 ident: b0110 article-title: An investigation into bay allocation model and algorithm for outbound containers publication-title: International Symposium on Knowledge Acquisition and Modeling. KAM’08 – volume: 48 start-page: 4585 year: 2010 end-page: 4608 ident: b0035 article-title: Optimizing the Slab Yard Planning and Crane Scheduling Problem using a two-stage heuristic publication-title: Int. J. Prod. Res. – volume: 135 start-page: 73 year: 2010 end-page: 80 ident: b0010 article-title: The storage location assignment problem for outbound containers in a maritime terminal publication-title: Int. J. Prod. Econ. – volume: 20 start-page: 368 year: 2008 end-page: 384 ident: b0085 article-title: Extreme-point-based heuristics for the three-dimensional bin packing problem publication-title: Informs J. Comput. – start-page: 564 year: 2006 end-page: 573 ident: b0050 article-title: Satisfying constraints for locating export containers in port container terminals publication-title: Computational Science and Its Applications – ICCSA 2006 – volume: 56 start-page: 44 year: 2009 end-page: 52 ident: b0070 article-title: A genetic algorithm to solve the storage space allocation problem in a container terminal publication-title: Comput. Indust. Eng. – volume: 28 start-page: 1442 year: 2009 end-page: 1457 ident: b0065 article-title: An investigation into yard allocation for outbound containers publication-title: Int. J. Comput. Math. Electr. Electr. Eng. – volume: 20 start-page: 368 year: 2008 end-page: 384 ident: b0030 article-title: Extreme point-based heuristics for three-dimensional bin packing publication-title: Informs J. Comput. – volume: 156 start-page: 3248 year: 2008 end-page: 3266 ident: b0060 article-title: The stack loading and unloading problem publication-title: Discr. Appl. Math. – volume: 226 start-page: 32 year: 2012 end-page: 45 ident: b0115 article-title: Storage space allocation models for inbound containers in an automatic container terminal publication-title: Eur. J. Oper. Res. – volume: 37 start-page: 883 year: 2003 end-page: 903 ident: b0120 article-title: Storage space allocation in container terminals publication-title: Transp. Res. Part B: Methodol. – volume: 181 start-page: 4460 issue: 20 year: 2011 ident: 10.1016/j.ins.2014.05.022_b0100 article-title: Cellular particle swarm optimization publication-title: Inform. Sci. doi: 10.1016/j.ins.2010.05.025 – start-page: 672 year: 2008 ident: 10.1016/j.ins.2014.05.022_b0110 article-title: An investigation into bay allocation model and algorithm for outbound containers – volume: 20 start-page: 368 issue: 3 year: 2008 ident: 10.1016/j.ins.2014.05.022_b0085 article-title: Extreme-point-based heuristics for the three-dimensional bin packing problem publication-title: Informs J. Comput. doi: 10.1287/ijoc.1070.0250 – volume: 4 start-page: 021 year: 2008 ident: 10.1016/j.ins.2014.05.022_b0105 article-title: Dynamic storage space allocation strategy for outbound containers based on hybrid stack mode publication-title: J. Shanghai Marit. Univ. – start-page: 564 year: 2006 ident: 10.1016/j.ins.2014.05.022_b0050 article-title: Satisfying constraints for locating export containers in port container terminals – volume: 156 start-page: 3248 issue: 17 year: 2008 ident: 10.1016/j.ins.2014.05.022_b0060 article-title: The stack loading and unloading problem publication-title: Discr. Appl. Math. doi: 10.1016/j.dam.2008.05.020 – volume: 48 start-page: 516 issue: 2 year: 2012 ident: 10.1016/j.ins.2014.05.022_b0055 article-title: Terminal and yard allocation problem for a container transshipment hub with multiple terminals publication-title: Transp. Res. Part E: Logis. Transp. Rev. doi: 10.1016/j.tre.2011.09.004 – volume: 1 start-page: 26 issue: 1 year: 2004 ident: 10.1016/j.ins.2014.05.022_b0020 article-title: Port yard storage optimization publication-title: IEEE Trans. Autom. Sci. Eng. doi: 10.1109/TASE.2004.829412 – volume: 20 start-page: 368 issue: 3 year: 2008 ident: 10.1016/j.ins.2014.05.022_b0030 article-title: Extreme point-based heuristics for three-dimensional bin packing publication-title: Informs J. Comput. doi: 10.1287/ijoc.1070.0250 – volume: 226 start-page: 32 issue: 1 year: 2012 ident: 10.1016/j.ins.2014.05.022_b0115 article-title: Storage space allocation models for inbound containers in an automatic container terminal publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2012.10.045 – volume: 42 start-page: 1039 issue: 11 year: 2010 ident: 10.1016/j.ins.2014.05.022_b0075 article-title: Yard planning for vessel services with a cyclical calling pattern publication-title: Eng. Optim. doi: 10.1080/03052151003650092 – volume: 135 start-page: 73 issue: 1 year: 2010 ident: 10.1016/j.ins.2014.05.022_b0010 article-title: The storage location assignment problem for outbound containers in a maritime terminal publication-title: Int. J. Prod. Econ. doi: 10.1016/j.ijpe.2010.09.019 – volume: 28 start-page: 1442 issue: 6 year: 2009 ident: 10.1016/j.ins.2014.05.022_b0065 article-title: An investigation into yard allocation for outbound containers publication-title: Int. J. Comput. Math. Electr. Electr. Eng. doi: 10.1108/03321640910992001 – volume: 56 start-page: 44 issue: 1 year: 2009 ident: 10.1016/j.ins.2014.05.022_b0070 article-title: A genetic algorithm to solve the storage space allocation problem in a container terminal publication-title: Comput. Indust. Eng. doi: 10.1016/j.cie.2008.03.012 – volume: 47 start-page: 1038 issue: 6 year: 2011 ident: 10.1016/j.ins.2014.05.022_b0095 article-title: Space allocating strategies for improving import yard performance at marine terminals publication-title: Transp. Res. Part E: Logis. Transp. Rev. doi: 10.1016/j.tre.2011.04.005 – volume: 5 start-page: 32 year: 2007 ident: 10.1016/j.ins.2014.05.022_b0125 article-title: Storage space allocation for outbound containers publication-title: Chin. J. Constr. Mach. – start-page: 1 year: 2013 ident: 10.1016/j.ins.2014.05.022_b0040 article-title: A novel algorithm based on the unified neutral theory of biodiversity and biogeography model for block allocation of outbound container publication-title: Int. J. Comput. Integr. Manuf. – volume: 48 start-page: 266 issue: 1 year: 2012 ident: 10.1016/j.ins.2014.05.022_b0005 article-title: A combinatorial benders’ cuts algorithm for the quayside operation problem at container terminals publication-title: Transp. Res. Part E: Logis. Transp. Rev. doi: 10.1016/j.tre.2011.06.004 – start-page: 295 year: 2011 ident: 10.1016/j.ins.2014.05.022_b0090 article-title: Artificial intelligence techniques for the berth allocation and container stacking problems in container terminals – ident: 10.1016/j.ins.2014.05.022_b0130 doi: 10.1109/ICAL.2009.5262906 – volume: 28 start-page: 161 issue: 1 year: 2008 ident: 10.1016/j.ins.2014.05.022_b0135 article-title: Study on berth and quay-crane allocation under stochastic environments in container terminal publication-title: Syst. Eng. – Theory Pract. doi: 10.1016/S1874-8651(09)60001-6 – volume: 37 start-page: 883 issue: 10 year: 2003 ident: 10.1016/j.ins.2014.05.022_b0120 article-title: Storage space allocation in container terminals publication-title: Transp. Res. Part B: Methodol. doi: 10.1016/S0191-2615(02)00089-9 – volume: 48 start-page: 4585 issue: 15 year: 2010 ident: 10.1016/j.ins.2014.05.022_b0035 article-title: Optimizing the Slab Yard Planning and Crane Scheduling Problem using a two-stage heuristic publication-title: Int. J. Prod. Res. doi: 10.1080/00207540902998331 – volume: 35 start-page: 655 issue: 3–4 year: 1998 ident: 10.1016/j.ins.2014.05.022_b0045 article-title: Re-marshaling export containers in port container terminals publication-title: Comput. Indust. Eng. doi: 10.1016/S0360-8352(98)00182-X – volume: 45 start-page: 771 issue: 5 year: 2009 ident: 10.1016/j.ins.2014.05.022_b0080 article-title: Container storage and transshipment marine terminals publication-title: Transp. Res. Part E: Logis. Transp. Rev. doi: 10.1016/j.tre.2009.03.003 – volume: 18 start-page: 433 issue: 4 year: 2006 ident: 10.1016/j.ins.2014.05.022_b0025 article-title: A memetic heuristic for the generalized quadratic assignment problem publication-title: INFORMS J. Comput. doi: 10.1287/ijoc.1040.0128 – start-page: 3 year: 2002 ident: 10.1016/j.ins.2014.05.022_b0015 article-title: The yard allocation problem |
| SSID | ssj0004766 |
| Score | 2.253564 |
| Snippet | The storage allocation problem of outbound containers in container yard is usually optimized by two successive stages, yard-bay allocation problem (YBAP) and... |
| SourceID | proquest crossref elsevier |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 147 |
| SubjectTerms | Algorithms Allocations Automation Bay allocation Branch and bound method Cellular Cellular automata Computer assisted instruction Containers Integrated optimization Optimization Outer–inner cellular automaton Space allocation |
| Title | A storage allocation algorithm for outbound containers based on the outer–inner cellular automaton |
| URI | https://dx.doi.org/10.1016/j.ins.2014.05.022 https://www.proquest.com/docview/1642261054 |
| Volume | 281 |
| WOSCitedRecordID | wos000340315600010&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 customDbUrl: eissn: 1872-6291 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0004766 issn: 0020-0255 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9NAEF5BygEOCAqIFooWCfVAZMnr18bHCKUqKAQOqYi4rHbX6zYR2Glso_LvmX34QRFVOXCxVtZuYvn7PLOPmfkQeuNLRVQMX1qiCPciLoUnuPA9kgNhMvDAJDeqJXO6WExWq_Szk0utjJwALYrJ1VW6_a9Qwz0AW6fO_gPc3Y_CDWgD6HAF2OF6K-CnYx3wqENx9Jm63ZGD5nm5W9cX301YYdnUQsspmUB1rtP_qrF2Z5k7OtAd1M4zslxjvbVvYlV5U5cwv3U4btoQ-C79cey8adVTxUTwqUKsOwp-cfvTp01Py4-2jsHXC1X8bIbbECTS9tsFpLZpAb6nFyhD0xpYORZnHImtren8LLHSK3-YcLubsIF1h66mTiJTWNXmLv9eLnvxiZ2czedsOVstj7eXnlYS0yfuTlblLtoLaJxORmhv-n62-tBny1J7gt0-cHvWbaL-rv3r32Yr1_y2mYwsH6GHbhWBpxb9x-iOKvbRg0FtyX105DJS8DEeYISdLX-CxBQ7nuCeJ7jjCYYhuOUJ7nmCDU8wdAWe4AFPcMsT3PHkKTo7mS3fnXpOcMOTYejXHsxVhAhDlZNUxTmlVOQ6Co5KKjIpRERFxANo0Vgl8BWrRCQE-iY5CTJOAhU-Q6OiLNRzhAMKriTwU65iGQU8FpHOck6oiIWcZDI7QH77Ypl01ei1KMo31oYdbhhgwTQWzI8ZYHGA3nZDtrYUy02doxYt5thv54gMeHbTsNctsgzsrH5zvFBlUzGS6JxzWI1Eh7fo8wLd7z-Sl2hU7xp1hO7JH_W62r1yjPwF8KCjiw |
| 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+storage+allocation+algorithm+for+outbound+containers+based+on+the+outer-inner+cellular+automaton&rft.jtitle=Information+sciences&rft.au=Hu%2C+Wenbin&rft.au=Wang%2C+Huan&rft.au=Min%2C+Zhenyu&rft.date=2014-10-10&rft.issn=0020-0255&rft.volume=281&rft.spage=147&rft.epage=171&rft_id=info:doi/10.1016%2Fj.ins.2014.05.022&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-0255&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-0255&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-0255&client=summon |