Affiliation:
1. Department of Civil Engineering, University of Patras, 26504 Patras, Greece
Abstract
Hub-and-Spoke (H&S) network modeling is a form of transport topology optimization in which network joins are connected through intermediate hub nodes. The Short Sea Shipping (SSS) problem aims to efficiently disperse passenger flows involving multiple vessel routes and intermediary hubs through which passengers are transferred to their final destination. The problem contains elements of the Hub-and-Spoke and Travelling Salesman, with different levels of passenger flows among islands, making it more demanding than the typical H&S one, as the hub selection within nodes and the shortest routes among islands are internal optimization goals. This work introduces a multi-objective tri-level optimization algorithm for the General Network of Short Sea Shipping (GNSSS) problem to reduce travel distances and transportation costs while improving travel quality and user satisfaction, mainly by minimizing passenger hours spent on board. The analysis is performed at three levels of decisions: (a) the hub node assignment, (b) the island-to-line assignment, and (c) the island service sequence within each line. Due to the magnitude and complexity of the problem, a genetic algorithm is employed for the implementation. The algorithm performance has been tested and evaluated through several real and simulated case studies of different sizes and operational scenarios. The results indicate that the algorithm provides rational solutions in accordance with the desired sub-objectives. The multi-objective consideration leads to solutions that are quite scattered in the solution space, indicating the necessity of employing formal optimization methods. Typical Pareto diagrams present non-dominated solutions varying at a range of 30 percent in terms of the total distance traveled and more than 50 percent in relation to the cumulative passenger hours. Evaluation results further indicate satisfactory algorithm performance in terms of result stability (repeatability) and computational time requirements. In conclusion, the work provides a tool for assisting network operation and transport planning decisions by shipping companies in the directions of cost reduction and traveler service upgrade. In addition, the model can be adapted to other applications in transportation and in the supply chain.
Subject
Computational Mathematics,Computational Theory and Mathematics,Numerical Analysis,Theoretical Computer Science
Reference47 articles.
1. COM (Commission of the European Communities) (1999). Communication from the Commission to the Council, the European Parliament, the Economic and Social Committee and the Committee of the Regions—The Development of Short Sea Shipping in Europe: A Dynamic Alternative in a Sustainable Transport Chain—Second Two-Yearly Progress Report, COM (Commission of the European Communities).
2. Autonomous technologies in short sea shipping: Trends, feasibility and implications;Ghaderi;Transp. Rev.,2019
3. The location of interacting hub facilities;Transp. Sci.,1986
4. Activity levels at hub facilities in interacting networks;Geogr. Anal.,1986
5. A quadratic integer program for the location of interacting hub facilities;Eur. J. Oper. Res.,1987