AbstractThe study formulated a ferry network design problem by considering the optimal fleet size, routing, and scheduling for both direct and multi-stop services. The objective function combines both the operator and passengers’ performance measures. Mathematically, the model is formulated as a mixed integer multiple origin–destination network flow problem with ferry capacity constraints. To solve this problem of practical size, this study developed a heuristic algorithm that exploits the polynomial-time performance of shortest path algorithms. Two scenarios of ferry services in Hong Kong were solved to demonstrate the performance of the heuristic algorithm. The results showed that the heuristic produced solutions that were within 1.3% from the CPLEX optimal solutions. The computational time is within tens of seconds even for problem size that is beyond the capability of CPLEX.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Ferry service network design: optimal fleet size, routing, and scheduling


    Contributors:
    Lai, M.F. (author) / Lo, Hong K. (author)


    Publication date :

    2003-08-18


    Size :

    24 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Mixed-Fleet Ferry Routing and Scheduling

    Wang, Z.W. / Lo, H.K. / Lai, M.F. | British Library Conference Proceedings | 2008


    Mixed-Fleet Ferry Routing and Scheduling

    Wang, Z. W. / Lo, Hong K. / Lai, M. F. | Springer Verlag | 2008