Ferry service network design: optimal fleet size,routing, and scheduling |
| |
| Institution: | 1. Instituto Tecnológico y de Estudios Superiores de Monterrey, Monterrey Campus, Eugenio Garza Sada 2501, 64849 Monterrey, Mexico;2. Universitat Politècnica de Catalunya, FIB, Campus Nord, Building C5, 08034 Barcelona, Spain;3. Universidad Politécnica de Madrid, ETSI Aeronáuticos, Plaza Cardenal Cisneros, 3, 28040 Madrid, Spain;4. Pontificia Universidad Católica de Valparaíso, ITRA, 2147 Brasil Avenue, 2362804 Valparaíso, Chile;1. School of Management, Shandong University, Jinan, China;2. School of Earth and Ocean Sciences, University of Victoria, Victoria, Canada;3. Institute of Ocean Sciences, Fisheries and Oceans Canada, Sidney, Canada |
| |
| Abstract: | The 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. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
