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

Capacity allocation problem with random demands for the rail container carrier

Author

Listed:
  • Cao, Chengxuan
  • Gao, Ziyou
  • Li, Keping

Abstract

In this paper, we consider the formulation and heuristic algorithm for the capacity allocation problem with random demands in the rail container transportation. The problem is formulated as the stochastic integer programming model taking into account matches in supply and demand of rail container transportation. A heuristic algorithm for the stochastic integer programming model is proposed. The solution to the model is found by maximizing the expected total profit over the possible control decisions under the uncertainty of demands. Finally, we give numerical experiments to demonstrate the efficiency of the heuristic algorithm.

Suggested Citation

  • Cao, Chengxuan & Gao, Ziyou & Li, Keping, 2012. "Capacity allocation problem with random demands for the rail container carrier," European Journal of Operational Research, Elsevier, vol. 217(1), pages 214-221.
    • Handle: RePEc:eee:ejores:v:217:y:2012:i:1:p:214-221
    DOI: 10.1016/j.ejor.2011.08.023
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221711007648
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2011.08.023?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. Alexandra M. Newman & Candace Arai Yano, 2000. "Scheduling Direct and Indirect Trains and Containers in an Intermodal Setting," Transportation Science, INFORMS, vol. 34(3), pages 256-270, August.
    2. Yoshiaki Toyoda, 1975. "A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems," Management Science, INFORMS, vol. 21(12), pages 1417-1427, August.
    3. Nathalie Bostel & Pierre Dejax, 1998. "Models and Algorithms for Container Allocation Problems on Trains in a Rapid Transshipment Shunting Yard," Transportation Science, INFORMS, vol. 32(4), pages 370-379, November.
    4. Balev, Stefan & Yanev, Nicola & Freville, Arnaud & Andonov, Rumen, 2008. "A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem," European Journal of Operational Research, Elsevier, vol. 186(1), pages 63-76, April.
    5. Wilbaut, Christophe & Salhi, Saïd & Hanafi, Saïd, 2009. "An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem," European Journal of Operational Research, Elsevier, vol. 199(2), pages 339-348, December.
    6. Macharis, C. & Bontekoning, Y. M., 2004. "Opportunities for OR in intermodal freight transport research: A review," European Journal of Operational Research, Elsevier, vol. 153(2), pages 400-416, March.
    7. Richard Loulou & Eleftherios Michaelides, 1979. "New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem," Operations Research, INFORMS, vol. 27(6), pages 1101-1114, December.
    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. Wang, Xinchang, 2017. "Static and dynamic resource allocation models for single-leg transportation markets with service disruptions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 103(C), pages 87-108.
    2. Jiahao Zhao & Xiaoning Zhu & Li Wang, 2020. "Study on Scheme of Outbound Railway Container Organization in Rail-Water Intermodal Transportation," Sustainability, MDPI, vol. 12(4), pages 1-18, February.
    3. Yi Zhao & Ronghui Liu & Xi Zhang & Anthony Whiteing, 2018. "A chance-constrained stochastic approach to intermodal container routing problems," PLOS ONE, Public Library of Science, vol. 13(2), pages 1-22, February.
    4. Wennan Song & Di Liu & Wenyu Rong, 2022. "Optimization of Passenger-like Container Train Running Plan Considering Empty Container Dispatch," Sustainability, MDPI, vol. 14(8), pages 1-23, April.
    5. Dandan Chen & Yong Zhang & Liangpeng Gao & Russell G. Thompson, 2019. "Optimizing Multimodal Transportation Routes Considering Container Use," Sustainability, MDPI, vol. 11(19), pages 1-18, September.
    6. Qiu, Xuan & Lee, Chung-Yee, 2019. "Quantity discount pricing for rail transport in a dry port system," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 122(C), pages 563-580.

    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. Nils Boysen & Malte Fliedner & Florian Jaehn & Erwin Pesch, 2013. "A Survey on Container Processing in Railway Yards," Transportation Science, INFORMS, vol. 47(3), pages 312-329, August.
    2. Sabah Bushaj & İ. Esra Büyüktahtakın, 2024. "A K-means Supported Reinforcement Learning Framework to Multi-dimensional Knapsack," Journal of Global Optimization, Springer, vol. 89(3), pages 655-685, July.
    3. Macharis, C. & Bontekoning, Y. M., 2004. "Opportunities for OR in intermodal freight transport research: A review," European Journal of Operational Research, Elsevier, vol. 153(2), pages 400-416, March.
    4. Yalçın Akçay & Haijun Li & Susan Xu, 2007. "Greedy algorithm for the general multidimensional knapsack problem," Annals of Operations Research, Springer, vol. 150(1), pages 17-29, March.
    5. Freville, Arnaud, 2004. "The multidimensional 0-1 knapsack problem: An overview," European Journal of Operational Research, Elsevier, vol. 155(1), pages 1-21, May.
    6. Yoon, Yourim & Kim, Yong-Hyuk & Moon, Byung-Ro, 2012. "A theoretical and empirical investigation on the Lagrangian capacities of the 0-1 multidimensional knapsack problem," European Journal of Operational Research, Elsevier, vol. 218(2), pages 366-376.
    7. Hasan Pirkul, 1987. "A heuristic solution procedure for the multiconstraint zero‐one knapsack problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(2), pages 161-172, April.
    8. Yalçin Akçay & Susan H. Xu, 2004. "Joint Inventory Replenishment and Component Allocation Optimization in an Assemble-to-Order System," Management Science, INFORMS, vol. 50(1), pages 99-116, January.
    9. Mateusz Cichenski & Florian Jaehn & Grzegorz Pawlak & Erwin Pesch & Gaurav Singh & Jacek Blazewicz, 2017. "An integrated model for the transshipment yard scheduling problem," Journal of Scheduling, Springer, vol. 20(1), pages 57-65, February.
    10. Bontekoning, Y. M. & Macharis, C. & Trip, J. J., 2004. "Is a new applied transportation research field emerging?--A review of intermodal rail-truck freight transport literature," Transportation Research Part A: Policy and Practice, Elsevier, vol. 38(1), pages 1-34, January.
    11. Ambrosino, Daniela & Siri, Silvia, 2015. "Comparison of solution approaches for the train load planning problem in seaport terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 79(C), pages 65-82.
    12. Verma, Manish & Verter, Vedat, 2010. "A lead-time based approach for planning rail-truck intermodal transportation of dangerous goods," European Journal of Operational Research, Elsevier, vol. 202(3), pages 696-706, May.
    13. Jiahao Zhao & Xiaoning Zhu & Li Wang, 2020. "Study on Scheme of Outbound Railway Container Organization in Rail-Water Intermodal Transportation," Sustainability, MDPI, vol. 12(4), pages 1-18, February.
    14. Boysen, Nils & Fliedner, Malte, 2010. "Determining crane areas in intermodal transshipment yards: The yard partition problem," European Journal of Operational Research, Elsevier, vol. 204(2), pages 336-342, July.
    15. Diaz, Juan Esteban & Handl, Julia & Xu, Dong-Ling, 2018. "Integrating meta-heuristics, simulation and exact techniques for production planning of a failure-prone manufacturing system," European Journal of Operational Research, Elsevier, vol. 266(3), pages 976-989.
    16. Nils Boysen & Florian Jaehn & Erwin Pesch, 2011. "Scheduling Freight Trains in Rail-Rail Transshipment Yards," Transportation Science, INFORMS, vol. 45(2), pages 199-211, May.
    17. Yi-Kuei Lin & Cheng-Fu Huang & Yi-Chieh Liao, 2019. "Reliability of a stochastic intermodal logistics network under spoilage and time considerations," Annals of Operations Research, Springer, vol. 277(1), pages 95-118, June.
    18. Qian Dai & Jiaqi Yang & Dong Li, 2018. "Modeling a Three-Mode Hybrid Port-Hinterland Freight Intermodal Distribution Network with Environmental Consideration: The Case of the Yangtze River Economic Belt in China," Sustainability, MDPI, vol. 10(9), pages 1-26, August.
    19. S Salhi & A Al-Khedhairi, 2010. "Integrating heuristic information into exact methods: The case of the vertex p-centre problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(11), pages 1619-1631, November.
    20. Metin Türkay & Öztürk Saraçoğlu & Mehmet Can Arslan, 2016. "Sustainability in Supply Chain Management: Aggregate Planning from Sustainability Perspective," PLOS ONE, Public Library of Science, vol. 11(1), pages 1-18, January.

    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:217:y:2012:i:1:p:214-221. 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.