IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v174y2006i2p1247-1259.html
   My bibliography  Save this article

A critical-shaking neighborhood search for the yard allocation problem

Author

Listed:
  • Lim, Andrew
  • Xu, Zhou

Abstract

No abstract is available for this item.

Suggested Citation

  • Lim, Andrew & Xu, Zhou, 2006. "A critical-shaking neighborhood search for the yard allocation problem," European Journal of Operational Research, Elsevier, vol. 174(2), pages 1247-1259, October.
    • Handle: RePEc:eee:ejores:v:174:y:2006:i:2:p:1247-1259
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(05)00257-2
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Bruce Hajek, 1988. "Cooling Schedules for Optimal Annealing," Mathematics of Operations Research, INFORMS, vol. 13(2), pages 311-329, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Youn Ju Woo & Jang-Ho Song & Kap Hwan Kim, 2016. "Pricing storage of outbound containers in container terminals," Flexible Services and Manufacturing Journal, Springer, vol. 28(4), pages 644-668, December.
    2. Chung-Yee Lee & Ming Liu & Chengbin Chu, 2015. "Optimal Algorithm for the General Quay Crane Double-Cycling Problem," Transportation Science, INFORMS, vol. 49(4), pages 957-967, November.
    3. Zhen, Lu & Wang, Wencheng & Lin, Shumin, 2022. "Analytical comparison on two incentive policies for shore power equipped ships in berthing activities," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 161(C).
    4. Yiting Xing & Ling Li & Zhuming Bi & Marzena Wilamowska‐Korsak & Li Zhang, 2013. "Operations Research (OR) in Service Industries: A Comprehensive Review," Systems Research and Behavioral Science, Wiley Blackwell, vol. 30(3), pages 300-353, May.
    5. Dienstknecht, Michael & Briskorn, Dirk, 2024. "Sharing in construction projects — On determining optimal container assignments for the on-site accommodation of trades," European Journal of Operational Research, Elsevier, vol. 315(1), pages 324-337.
    6. Matthew E. H. Petering & Yong Wu & Wenkai Li & Mark Goh & Robert Souza & Katta G. Murty, 2017. "Real-time container storage location assignment at a seaport container transshipment terminal: dispersion levels, yard templates, and sensitivity analyses," Flexible Services and Manufacturing Journal, Springer, vol. 29(3), pages 369-402, December.
    7. Zhou, Chenhao & Wang, Wencheng & Li, Haobin, 2020. "Container reshuffling considered space allocation problem in container terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 136(C).
    8. Kai Wang & Lu Zhen & Shuaian Wang, 2018. "Column Generation for the Integrated Berth Allocation, Quay Crane Assignment, and Yard Assignment Problem," Transportation Science, INFORMS, vol. 52(4), pages 812-834, August.
    9. H. L. Ma & S. H. Chung & H. K. Chan & Li Cui, 2019. "An integrated model for berth and yard planning in container terminals with multi-continuous berth layout," Annals of Operations Research, Springer, vol. 273(1), pages 409-431, February.
    10. Carlo, Héctor J. & Vis, Iris F.A. & Roodbergen, Kees Jan, 2014. "Storage yard operations in container terminals: Literature overview, trends, and research directions," European Journal of Operational Research, Elsevier, vol. 235(2), pages 412-430.
    11. Robenek, Tomáš & Umang, Nitish & Bierlaire, Michel & Ropke, Stefan, 2014. "A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports," European Journal of Operational Research, Elsevier, vol. 235(2), pages 399-411.
    12. Martin Alcalde, Enrique & Kim, Kap Hwan & Marchán, Sergi Saurí, 2015. "Optimal space for storage yard considering yard inventory forecasts and terminal performance," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 82(C), pages 101-128.
    13. Woo, Youn Ju & Kim, Kap Hwan, 2011. "Estimating the space requirement for outbound container inventories in port container terminals," International Journal of Production Economics, Elsevier, vol. 133(1), pages 293-301, September.
    14. Lu Zhen & Ek Peng Chew & Loo Hay Lee, 2011. "An Integrated Model for Berth Template and Yard Template Planning in Transshipment Hubs," Transportation Science, INFORMS, vol. 45(4), pages 483-504, November.
    15. Zhen, Lu, 2015. "Tactical berth allocation under uncertainty," European Journal of Operational Research, Elsevier, vol. 247(3), pages 928-944.
    16. Jin, Xuefeng & Park, Kang Tae & Kim, Kap Hwan, 2019. "Storage space sharing among container handling companies," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 127(C), pages 111-131.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. C. P. Stephens & W. Baritompa, 1998. "Global Optimization Requires Global Information," Journal of Optimization Theory and Applications, Springer, vol. 96(3), pages 575-588, March.
    2. Stoica, R.S. & Gregori, P. & Mateu, J., 2005. "Simulated annealing and object point processes: Tools for analysis of spatial patterns," Stochastic Processes and their Applications, Elsevier, vol. 115(11), pages 1860-1882, November.
    3. George Kapetanios, 2005. "Variable Selection using Non-Standard Optimisation of Information Criteria," Working Papers 533, Queen Mary University of London, School of Economics and Finance.
    4. Souvik Das & Ashwin Aravind & Ashish Cherukuri & Debasish Chatterjee, 2022. "Near-optimal solutions of convex semi-infinite programs via targeted sampling," Annals of Operations Research, Springer, vol. 318(1), pages 129-146, November.
    5. Pirlot, Marc, 1996. "General local search methods," European Journal of Operational Research, Elsevier, vol. 92(3), pages 493-511, August.
    6. Steinhofel, K. & Albrecht, A. & Wong, C. K., 1999. "Two simulated annealing-based heuristics for the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 118(3), pages 524-548, November.
    7. Löwe, Matthias, 1997. "On the invariant measure of non-reversible simulated annealing," Statistics & Probability Letters, Elsevier, vol. 36(2), pages 189-193, December.
    8. Miclo, Laurent, 1995. "Remarques sur l'ergodicité des algorithmes de recuit simulé sur un graphe," Stochastic Processes and their Applications, Elsevier, vol. 58(2), pages 329-360, August.
    9. Kapetanios, George, 2006. "Cluster analysis of panel data sets using non-standard optimisation of information criteria," Journal of Economic Dynamics and Control, Elsevier, vol. 30(8), pages 1389-1408, August.
    10. Antonio Jiménez-Martín & Alfonso Mateos & Josefa Z. Hernández, 2021. "Aluminium Parts Casting Scheduling Based on Simulated Annealing," Mathematics, MDPI, vol. 9(7), pages 1-18, March.
    11. Van Buer, Michael G. & Woodruff, David L. & Olson, Rick T., 1999. "Solving the medium newspaper production/distribution problem," European Journal of Operational Research, Elsevier, vol. 115(2), pages 237-253, June.
    12. Zhang Lihao & Ye Zeyang & Deng Yuefan, 2019. "Parallel MCMC methods for global optimization," Monte Carlo Methods and Applications, De Gruyter, vol. 25(3), pages 227-237, September.
    13. Yiyo Kuo, 2014. "Design method using hybrid of line-type and circular-type routes for transit network system optimization," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 22(2), pages 600-613, July.
    14. Broekmeulen, Rob A. C. M. & van Weert, Arjen & Saedt, Anton P. H., 2002. "Comparing three alternative optimisation methods for the treatment planning of bulbs," Agricultural Systems, Elsevier, vol. 72(1), pages 59-71, April.
    15. F. R. B. Cruz & A. R. Duarte & G. L. Souza, 2018. "Multi-objective performance improvements of general finite single-server queueing networks," Journal of Heuristics, Springer, vol. 24(5), pages 757-781, October.
    16. Rodriguez-Tello, Eduardo & Hao, Jin-Kao & Torres-Jimenez, Jose, 2008. "An improved simulated annealing algorithm for bandwidth minimization," European Journal of Operational Research, Elsevier, vol. 185(3), pages 1319-1335, March.
    17. Doole, Graeme J., 2007. "A primer on implementing compressed simulated annealing for the optimisation of a constrained simulation model in Microsoft Excel," Working Papers 7420, University of Western Australia, School of Agricultural and Resource Economics.
    18. Sam Hui & Eric Bradlow, 2012. "Bayesian multi-resolution spatial analysis with applications to marketing," Quantitative Marketing and Economics (QME), Springer, vol. 10(4), pages 419-452, December.
    19. Zhao, Fang & Zeng, Xiaogang, 2008. "Optimization of transit route network, vehicle headways and timetables for large-scale transit networks," European Journal of Operational Research, Elsevier, vol. 186(2), pages 841-855, April.
    20. Gabriel M. Portal & Marcus Ritt & Leonardo M. Borba & Luciana S. Buriol, 2016. "Simulated annealing for the machine reassignment problem," Annals of Operations Research, Springer, vol. 242(1), pages 93-114, July.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:174:y:2006:i:2:p:1247-1259. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.