Approximate dynamic programming for container stacking
•Novel approach to minimize reshuffles at container terminals.•Extensions of the Container Relocation Problem and Block Relocation Problem.•Consideration of uncertainty in arrival times of both in- and outbound containers.•Approximate Dynamic Programming approach to support realtime decision making....
Uloženo v:
| Vydáno v: | European journal of operational research Ročník 310; číslo 1; s. 328 - 342 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier B.V
01.10.2023
|
| Témata: | |
| ISSN: | 0377-2217, 1872-6860 |
| 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 | •Novel approach to minimize reshuffles at container terminals.•Extensions of the Container Relocation Problem and Block Relocation Problem.•Consideration of uncertainty in arrival times of both in- and outbound containers.•Approximate Dynamic Programming approach to support realtime decision making.•Validation of the approach using real-life container terminals.
At some point during transport, intermodal containers will be stored at a terminal, where they are typically stacked on top of each other. Stacking yields a higher utilization of the area but may lead to unproductive reshuffle moves when containers below another need to be retrieved. Preventing reshuffles has a financial benefit, as it not only avoids the costs of executing the reshuffle but also decreases the time needed to retrieve a container. Typically, researchers consider only the retrieval of containers and assume the retrieval order is fully known. In addition, existing studies do not consider the stacking restrictions imposed by a reach stacker, which is commonly used in smaller inland terminals. This research aims to design decision support for determining real-life applicable container stack allocations so that the expected number of reshuffles is minimized. We propose a model that includes both arrivals and departures of containers as well as a certain level of uncertainty in the order thereof. The problem is modeled as a Markov Decision Process and solved using Approximate Dynamic Programming (ADP). Through numerical experiments on real-life problem instances, we conclude that the ADP approach drastically outperforms a benchmark heuristic from the literature. All data used as well as the source code has been made publicly available. |
|---|---|
| AbstractList | •Novel approach to minimize reshuffles at container terminals.•Extensions of the Container Relocation Problem and Block Relocation Problem.•Consideration of uncertainty in arrival times of both in- and outbound containers.•Approximate Dynamic Programming approach to support realtime decision making.•Validation of the approach using real-life container terminals.
At some point during transport, intermodal containers will be stored at a terminal, where they are typically stacked on top of each other. Stacking yields a higher utilization of the area but may lead to unproductive reshuffle moves when containers below another need to be retrieved. Preventing reshuffles has a financial benefit, as it not only avoids the costs of executing the reshuffle but also decreases the time needed to retrieve a container. Typically, researchers consider only the retrieval of containers and assume the retrieval order is fully known. In addition, existing studies do not consider the stacking restrictions imposed by a reach stacker, which is commonly used in smaller inland terminals. This research aims to design decision support for determining real-life applicable container stack allocations so that the expected number of reshuffles is minimized. We propose a model that includes both arrivals and departures of containers as well as a certain level of uncertainty in the order thereof. The problem is modeled as a Markov Decision Process and solved using Approximate Dynamic Programming (ADP). Through numerical experiments on real-life problem instances, we conclude that the ADP approach drastically outperforms a benchmark heuristic from the literature. All data used as well as the source code has been made publicly available. |
| Author | Mes, Martijn R.K. de Vries, Leon R. Boschma, René |
| Author_xml | – sequence: 1 givenname: René surname: Boschma fullname: Boschma, René email: r.boschma@alumnus.utwente.nl organization: University of Twente, Faculty of Electrical Engineering, Mathematics and Computer Science, Drienerlolaan 5, Enschede, 7522NB, the Netherlands – sequence: 2 givenname: Martijn R.K. orcidid: 0000-0001-9676-5259 surname: Mes fullname: Mes, Martijn R.K. email: m.r.k.mes@utwente.nl organization: University of Twente, Faculty of Behavioural, Management and Social sciences, Drienerlolaan 5, Enschede, 7522NB, the Netherlands – sequence: 3 givenname: Leon R. surname: de Vries fullname: de Vries, Leon R. email: l.r.devries@utwente.nl organization: University of Twente, Faculty of Electrical Engineering, Mathematics and Computer Science, Drienerlolaan 5, Enschede, 7522NB, the Netherlands |
| BookMark | eNp9j8tqwzAQRUVJoUnaH-jKP2B3JNmSDN2E0BcEumnXQhrLQW78QBal-fsqpKsushq4w7ncsyKLYRwcIfcUCgpUPHSF68ZQMGC8AFYAL6_IkirJcqEELMgSuJQ5Y1TekNU8dwBAK1otidhMUxh_fG-iy5rjYHqPWUr2wfS9H_ZZO4YMxyEaP7iQzdHgV4pvyXVrDrO7-7tr8vn89LF9zXfvL2_bzS7HEuqYN6JuG6toZWvhsLUUwVaGN1wJRS2ClBUIW1pVslYyWfOG1W16lwKxrCTwNVHnXgzjPAfXavTRRJ8GBeMPmoI--etOn_z1yV8D08k_oewfOoWkGY6Xoccz5JLUt3dBz-jdgK7xwWHUzegv4b9SNXbt |
| CitedBy_id | crossref_primary_10_1109_TASE_2024_3370216 crossref_primary_10_1287_deca_2024_0208 crossref_primary_10_1016_j_ocecoaman_2024_107271 crossref_primary_10_1016_j_tre_2024_103420 crossref_primary_10_1080_00207543_2023_2279130 crossref_primary_10_1016_j_tre_2024_103873 crossref_primary_10_1016_j_tre_2024_103643 |
| Cites_doi | 10.1016/j.ejor.2017.11.053 10.1007/s00291-007-0100-9 10.1109/TASE.2012.2198642 10.1080/00207543.2017.1394595 10.1016/j.ejor.2016.01.055 10.1016/j.cie.2018.10.024 10.1016/j.cor.2004.08.005 10.1016/j.ejor.2014.03.011 10.1016/j.ejor.2016.09.011 10.1016/j.ejor.2014.03.040 10.1109/TASE.2015.2434417 10.1016/S0377-2217(99)00116-2 10.1080/03088839.2018.1450529 10.1007/s00291-009-0176-5 10.1080/00207543.2013.861618 10.1002/nav.20373 10.1016/j.ejor.2011.12.039 10.1016/j.ejor.2013.05.037 10.1287/trsc.2018.0828 |
| ContentType | Journal Article |
| Copyright | 2023 The Authors |
| Copyright_xml | – notice: 2023 The Authors |
| DBID | 6I. AAFTH AAYXX CITATION |
| DOI | 10.1016/j.ejor.2023.02.034 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1872-6860 |
| EndPage | 342 |
| ExternalDocumentID | 10_1016_j_ejor_2023_02_034 S0377221723001686 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 4.4 457 4G. 5GY 5VS 6I. 6OB 7-5 71M 8P~ 9JN 9JO AAAKF AABNK AACTN AAEDT AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AARIN AAXUO AAYFN ABAOU ABBOA ABFNM ABFRF ABJNI ABMAC ABUCO ABYKQ ACAZW ACDAQ ACGFO ACGFS ACIWK ACNCT ACRLP ACZNC ADBBV ADEZE ADGUI AEBSH AEFWE AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIGVJ AIKHN AITUG AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR AXJTR BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EO8 EO9 EP2 EP3 F5P FDB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX IHE J1W KOM LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 ROL RPZ RXW SCC SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SSV SSW SSZ T5K TAE TN5 U5U XPP ZMT ~02 ~G- 1OL 29G 41~ 9DU AAAKG AAQXK AATTM AAXKI AAYWO AAYXX ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADIYS ADJOM ADMUD ADNMO ADXHL AEIPS AEUPX AFFNX AFJKZ AFPUW AGQPQ AI. AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS EJD FEDTE FGOYB HVGLF HZ~ R2- VH1 WUQ ~HD |
| ID | FETCH-LOGICAL-c409t-d69fdb815b96ecfb1c0b5a3d38681bc077506b4b842f72793d29f3d346cc45703 |
| ISICitedReferencesCount | 9 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001006852700001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0377-2217 |
| IngestDate | Sat Nov 29 07:20:57 EST 2025 Tue Nov 18 21:32:56 EST 2025 Fri Feb 23 02:35:09 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Keywords | OR In maritime industry Approximate dynamic programming Container relocation problem Intermodal transport Container stacking |
| Language | English |
| License | This is an open access article under the CC BY license. |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c409t-d69fdb815b96ecfb1c0b5a3d38681bc077506b4b842f72793d29f3d346cc45703 |
| ORCID | 0000-0001-9676-5259 |
| OpenAccessLink | https://dx.doi.org/10.1016/j.ejor.2023.02.034 |
| PageCount | 15 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_ejor_2023_02_034 crossref_primary_10_1016_j_ejor_2023_02_034 elsevier_sciencedirect_doi_10_1016_j_ejor_2023_02_034 |
| PublicationCentury | 2000 |
| PublicationDate | 2023-10-01 |
| PublicationDateYYYYMMDD | 2023-10-01 |
| PublicationDate_xml | – month: 10 year: 2023 text: 2023-10-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationTitle | European journal of operational research |
| PublicationYear | 2023 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Galle, Manshadi, Boroujeni, Barnhart, Jaillet (bib0005) 2018; 52 Li, Xiaoning, Zhengyu (bib0013) 2019; 96 Kim, Hong (bib0009) 2006; 33 Powell (bib0017) 2013 Accessed: 2020-02-07. Caserta, Voß, Sniedovich (bib0003) 2011; 33 Wan, Liu, Tsai (bib0023) 2009; 56 UNCTAD (2018). Container port throughput, annual. Kim, Park, Ryu (bib0010) 2000; 124 Ku, Arthanari (bib0011) 2016; 252 Caserta, Schwarze, Voß (bib0001) 2009 Tanaka, Takii (bib0020) 2016; 13 Güven, Türsel Eliiyi (bib0008) 2019; 46 Caserta, Schwarze, Voß (bib0002) 2012; 219 Petering, Hussein (bib0016) 2013; 231 Scholl, Boywitz, Boysen (bib0018) 2018; 56 Zhu, Qin, Lim, Zhang (bib0027) 2012; 9 Stahlbock, Voß (bib0019) 2008; 30 Tang, Jiang, Liu, Dong (bib0021) 2015; 47 Zhang, Wu, Kim, Miao (bib0026) 2014; 238 Gambardella, Bontempi, Taillard, Romanengo, Raso, Piermari (bib0006) 1996 Zeng, Feng, Yang (bib0025) 2019; 127 Mes, Pérez Rivera (bib0014) 2017; 248 Zehendner, Feillet, Jaillet (bib0024) 2017; 259 Gharehgozli, Yu, De Koster, Udding (bib0007) 2014; 52 Galle, Barnhart, Jaillet (bib0004) 2018; 267 Pearl (bib0015) 1984 Lehnfeld, Knust (bib0012) 2014; 239 Ku (10.1016/j.ejor.2023.02.034_bib0011) 2016; 252 Stahlbock (10.1016/j.ejor.2023.02.034_bib0019) 2008; 30 Wan (10.1016/j.ejor.2023.02.034_bib0023) 2009; 56 Güven (10.1016/j.ejor.2023.02.034_bib0008) 2019; 46 Zeng (10.1016/j.ejor.2023.02.034_bib0025) 2019; 127 Caserta (10.1016/j.ejor.2023.02.034_bib0002) 2012; 219 Caserta (10.1016/j.ejor.2023.02.034_bib0003) 2011; 33 Gharehgozli (10.1016/j.ejor.2023.02.034_bib0007) 2014; 52 Petering (10.1016/j.ejor.2023.02.034_bib0016) 2013; 231 Tang (10.1016/j.ejor.2023.02.034_bib0021) 2015; 47 Zhu (10.1016/j.ejor.2023.02.034_bib0027) 2012; 9 Kim (10.1016/j.ejor.2023.02.034_bib0009) 2006; 33 Galle (10.1016/j.ejor.2023.02.034_bib0005) 2018; 52 Gambardella (10.1016/j.ejor.2023.02.034_bib0006) 1996 Zehendner (10.1016/j.ejor.2023.02.034_bib0024) 2017; 259 Caserta (10.1016/j.ejor.2023.02.034_bib0001) 2009 Kim (10.1016/j.ejor.2023.02.034_bib0010) 2000; 124 10.1016/j.ejor.2023.02.034_bib0022 Powell (10.1016/j.ejor.2023.02.034_bib0017) 2013 Li (10.1016/j.ejor.2023.02.034_bib0013) 2019; 96 Mes (10.1016/j.ejor.2023.02.034_bib0014) 2017; 248 Zhang (10.1016/j.ejor.2023.02.034_bib0026) 2014; 238 Galle (10.1016/j.ejor.2023.02.034_bib0004) 2018; 267 Scholl (10.1016/j.ejor.2023.02.034_bib0018) 2018; 56 Tanaka (10.1016/j.ejor.2023.02.034_bib0020) 2016; 13 Lehnfeld (10.1016/j.ejor.2023.02.034_bib0012) 2014; 239 Pearl (10.1016/j.ejor.2023.02.034_bib0015) 1984 |
| References_xml | – reference: , Accessed: 2020-02-07. – volume: 47 start-page: 751 year: 2015 end-page: 766 ident: bib0021 article-title: Research into container reshuffling and stacking problems in container terminal yards publication-title: IIE Transactions (Institute of Industrial Engineers) – start-page: 37 year: 2009 end-page: 48 ident: bib0001 article-title: A new binary description of the blocks relocation problem and benefits in a look ahead heuristic publication-title: Evolutionary computation in combinatorial optimization – volume: 124 start-page: 89 year: 2000 end-page: 101 ident: bib0010 article-title: Deriving decision rules to locate export containers in container yards publication-title: European Journal of Operational Research – volume: 52 start-page: 1035 year: 2018 end-page: 1058 ident: bib0005 article-title: The stochastic container relocation problem publication-title: Transportation Science – volume: 46 start-page: 201 year: 2019 end-page: 216 ident: bib0008 article-title: Modelling and optimisation of online container stacking with operational constraints publication-title: Maritime Policy and Management – volume: 239 start-page: 297 year: 2014 end-page: 312 ident: bib0012 article-title: Loading, unloading and premarshalling of stacks in storage areas: Survey and classification publication-title: European Journal of Operational Research – volume: 127 start-page: 366 year: 2019 end-page: 382 ident: bib0025 article-title: Integrated optimization of pickup sequence and container rehandling based on partial truck arrival information publication-title: Computers and Industrial Engineering – year: 2013 ident: bib0017 article-title: Approximate dynamic programming – volume: 267 start-page: 467 year: 2018 end-page: 477 ident: bib0004 article-title: A new binary formulation of the restricted container relocation problem based on a binary encoding of configurations publication-title: European Journal of Operational Research – volume: 219 start-page: 96 year: 2012 end-page: 104 ident: bib0002 article-title: A mathematical formulation and complexity considerations for the blocks relocation problem publication-title: European Journal of Operational Research – volume: 252 start-page: 1031 year: 2016 end-page: 1039 ident: bib0011 article-title: Container relocation problem with time windows for container departure publication-title: European Journal of Operational Research – start-page: 626 year: 1996 end-page: 630 ident: bib0006 article-title: Simulation and forecasting in intermodal container terminal publication-title: Proceedings of the 8th European simulation symposium – volume: 96 start-page: 3 year: 2019 end-page: 15 ident: bib0013 article-title: Efficient container stacking approach to improve handling: Efficiency in Chinese rail–truck transshipment terminals publication-title: Simulation – volume: 248 start-page: 63 year: 2017 end-page: 101 ident: bib0014 article-title: Approximate dynamic programming by practical examples publication-title: International Series in Operations Research and Management Science – volume: 56 start-page: 60 year: 2018 end-page: 71 ident: bib0018 article-title: On the quality of simple measures predicting block relocations in container yards publication-title: International Journal of Production Research – year: 1984 ident: bib0015 article-title: Heuristics: Intelligent search strategies for computer problem solving – volume: 259 start-page: 48 year: 2017 end-page: 62 ident: bib0024 article-title: An algorithm with performance guarantee for the online container relocation problem publication-title: European Journal of Operational Research – reference: UNCTAD (2018). Container port throughput, annual. – volume: 52 start-page: 2592 year: 2014 end-page: 2611 ident: bib0007 article-title: A decision-tree stacking heuristic minimising the expected number of reshuffles at a container terminal publication-title: International Journal of Production Research – volume: 33 start-page: 940 year: 2006 end-page: 954 ident: bib0009 article-title: A heuristic rule for relocating blocks publication-title: Computers and Operations Research – volume: 231 start-page: 120 year: 2013 end-page: 130 ident: bib0016 article-title: A new mixed integer program and extended look-ahead heuristic algorithm for the block relocation problem publication-title: European Journal of Operational Research – volume: 56 start-page: 699 year: 2009 end-page: 713 ident: bib0023 article-title: The assignment of storage locations to containers for a container stack publication-title: Naval Research Logistics – volume: 33 start-page: 915 year: 2011 end-page: 929 ident: bib0003 article-title: Applying the corridor method to a blocks relocation problem publication-title: OR Spectrum – volume: 238 start-page: 155 year: 2014 end-page: 165 ident: bib0026 article-title: Conservative allocation models for outbound containers in container terminals publication-title: European Journal of Operational Research – volume: 30 start-page: 1 year: 2008 end-page: 52 ident: bib0019 article-title: Operations research at container terminals: A literature update publication-title: OR Spectrum – volume: 9 start-page: 710 year: 2012 end-page: 722 ident: bib0027 article-title: Iterative deepening A* algorithms for the container relocation problem publication-title: IEEE Transactions on Automation Science and Engineering – volume: 13 start-page: 181 year: 2016 end-page: 190 ident: bib0020 article-title: A faster branch-and-bound algorithm for the block relocation problem publication-title: IEEE Transactions on Automation Science and Engineering – volume: 267 start-page: 467 issue: 2 year: 2018 ident: 10.1016/j.ejor.2023.02.034_bib0004 article-title: A new binary formulation of the restricted container relocation problem based on a binary encoding of configurations publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2017.11.053 – year: 1984 ident: 10.1016/j.ejor.2023.02.034_bib0015 – volume: 30 start-page: 1 issue: 1 year: 2008 ident: 10.1016/j.ejor.2023.02.034_bib0019 article-title: Operations research at container terminals: A literature update publication-title: OR Spectrum doi: 10.1007/s00291-007-0100-9 – volume: 9 start-page: 710 issue: 4 year: 2012 ident: 10.1016/j.ejor.2023.02.034_bib0027 article-title: Iterative deepening A* algorithms for the container relocation problem publication-title: IEEE Transactions on Automation Science and Engineering doi: 10.1109/TASE.2012.2198642 – volume: 96 start-page: 3 issue: 3 year: 2019 ident: 10.1016/j.ejor.2023.02.034_bib0013 article-title: Efficient container stacking approach to improve handling: Efficiency in Chinese rail–truck transshipment terminals publication-title: Simulation – volume: 56 start-page: 60 issue: 1-2 year: 2018 ident: 10.1016/j.ejor.2023.02.034_bib0018 article-title: On the quality of simple measures predicting block relocations in container yards publication-title: International Journal of Production Research doi: 10.1080/00207543.2017.1394595 – start-page: 37 year: 2009 ident: 10.1016/j.ejor.2023.02.034_bib0001 article-title: A new binary description of the blocks relocation problem and benefits in a look ahead heuristic – volume: 252 start-page: 1031 issue: 3 year: 2016 ident: 10.1016/j.ejor.2023.02.034_bib0011 article-title: Container relocation problem with time windows for container departure publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2016.01.055 – volume: 248 start-page: 63 issue: February year: 2017 ident: 10.1016/j.ejor.2023.02.034_bib0014 article-title: Approximate dynamic programming by practical examples publication-title: International Series in Operations Research and Management Science – volume: 127 start-page: 366 issue: August 2018 year: 2019 ident: 10.1016/j.ejor.2023.02.034_bib0025 article-title: Integrated optimization of pickup sequence and container rehandling based on partial truck arrival information publication-title: Computers and Industrial Engineering doi: 10.1016/j.cie.2018.10.024 – volume: 33 start-page: 940 issue: 4 year: 2006 ident: 10.1016/j.ejor.2023.02.034_bib0009 article-title: A heuristic rule for relocating blocks publication-title: Computers and Operations Research doi: 10.1016/j.cor.2004.08.005 – volume: 239 start-page: 297 issue: 2 year: 2014 ident: 10.1016/j.ejor.2023.02.034_bib0012 article-title: Loading, unloading and premarshalling of stacks in storage areas: Survey and classification publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2014.03.011 – start-page: 626 year: 1996 ident: 10.1016/j.ejor.2023.02.034_bib0006 article-title: Simulation and forecasting in intermodal container terminal – volume: 259 start-page: 48 issue: 1 year: 2017 ident: 10.1016/j.ejor.2023.02.034_bib0024 article-title: An algorithm with performance guarantee for the online container relocation problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2016.09.011 – volume: 238 start-page: 155 issue: 1 year: 2014 ident: 10.1016/j.ejor.2023.02.034_bib0026 article-title: Conservative allocation models for outbound containers in container terminals publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2014.03.040 – volume: 13 start-page: 181 issue: 1 year: 2016 ident: 10.1016/j.ejor.2023.02.034_bib0020 article-title: A faster branch-and-bound algorithm for the block relocation problem publication-title: IEEE Transactions on Automation Science and Engineering doi: 10.1109/TASE.2015.2434417 – volume: 124 start-page: 89 issue: 1 year: 2000 ident: 10.1016/j.ejor.2023.02.034_bib0010 article-title: Deriving decision rules to locate export containers in container yards publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(99)00116-2 – volume: 46 start-page: 201 issue: 2 year: 2019 ident: 10.1016/j.ejor.2023.02.034_bib0008 article-title: Modelling and optimisation of online container stacking with operational constraints publication-title: Maritime Policy and Management doi: 10.1080/03088839.2018.1450529 – volume: 33 start-page: 915 issue: 4 year: 2011 ident: 10.1016/j.ejor.2023.02.034_bib0003 article-title: Applying the corridor method to a blocks relocation problem publication-title: OR Spectrum doi: 10.1007/s00291-009-0176-5 – volume: 52 start-page: 2592 issue: 9 year: 2014 ident: 10.1016/j.ejor.2023.02.034_bib0007 article-title: A decision-tree stacking heuristic minimising the expected number of reshuffles at a container terminal publication-title: International Journal of Production Research doi: 10.1080/00207543.2013.861618 – year: 2013 ident: 10.1016/j.ejor.2023.02.034_bib0017 – volume: 56 start-page: 699 issue: 8 year: 2009 ident: 10.1016/j.ejor.2023.02.034_bib0023 article-title: The assignment of storage locations to containers for a container stack publication-title: Naval Research Logistics doi: 10.1002/nav.20373 – volume: 47 start-page: 751 issue: 7 year: 2015 ident: 10.1016/j.ejor.2023.02.034_bib0021 article-title: Research into container reshuffling and stacking problems in container terminal yards publication-title: IIE Transactions (Institute of Industrial Engineers) – volume: 219 start-page: 96 issue: 1 year: 2012 ident: 10.1016/j.ejor.2023.02.034_bib0002 article-title: A mathematical formulation and complexity considerations for the blocks relocation problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2011.12.039 – volume: 231 start-page: 120 issue: 1 year: 2013 ident: 10.1016/j.ejor.2023.02.034_bib0016 article-title: A new mixed integer program and extended look-ahead heuristic algorithm for the block relocation problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2013.05.037 – ident: 10.1016/j.ejor.2023.02.034_bib0022 – volume: 52 start-page: 1035 issue: 5 year: 2018 ident: 10.1016/j.ejor.2023.02.034_bib0005 article-title: The stochastic container relocation problem publication-title: Transportation Science doi: 10.1287/trsc.2018.0828 |
| SSID | ssj0001515 |
| Score | 2.4776018 |
| Snippet | •Novel approach to minimize reshuffles at container terminals.•Extensions of the Container Relocation Problem and Block Relocation Problem.•Consideration of... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 328 |
| SubjectTerms | Approximate dynamic programming Container relocation problem Container stacking Intermodal transport OR In maritime industry |
| Title | Approximate dynamic programming for container stacking |
| URI | https://dx.doi.org/10.1016/j.ejor.2023.02.034 |
| Volume | 310 |
| WOSCitedRecordID | wos001006852700001&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-6860 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001515 issn: 0377-2217 databaseCode: AIEXJ dateStart: 19950105 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3db9MwED-VDiF44KOANr6UB94qV4mdOPZjQUN8SBOCgfoWxR-R1m3pVLqpfz7n2M4CmyZA4iWq7LpNfdfz7y53vwN4retGc8YVoWWZklwXBVFcZcShV0QchXOiu2YT5cGBWCzk59FoG2thLk7KthXbrTz7r6LGMRS2K539C3H3H4oD-BqFjlcUO17_SPBzxxK-PUIkaqfG95uPWVinMW3SJajXruzPhRL0cTy-rovQB7SKA-sYNwwEQX0g-c0KXeTTgEJb_-i9F6Q3Qx1bwbKdfpl9msUpY6ffnaPehQbsyk0OYxD0MpstBMauFMf4gqyyJJT60syZ9fZVlJRw4VsIRAPMQmLrUNO8OWWhcNyfzMzzcF0x-j7-sJzZ5coxvFLWsbCGGOmvZNpf3U25e0LPC5cJfgt2aFlIMYad-Yf9xcf-FHdAr3sCFX5EKLjyuYG_f9P1oGYAVA4fwv3gYSRzrxmPYGTbCdyJBQ4TeBAbeSTBrk_g3oCV8jHwgQYlQYOSgQYlqEFJr0FJ1KAn8O3d_uHb9yS01yAanfoNMVw2RomsUJJb3ahMp6qomWGCoy-jHTdiylWuRE4bRLmSGSobnM651rkjbnsK43bV2l1IjK0zYamss4blNjU1VYKlUkljs8yacg-yuD-VDtzzrgXKSRWTDJeV29PK7WmV0gr3dA-m_Zozz7xy47uLuO1VwI4eE1aoJTese_aP657D3cs_wgsYb9bn9iXc1hebox_rV0GZfgKtFpFE |
| 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=Approximate+dynamic+programming+for+container+stacking&rft.jtitle=European+journal+of+operational+research&rft.au=Boschma%2C+Ren%C3%A9&rft.au=Mes%2C+Martijn+R.K.&rft.au=de+Vries%2C+Leon+R.&rft.date=2023-10-01&rft.pub=Elsevier+B.V&rft.issn=0377-2217&rft.eissn=1872-6860&rft.volume=310&rft.issue=1&rft.spage=328&rft.epage=342&rft_id=info:doi/10.1016%2Fj.ejor.2023.02.034&rft.externalDocID=S0377221723001686 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0377-2217&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0377-2217&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0377-2217&client=summon |