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

Minimizing fleet operating costs for a container transportation company

Author

Listed:
  • Coslovich, Luca
  • Pesenti, Raffaele
  • Ukovich, Walter

Abstract

No abstract is available for this item.

Suggested Citation

  • Coslovich, Luca & Pesenti, Raffaele & Ukovich, Walter, 2006. "Minimizing fleet operating costs for a container transportation company," European Journal of Operational Research, Elsevier, vol. 171(3), pages 776-786, June.
    • Handle: RePEc:eee:ejores:v:171:y:2006:i:3:p:776-786
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(04)00584-3
    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. Taylor, G. D. & Meinert, T. S. & Killian, R. C. & Whicker, G. L., 1999. "Development and analysis of alternative dispatching methods in truckload trucking," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 35(3), pages 191-205, September.
    2. Warren B. Powell & Arun Marar & Jack Gelfand & Steve Bowers, 2002. "Implementing Real-Time Optimization Models: A Case Application From The Motor Carrier Industry," Operations Research, INFORMS, vol. 50(4), pages 571-581, August.
    3. Crainic, Teodor Gabriel & Laporte, Gilbert, 1997. "Planning models for freight transportation," European Journal of Operational Research, Elsevier, vol. 97(3), pages 409-438, March.
    4. Ohlsson, Mattias & Peterson, Carsten & Soderberg, Bo, 2001. "An efficient mean field approach to the set covering problem," European Journal of Operational Research, Elsevier, vol. 133(3), pages 583-595, September.
    5. Taylor, G. Don & Whicker, Gary L. & Usher, John S., 2001. "Multi-zone dispatching in truckload trucking," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 37(5), pages 375-390, November.
    6. Beasley, J. E. & Chu, P. C., 1996. "A genetic algorithm for the set covering problem," European Journal of Operational Research, Elsevier, vol. 94(2), pages 392-404, October.
    7. Alberto Caprara & Paolo Toth & Matteo Fischetti, 2000. "Algorithms for the Set Covering Problem," Annals of Operations Research, Springer, vol. 98(1), pages 353-371, 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. Xue, Zhaojie & Zhang, Canrong & Lin, Wei-Hua & Miao, Lixin & Yang, Peng, 2014. "A tabu search heuristic for the local container drayage problem under a new operation mode," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 62(C), pages 136-150.
    2. Goh, Shao Hung & Chan, Yuxian, 2016. "Operational shadow pricing in back haul container shipping," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 92(C), pages 3-15.
    3. Xue, Ning & Bai, Ruibin & Qu, Rong & Aickelin, Uwe, 2021. "A hybrid pricing and cutting approach for the multi-shift full truckload vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 292(2), pages 500-514.
    4. Hajem A. Daham & Xinan Yang & Michaela K. Warnes, 2017. "An efficient mixed integer programming model for pairing containers in inland transportation based on the assignment of orders," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(6), pages 678-694, June.
    5. 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.
    6. Zhang, Ruiyou & Yun, Won Young & Moon, Il Kyeong, 2011. "Modeling and optimization of a container drayage problem with resource constraints," International Journal of Production Economics, Elsevier, vol. 133(1), pages 351-359, September.
    7. Kritikos, Manolis N. & Ioannou, George, 2010. "The balanced cargo vehicle routing problem with time windows," International Journal of Production Economics, Elsevier, vol. 123(1), pages 42-51, January.
    8. Escudero-Santana, Alejandro & Muñuzuri, Jesús & Cortés, Pablo & Onieva, Luis, 2021. "The one container drayage problem with soft time windows," Research in Transportation Economics, Elsevier, vol. 90(C).
    9. García, Javier & Florez, José E. & Torralba, Álvaro & Borrajo, Daniel & López, Carlos Linares & García-Olaya, Ángel & Sáenz, Juan, 2013. "Combining linear programming and automated planning to solve intermodal transportation problems," European Journal of Operational Research, Elsevier, vol. 227(1), pages 216-226.
    10. You, Jintao & Miao, Lixin & Zhang, Canrong & Xue, Zhaojie, 2020. "A generic model for the local container drayage problem using the emerging truck platooning operation mode," Transportation Research Part B: Methodological, Elsevier, vol. 133(C), pages 181-209.
    11. Zhang, Ruiyou & Lu, Jye-Chyi & Wang, Dingwei, 2014. "Container drayage problem with flexible orders and its near real-time solution strategies," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 61(C), pages 235-251.
    12. Monnerat, Filipe & Dias, Joana & Alves, Maria João, 2019. "Fleet management: A vehicle and driver assignment model," European Journal of Operational Research, Elsevier, vol. 278(1), pages 64-75.
    13. Najafi, Mehdi & Zolfagharinia, Hossein, 2021. "Pricing and quality setting strategy in maritime transportation: Considering empty repositioning and demand uncertainty," International Journal of Production Economics, Elsevier, vol. 240(C).
    14. You, Jintao & Wang, Yuan & Xue, Zhaojie, 2023. "An exact algorithm for the multi-trip container drayage problem with truck platooning," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 175(C).
    15. Xinan Yang & Hajem A. Daham, 2020. "A column generation-based decomposition and aggregation approach for combining orders in inland transportation of containers," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(1), pages 261-296, March.
    16. Li, Ming & Shao, Saijun & Li, Yang & Zhang, Hua & Zhang, Nianwu & He, Yandong, 2022. "A Physical Internet (PI) based inland container transportation problem with selective non-containerized shipping requests," International Journal of Production Economics, Elsevier, vol. 245(C).
    17. Nossack, Jenny & Pesch, Erwin, 2013. "A truck scheduling problem arising in intermodal container transportation," European Journal of Operational Research, Elsevier, vol. 230(3), pages 666-680.
    18. Xue, Zhaojie & Lin, Hui & You, Jintao, 2021. "Local container drayage problem with truck platooning mode," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 147(C).

    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. Lan, Guanghui & DePuy, Gail W. & Whitehouse, Gary E., 2007. "An effective and simple heuristic for the set covering problem," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1387-1403, February.
    2. Masoud Yaghini & Mohammad Karimi & Mohadeseh Rahbar, 2015. "A set covering approach for multi-depot train driver scheduling," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 636-654, April.
    3. Patrizia Beraldi & Andrzej Ruszczyński, 2002. "The Probabilistic Set-Covering Problem," Operations Research, INFORMS, vol. 50(6), pages 956-967, December.
    4. Owais, Mahmoud & Moussa, Ghada S. & Hussain, Khaled F., 2019. "Sensor location model for O/D estimation: Multi-criteria meta-heuristics approach," Operations Research Perspectives, Elsevier, vol. 6(C).
    5. Panitan Kewcharoenwong & Halit Üster, 2017. "Relay Network Design with Capacity and Link-Imbalance Considerations: A Lagrangean Decomposition Algorithm and Analysis," Transportation Science, INFORMS, vol. 51(4), pages 1177-1195, November.
    6. Nguyen, Tri-Dung, 2014. "A fast approximation algorithm for solving the complete set packing problem," European Journal of Operational Research, Elsevier, vol. 237(1), pages 62-70.
    7. Dimitris Bertsimas & Dan A. Iancu & Dmitriy Katz, 2013. "A New Local Search Algorithm for Binary Optimization," INFORMS Journal on Computing, INFORMS, vol. 25(2), pages 208-221, May.
    8. Naji-Azimi, Zahra & Toth, Paolo & Galli, Laura, 2010. "An electromagnetism metaheuristic for the unicost set covering problem," European Journal of Operational Research, Elsevier, vol. 205(2), pages 290-300, September.
    9. Herszterg, Ian & Ridouane, Yassine & Boland, Natashia & Erera, Alan & Savelsbergh, Martin, 2022. "Near real-time loadplan adjustments for less-than-truckload carriers," European Journal of Operational Research, Elsevier, vol. 301(3), pages 1021-1034.
    10. Jordi Pereira & Igor Averbakh, 2013. "The Robust Set Covering Problem with interval data," Annals of Operations Research, Springer, vol. 207(1), pages 217-235, August.
    11. Xueping Li & Zhaoxia Zhao & Xiaoyan Zhu & Tami Wyatt, 2011. "Covering models and optimization techniques for emergency response facility location and planning: a review," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 74(3), pages 281-310, December.
    12. Ibrahim, Walid & El-Sayed, Hesham & El-Chouemie, Amr & Amer, Hoda, 2009. "An adaptive heuristic algorithm for VLSI test vectors selection," European Journal of Operational Research, Elsevier, vol. 199(3), pages 630-639, December.
    13. Jans, Raf & Degraeve, Zeger, 2008. "A note on a symmetrical set covering problem: The lottery problem," European Journal of Operational Research, Elsevier, vol. 186(1), pages 104-110, April.
    14. Gao, Chao & Yao, Xin & Weise, Thomas & Li, Jinlong, 2015. "An efficient local search heuristic with row weighting for the unicost set covering problem," European Journal of Operational Research, Elsevier, vol. 246(3), pages 750-761.
    15. Youngho Lee & Hanif D. Sherali & Ikhyun Kwon & Seongin Kim, 2006. "A new reformulation approach for the generalized partial covering problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(2), pages 170-179, March.
    16. Maenhout, Broos & Vanhoucke, Mario, 2010. "A hybrid scatter search heuristic for personalized crew rostering in the airline industry," European Journal of Operational Research, Elsevier, vol. 206(1), pages 155-167, October.
    17. Rita Portugal & Helena Ramalhinho-Lourenço & José P. Paixao, 2006. "Driver scheduling problem modelling," Economics Working Papers 991, Department of Economics and Business, Universitat Pompeu Fabra.
    18. Helena R. Lourenço & José P. Paixão & Rita Portugal, 2001. "Multiobjective Metaheuristics for the Bus Driver Scheduling Problem," Transportation Science, INFORMS, vol. 35(3), pages 331-343, August.
    19. Halit Üster & Panitan Kewcharoenwong, 2011. "Strategic Design and Analysis of a Relay Network in Truckload Transportation," Transportation Science, INFORMS, vol. 45(4), pages 505-523, November.
    20. Ricardo S. Martins & Mauro Borges Lemos, 2006. "Corredor Centro-Leste: Sistemas De Transporte De Minas Gerais Na Perspectivas Dos Eixos De Desenvolvimento E Integração," Anais do XII Semin·rio sobre a Economia Mineira [Proceedings of the 12th Seminar on the Economy of Minas Gerais], in: João Antonio de Paula & et alli (ed.),Anais do XII Seminário sobre a Economia Mineira [Proceedings of the 12th Seminar on the Economy of Minas Gerais], Cedeplar, Universidade Federal de Minas Gerais.

    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:171:y:2006:i:3:p:776-786. 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.