Advertisement

An Integer Programming Model for the Ferry Scheduling Problem

  • Daniel KarapetyanEmail author
  • Abraham P. Punnen
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 212)

Abstract

Routing and scheduling of public transport vehicles and other commercial vehicles is one of the most extensively studied areas in the operations research literature. Such problems include airline scheduling, scheduling of passenger and freight trains, transit bus routing and scheduling, and a variety of other vehicle routing problems. The routing and scheduling of passenger ferries is yet another problem in this class that received relatively little attention. In this chapter we discuss two integer programming models for finding optimal routes and schedules for the ferries so that the travel demands emanating at the ports at different periods of the planning horizon are satisfied while operating costs and passenger dissatisfaction are kept at a minimum.

Keywords

Planning Horizon Flow Network Travel Demand Integer Programming Model Compact Model 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Notes

Acknowledgment

We are thankful to Steve Anderson and Peter Simpson at BC Ferries for their help and support in this work. Comments of Katta G. Murty, editor of this book, improved the presentation of this chapter. This work was partially supported by BC Ferries and MITACS. The chapter is primarily based on our research paper [7], but it also includes additional new material and experimental results.

Supplementary material

273578_1_En_22_MOESM1_ESM.pdf (110 kb)
(pdf 110 KB)

References

  1. 1.
    Ahuja, R. K., Orlin, J. B., & Magnanti, T. L. (1993). Network flows: Theory, algorithms, and applications. Upper Saddle River: Prentice Hall.Google Scholar
  2. 2.
    Bixby, R. E. (2010). Mixed-integer programming: it works better than you may think. FERC Conference, Washington: DC.Google Scholar
  3. 3.
    Ceder, A. (2003). Designing public transport network and routes. In W. Lam and M. Bell (eds.), Advanced modeling for transit operations and service planning. Amsterdam: Elsevier.Google Scholar
  4. 4.
    Goetschalckx, M. (2011). International series in operations research & management science. Supply chain engineering. Berlin: Springer.Google Scholar
  5. 5.
    Gopalan, R., & Talluri, K. T. (1998). Mathematical models in airline schedule planning: A survey. Annals of Operations Research, 76, 155–185.CrossRefGoogle Scholar
  6. 6.
    Hvattum, L. M., Lokketangen, A., & Glover, F. (2012). Comparisons of commercial MIP solvers and an adaptive memory (tabu search) procedure for a class of 0-1 integer programming problems. Algorithmic Operations Research, 7, 13–20.Google Scholar
  7. 7.
    Karapetyan, D., & Punnen, A. P. (2013). A reduced integer programming model for the ferry scheduling problem. Public Transport, 4, 151–163.CrossRefGoogle Scholar
  8. 8.
    Khairy Adly Wan Zaimi, W. M., Abu, M. S., Junoh, A. K., Ariffin, W. N. M. (2011). Ferry scheduling model using linear programming technique. In 2011 3rd International Conference on Computer Research and Development (ICCRD) (pp. 337–341), vol. 4, 11–13 March 2011Google Scholar
  9. 9.
    Koch, T., Achterberg, T., Anderson, E., Bastert, O., Berthold, T. Bixby, R. E., Danna, E., Gamrath, G., Gleixner, A. M., Heinz, S., Lodi, A., Mittelmann, H., Ralphs, T., Salvagnin, D., Steffy, D. E., & Wolter, K. (2011). MILP 2010: Mixed integer programming library version 5. Mathematical Programming Computation, 3, 103–163.CrossRefGoogle Scholar
  10. 10.
    Lai, M. F., Lo, H. K. (2004). Ferry service network design: Optimal fleet size, routing, and scheduling. Transportation Research Part A: Policy and Practice, 38, 305–328.Google Scholar
  11. 11.
    Linderoth, J. T., & Lodi, A. (2011). MILP software. In J. J. Cochrane (Ed.), Wiley Encyclopedia of Operations Research and Management Science. Hoboken: Wiley.Google Scholar
  12. 12.
    Lodi, A. (2012). MIP computation and beyond. Technical report ARRIVAL-TR-0229.Google Scholar
  13. 13.
    Mitrovic-Minic, S., & Punnen, A. P.. (2011). Routing and scheduling of a heterogeneous fleet of re-configurable ferries: A model, a heuristic, and a case study. In OR 2011 - International Conference on Operations Research, Zurich, Switzerland, 2011.Google Scholar
  14. 14.
    Murty, K. G.. (1992). Network programming. Upper Saddle River: Prentice Hall.Google Scholar
  15. 15.
    Toth, P., & Vigo, D. (2002). The vehicle routing problem. Philadelphia: SIAM.CrossRefGoogle Scholar
  16. 16.
    Voß, S., & Daduna, J. R. (Eds.) (2001). Springer lecture notes in economics and mathematical systems, vol. 505. Computer-aided scheduling of public transport. Berlin: Springer.Google Scholar
  17. 17.
    Wang, Z. W., Lo, H., & Lai, M. F. (2008). Mixed-fleet ferry routing and scheduling. In M. Hickman, P. Mirchandani, and S. Voss (Eds.), Lecture notes in economics and mathematical systems 600. Computer-aided systems in public transport (pp. 181–194). Berlin: Springer.Google Scholar
  18. 18.
    Wang, D. Z. W., & Lo, H. K. (2008). Multi-fleet ferry service network design with passenger preferences for differential services. Transportation Research Part B, 42, 798–822.CrossRefGoogle Scholar
  19. 19.
    Yan, S., Chen, C.-H., Chen, H.-Y., & Lou, T.-C. (2007). Optimal scheduling models for ferry companies under alliances. Journal of Marine Science and Technology, 15, 53–66.Google Scholar

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  1. 1.ASAP Research Group, School of Computer ScienceUniversity of NottinghamNottinghamUK
  2. 2.Department of MathematicsSimon Fraser UniversitySurreyCanada

Personalised recommendations