IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v61y2010i7d10.1057_jors.2009.78.html
   My bibliography  Save this article

Dynamic scheduling of recreational rental vehicles with revenue management extensions

Author

Listed:
  • A T Ernst

    (CSIRO Mathematical and Information Sciences)

  • M Horn

    (CSIRO Mathematical and Information Sciences)

  • P Kilby

    (National ICT Australia)

  • M Krishnamoorthy

    (Monash University)

Abstract

The rental fleet scheduling problem (RFSP) arises in vehicle-rental operations that offer a wide variety of vehicle types to customers, and allow a rented vehicle to ‘migrate’ to a setdown depot other than the pickup depot. When there is a shortage of vehicles of a particular type at a depot, vehicles may be relocated to that depot, or vehicles of similar types may be substituted. The RFSP involves assigning vehicles to rentals so as to minimise the costs of these operations, and arises in both static and online contexts. The authors have adapted a well-known assignment algorithm for application in the online context. In addition, a network-flow algorithm with more comprehensive coverage of problem conditions is used to investigate the determination of rental pricing using revenue management principles. The paper concludes with an outline of the algorithms’ use in supporting the operations of a large recreational vehicle rental company.

Suggested Citation

  • A T Ernst & M Horn & P Kilby & M Krishnamoorthy, 2010. "Dynamic scheduling of recreational rental vehicles with revenue management extensions," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(7), pages 1133-1143, July.
    • Handle: RePEc:pal:jorsoc:v:61:y:2010:i:7:d:10.1057_jors.2009.78
    DOI: 10.1057/jors.2009.78
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/jors.2009.78
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/jors.2009.78?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. Dumas, Yvan & Desrosiers, Jacques & Soumis, Francois, 1991. "The pickup and delivery problem with time windows," European Journal of Operational Research, Elsevier, vol. 54(1), pages 7-22, September.
    2. Irina Ioachim & Jacques Desrosiers & Yvan Dumas & Marius M. Solomon & Daniel Villeneuve, 1995. "A Request Clustering Algorithm for Door-to-Door Handicapped Transportation," Transportation Science, INFORMS, vol. 29(1), pages 63-78, February.
    3. Lloyd Clarke & Ellis Johnson & George Nemhauser & Zhongxi Zhu, 1997. "The aircraft rotation problem," Annals of Operations Research, Springer, vol. 69(0), pages 33-46, January.
    4. Martin Savelsbergh & Marc Sol, 1998. "Drive: Dynamic Routing of Independent Vehicles," Operations Research, INFORMS, vol. 46(4), pages 474-490, August.
    5. Desaulniers, Guy & Lavigne, June & Soumis, Francois, 1998. "Multi-depot vehicle scheduling problems with time windows and waiting costs," European Journal of Operational Research, Elsevier, vol. 111(3), pages 479-494, December.
    6. Fink, Andreas & Reiners, Torsten, 2006. "Modeling and solving the short-term car rental logistics problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 42(4), pages 272-292, July.
    7. R H Currie & S Salhi, 2003. "Exact and heuristic methods for a full-load, multi-terminal, vehicle scheduling problem with backhauling and time windows," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(4), pages 390-400, April.
    8. Ram Gopalan & Kalyan Talluri, 1998. "Mathematical models in airline schedule planning: A survey," Annals of Operations Research, Springer, vol. 76(0), pages 155-185, January.
    9. T C Botimer & P P Belobaba, 1999. "Airline pricing and fare product differentiation: A new theoretical framework," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(11), pages 1085-1097, November.
    10. A H Ahmed & C A Poojari, 2008. "An overview of the issues in the airline industry and the role of optimization models and algorithms," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(3), pages 267-277, March.
    Full references (including those not matched with items on IDEAS)

    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. Xiang, Zhihai & Chu, Chengbin & Chen, Haoxun, 2006. "A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints," European Journal of Operational Research, Elsevier, vol. 174(2), pages 1117-1139, October.
    2. Diana, Marco & Dessouky, Maged M., 2004. "A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 38(6), pages 539-557, July.
    3. Sarac, Abdulkadir & Batta, Rajan & Rump, Christopher M., 2006. "A branch-and-price approach for operational aircraft maintenance routing," European Journal of Operational Research, Elsevier, vol. 175(3), pages 1850-1869, December.
    4. Le-Anh, T. & de Koster, M.B.M. & Yu, Y., 2006. "Performance Evaluation of Real-time Scheduling Approaches in Vehicle-based Internal Transport Systems," ERIM Report Series Research in Management ERS-2006-063-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    5. Hang Xu & Zhi-Long Chen & Srinivas Rajagopal & Sundar Arunapuram, 2003. "Solving a Practical Pickup and Delivery Problem," Transportation Science, INFORMS, vol. 37(3), pages 347-364, August.
    6. Quan Lu & Maged Dessouky, 2004. "An Exact Algorithm for the Multiple Vehicle Pickup and Delivery Problem," Transportation Science, INFORMS, vol. 38(4), pages 503-514, November.
    7. Mahmoudi, Monirehalsadat & Chen, Junhua & Shi, Tie & Zhang, Yongxiang & Zhou, Xuesong, 2019. "A cumulative service state representation for the pickup and delivery problem with transfers," Transportation Research Part B: Methodological, Elsevier, vol. 129(C), pages 351-380.
    8. Cortés, Cristián E. & Matamala, Martín & Contardo, Claudio, 2010. "The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method," European Journal of Operational Research, Elsevier, vol. 200(3), pages 711-724, February.
    9. Mahmoudi, Monirehalsadat & Zhou, Xuesong, 2016. "Finding optimal solutions for vehicle routing problem with pickup and delivery services with time windows: A dynamic programming approach based on state–space–time network representations," Transportation Research Part B: Methodological, Elsevier, vol. 89(C), pages 19-42.
    10. Le-Anh, T. & de Koster, M.B.M., 2004. "Real-Time Scheduling Approaches for Vehicle-Based Internal Transport Systems," ERIM Report Series Research in Management ERS-2004-056-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    11. Ali Mehsin Alyasiry & Michael Forbes & Michael Bulmer, 2019. "An Exact Algorithm for the Pickup and Delivery Problem with Time Windows and Last-in-First-out Loading," Transportation Science, INFORMS, vol. 53(6), pages 1695-1705, November.
    12. Lu, Quan & Dessouky, Maged M., 2006. "A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows," European Journal of Operational Research, Elsevier, vol. 175(2), pages 672-687, December.
    13. Francis, Peter & Zhang, Guangming & Smilowitz, Karen, 2007. "Improved modeling and solution methods for the multi-resource routing problem," European Journal of Operational Research, Elsevier, vol. 180(3), pages 1045-1059, August.
    14. Jansen, Benjamin & Swinkels, Pieter C. J. & Teeuwen, Geert J. A. & van Antwerpen de Fluiter, Babette & Fleuren, Hein A., 2004. "Operational planning of a large-scale multi-modal transportation system," European Journal of Operational Research, Elsevier, vol. 156(1), pages 41-53, July.
    15. Le-Anh, T. & de Koster, M.B.M., 2004. "A Review Of Design And Control Of Automated Guided Vehicle Systems," ERIM Report Series Research in Management ERS;2004-030-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    16. Zheng, Jianfeng & Meng, Qiang & Sun, Zhuo, 2014. "Impact analysis of maritime cabotage legislations on liner hub-and-spoke shipping network design," European Journal of Operational Research, Elsevier, vol. 234(3), pages 874-884.
    17. Regnier-Coudert, Olivier & McCall, John & Ayodele, Mayowa & Anderson, Steven, 2016. "Truck and trailer scheduling in a real world, dynamic and heterogeneous context," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 93(C), pages 389-408.
    18. Jean-François Cordeau, 2006. "A Branch-and-Cut Algorithm for the Dial-a-Ride Problem," Operations Research, INFORMS, vol. 54(3), pages 573-586, June.
    19. Sun, Yanshuo & Chen, Zhi-Long & Zhang, Lei, 2020. "Nonprofit peer-to-peer ridesharing optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    20. Han Zheng & Junhua Chen & Xingchen Zhang & Zixian Yang, 2019. "Designing a New Shuttle Service to Meet Large-Scale Instantaneous Peak Demands for Passenger Transportation in a Metropolitan Context: A Green, Low-Cost Mass Transport Option," Sustainability, MDPI, vol. 11(18), pages 1-28, September.

    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:pal:jorsoc:v:61:y:2010:i:7:d:10.1057_jors.2009.78. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    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.