IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v132y2020icp15-28.html
   My bibliography  Save this article

An entropy maximizing approach to the ferry network design problem

Author

Listed:
  • Bell, Michael G.H.
  • Pan, Jing-Jing
  • Teye, Collins
  • Cheung, Kam-Fung
  • Perera, Supun

Abstract

This paper proposes a novel method to address the ferry network design problem (FNDP). Ferry transport is an increasingly important component of public transport, providing mobility for people in large cities with harbours or rivers. It is therefore important that ferry networks are well designed. The connections between ferry stations and the locations of hubs that are optimal for passengers are revealed by the maximum passenger utility spanning tree connecting all ferry stations. This paper harnesses the equivalence between entropy maximisation and utility maximisation to find the maximum passenger utility spanning tree which connects all ferry stations. A small example with five ferry stations illustrates how the spanning tree topology responds to the pattern of passenger demand. Two heuristics for solving the problem are compared for the Sydney Harbour ferry network with 36 ferry stations. One heuristic reveals the most important connections between ferry stations from a passenger perspective. The use of maximum passenger utility spanning trees for ferry network design is discussed.

Suggested Citation

  • Bell, Michael G.H. & Pan, Jing-Jing & Teye, Collins & Cheung, Kam-Fung & Perera, Supun, 2020. "An entropy maximizing approach to the ferry network design problem," Transportation Research Part B: Methodological, Elsevier, vol. 132(C), pages 15-28.
    • Handle: RePEc:eee:transb:v:132:y:2020:i:c:p:15-28
    DOI: 10.1016/j.trb.2019.02.006
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191261518310245
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.trb.2019.02.006?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. Spiess, Heinz & Florian, Michael, 1989. "Optimal strategies: A new assignment model for transit networks," Transportation Research Part B: Methodological, Elsevier, vol. 23(2), pages 83-102, April.
    2. Teye, Collins & Bell, Michael G H & Bliemer, Michiel C J, 2017. "Urban intermodal terminals: The entropy maximising facility location problem," Transportation Research Part B: Methodological, Elsevier, vol. 100(C), pages 64-81.
    3. Wang, Shuaian, 2013. "Essential elements in tactical planning models for container liner shipping," Transportation Research Part B: Methodological, Elsevier, vol. 54(C), pages 84-99.
    4. T. L. Magnanti & R. T. Wong, 1984. "Network Design and Transportation Planning: Models and Algorithms," Transportation Science, INFORMS, vol. 18(1), pages 1-55, February.
    5. An, Kun & Lo, Hong K., 2014. "Ferry service network design with stochastic demand under user equilibrium flows," Transportation Research Part B: Methodological, Elsevier, vol. 66(C), pages 70-89.
    6. Lo, Hong K. & An, Kun & Lin, Wei-hua, 2013. "Ferry service network design under demand uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 59(C), pages 48-70.
    7. Train,Kenneth E., 2009. "Discrete Choice Methods with Simulation," Cambridge Books, Cambridge University Press, number 9780521766555.
    8. Wang, David Z.W. & Lo, Hong K., 2008. "Multi-fleet ferry service network design with passenger preferences for differential services," Transportation Research Part B: Methodological, Elsevier, vol. 42(9), pages 798-822, November.
    9. Wang, David Z.W. & Lo, Hong K., 2010. "Global optimum of the linearized network design problem with equilibrium flows," Transportation Research Part B: Methodological, Elsevier, vol. 44(4), pages 482-492, May.
    10. Wang, David Z.W. & Liu, Haoxiang & Szeto, W.Y., 2015. "A novel discrete network design problem formulation and its global optimization solution algorithm," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 79(C), pages 213-230.
    11. Lai, M. F. & Lo, Hong K., 2004. "Ferry service network design: optimal fleet size, routing, and scheduling," Transportation Research Part A: Policy and Practice, Elsevier, vol. 38(4), pages 305-328, May.
    12. Akamatsu, Takashi, 1996. "Cyclic flows, Markov process and stochastic traffic assignment," Transportation Research Part B: Methodological, Elsevier, vol. 30(5), pages 369-386, October.
    13. Luathep, Paramet & Sumalee, Agachai & Lam, William H.K. & Li, Zhi-Chun & Lo, Hong K., 2011. "Global optimization method for mixed transportation network design problem: A mixed-integer linear programming approach," Transportation Research Part B: Methodological, Elsevier, vol. 45(5), pages 808-827, June.
    14. Wang, Shuaian & Meng, Qiang & Yang, Hai, 2013. "Global optimization methods for the discrete network design problem," Transportation Research Part B: Methodological, Elsevier, vol. 50(C), pages 42-60.
    15. Crainic, Teodor Gabriel, 2000. "Service network design in freight transportation," European Journal of Operational Research, Elsevier, vol. 122(2), pages 272-288, April.
    16. Teye, Collins & Bell, Michael G.H. & Bliemer, Michiel C.J., 2017. "Entropy maximising facility location model for port city intermodal terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 100(C), pages 1-16.
    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. Yan, Ran & Wang, Shuaian & Fagerholt, Kjetil, 2020. "A semi-“smart predict then optimize” (semi-SPO) method for efficient ship inspection," Transportation Research Part B: Methodological, Elsevier, vol. 142(C), pages 100-125.
    2. Yan, Ran & Wang, Shuaian & Cao, Jiannong & Sun, Defeng, 2021. "Shipping Domain Knowledge Informed Prediction and Optimization in Port State Control," Transportation Research Part B: Methodological, Elsevier, vol. 149(C), pages 52-78.
    3. Aslaksen, Ingvild Eide & Svanberg, Elisabeth & Fagerholt, Kjetil & Johnsen, Lennart C. & Meisel, Frank, 2021. "A combined dial-a-ride and fixed schedule ferry service for coastal cities," Transportation Research Part A: Policy and Practice, Elsevier, vol. 153(C), pages 306-325.

    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. An, Kun & Lo, Hong K., 2015. "Robust transit network design with stochastic demand considering development density," Transportation Research Part B: Methodological, Elsevier, vol. 81(P3), pages 737-754.
    2. An, Kun & Lo, Hong K., 2014. "Ferry service network design with stochastic demand under user equilibrium flows," Transportation Research Part B: Methodological, Elsevier, vol. 66(C), pages 70-89.
    3. Ng, ManWo & Lo, Hong K., 2016. "Robust models for transportation service network design," Transportation Research Part B: Methodological, Elsevier, vol. 94(C), pages 378-386.
    4. Liu, Jiangtao & Zhou, Xuesong, 2016. "Capacitated transit service network design with boundedly rational agents," Transportation Research Part B: Methodological, Elsevier, vol. 93(PA), pages 225-250.
    5. Tong, Lu & Zhou, Xuesong & Miller, Harvey J., 2015. "Transportation network design for maximizing space–time accessibility," Transportation Research Part B: Methodological, Elsevier, vol. 81(P2), pages 555-576.
    6. Liang, Jinpeng & Wu, Jianjun & Gao, Ziyou & Sun, Huijun & Yang, Xin & Lo, Hong K., 2019. "Bus transit network design with uncertainties on the basis of a metro network: A two-step model framework," Transportation Research Part B: Methodological, Elsevier, vol. 126(C), pages 115-138.
    7. Tan, Zhijia & Yang, Hai & Tan, Wei & Li, Zhichun, 2016. "Pareto-improving transportation network design and ownership regimes," Transportation Research Part B: Methodological, Elsevier, vol. 91(C), pages 292-309.
    8. Sun, Yanshuo & Schonfeld, Paul, 2015. "Stochastic capacity expansion models for airport facilities," Transportation Research Part B: Methodological, Elsevier, vol. 80(C), pages 1-18.
    9. Aslaksen, Ingvild Eide & Svanberg, Elisabeth & Fagerholt, Kjetil & Johnsen, Lennart C. & Meisel, Frank, 2021. "A combined dial-a-ride and fixed schedule ferry service for coastal cities," Transportation Research Part A: Policy and Practice, Elsevier, vol. 153(C), pages 306-325.
    10. Qingyun Tian & Yun Hui Lin & David Z. W. Wang, 2021. "Autonomous and conventional bus fleet optimization for fixed-route operations considering demand uncertainty," Transportation, Springer, vol. 48(5), pages 2735-2763, October.
    11. Tian, Qingyun & Wang, David Z.W. & Lin, Yun Hui, 2021. "Service operation design in a transit network with congested common lines," Transportation Research Part B: Methodological, Elsevier, vol. 144(C), pages 81-102.
    12. Škurić, Maja & Maraš, Vladislav & Davidović, Tatjana & Radonjić, Aleksandar, 2021. "Optimal allocating and sizing of passenger ferry fleet in maritime transport," Research in Transportation Economics, Elsevier, vol. 90(C).
    13. Hua Wang & Xiaoning Zhang, 2017. "Game theoretical transportation network design among multiple regions," Annals of Operations Research, Springer, vol. 249(1), pages 97-117, February.
    14. Li, Xiangyong & Ding, Yi & Pan, Kai & Jiang, Dapei & Aneja, Y.P., 2020. "Single-path service network design problem with resource constraints," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 140(C).
    15. Liu, Haoxiang & Szeto, W.Y. & Long, Jiancheng, 2019. "Bike network design problem with a path-size logit-based equilibrium constraint: Formulation, global optimization, and matheuristic," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 127(C), pages 284-307.
    16. Arash Kaviani & Russell G. Thompson & Abbas Rajabifard & Majid Sarvi, 2020. "A model for multi-class road network recovery scheduling of regional road networks," Transportation, Springer, vol. 47(1), pages 109-143, February.
    17. Wang, David Z.W. & Liu, Haoxiang & Szeto, W.Y., 2015. "A novel discrete network design problem formulation and its global optimization solution algorithm," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 79(C), pages 213-230.
    18. Kang, Jee Eun & Chow, Joseph Y.J. & Recker, Will W., 2013. "On activity-based network design problems," Transportation Research Part B: Methodological, Elsevier, vol. 57(C), pages 398-418.
    19. Zhang, Fang & Lu, Jian & Hu, Xiaojian & Meng, Qiang, 2023. "Integrated deployment of dedicated lane and roadside unit considering uncertain road capacity under the mixed-autonomy traffic environment," Transportation Research Part B: Methodological, Elsevier, vol. 174(C).
    20. Nayan, Ashish & Wang, David Z.W., 2017. "Optimal bus transit route packaging in a privatized contracting regime," Transportation Research Part A: Policy and Practice, Elsevier, vol. 97(C), pages 146-157.

    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:transb:v:132:y:2020:i:c:p:15-28. 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/wps/find/journaldescription.cws_home/548/description#description .

    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.