{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T04:29:59Z","timestamp":1770956999976,"version":"3.50.1"},"reference-count":47,"publisher":"MDPI AG","issue":"8","license":[{"start":{"date-parts":[[2023,8,7]],"date-time":"2023-08-07T00:00:00Z","timestamp":1691366400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>Hub-and-Spoke (H&amp;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&amp;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.<\/jats:p>","DOI":"10.3390\/a16080379","type":"journal-article","created":{"date-parts":[[2023,8,7]],"date-time":"2023-08-07T06:38:48Z","timestamp":1691390328000},"page":"379","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Multi-Objective Tri-Level Algorithm for Hub-and-Spoke Network in Short Sea Shipping Transportation"],"prefix":"10.3390","volume":"16","author":[{"given":"Panagiotis","family":"Farmakis","sequence":"first","affiliation":[{"name":"Department of Civil Engineering, University of Patras, 26504 Patras, Greece"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9175-4390","authenticated-orcid":false,"given":"Athanasios","family":"Chassiakos","sequence":"additional","affiliation":[{"name":"Department of Civil Engineering, University of Patras, 26504 Patras, Greece"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8318-6100","authenticated-orcid":false,"given":"Stylianos","family":"Karatzas","sequence":"additional","affiliation":[{"name":"Department of Civil Engineering, University of Patras, 26504 Patras, Greece"}]}],"member":"1968","published-online":{"date-parts":[[2023,8,7]]},"reference":[{"key":"ref_1","unstructured":"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\u2014The Development of Short Sea Shipping in Europe: A Dynamic Alternative in a Sustainable Transport Chain\u2014Second Two-Yearly Progress Report, COM (Commission of the European Communities)."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1080\/01441647.2018.1502834","article-title":"Autonomous technologies in short sea shipping: Trends, feasibility and implications","volume":"39","author":"Ghaderi","year":"2019","journal-title":"Transp. Rev."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1287\/trsc.20.2.92","article-title":"The location of interacting hub facilities","volume":"20","year":"1986","journal-title":"Transp. Sci."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1111\/j.1538-4632.1986.tb00106.x","article-title":"Activity levels at hub facilities in interacting networks","volume":"18","year":"1986","journal-title":"Geogr. Anal."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S0377-2217(87)80007-3","article-title":"A quadratic integer program for the location of interacting hub facilities","volume":"32","year":"1987","journal-title":"Eur. J. Oper. Res."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF01434269","article-title":"Hub facility location with fixed costs","volume":"71","year":"1992","journal-title":"Reg. Sci."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/0377-2217(94)90318-2","article-title":"Integer programming formulations of discrete hub location problems","volume":"72","author":"Campbell","year":"1994","journal-title":"Eur. J. Oper. Res."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"923","DOI":"10.1287\/opre.44.6.923","article-title":"Hub location and the p-hub median problem","volume":"44","author":"Campbell","year":"1996","journal-title":"Oper. Res."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1016\/0377-2217(95)00100-X","article-title":"Tight linear programming relaxations of uncapacitated p-hub median problems","volume":"94","year":"1996","journal-title":"Eur. J. Oper. Res."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/S0966-8349(96)00011-3","article-title":"Efficient algorithms for the uncapacitated single allocation p-hub median problem","volume":"4","author":"Ernst","year":"1996","journal-title":"Locat. Sci."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/S0377-2217(96)00340-2","article-title":"Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem","volume":"104","author":"Ernst","year":"1998","journal-title":"Eur. J. Oper. Res."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1023\/A:1018994432663","article-title":"Solution algorithms for the capacitated single allocation hub location problem","volume":"86","author":"Ernst","year":"1999","journal-title":"Ann. Oper. Res."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0377-2217(99)00370-7","article-title":"Solving large single allocation p-hub problems with two or three hubs","volume":"128","author":"Ebery","year":"2001","journal-title":"Eur. J. Oper. Res."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.ejor.2006.06.056","article-title":"Two genetic algorithms for solving the uncapacitated single allocation p-hub median problem","volume":"182","author":"Kratica","year":"2007","journal-title":"Eur. J. Oper. Res."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1016\/S0377-2217(99)00274-X","article-title":"On the single-assignment p-hub center problem","volume":"125","author":"Kara","year":"2000","journal-title":"Eur. J. Oper. Res."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"2230","DOI":"10.1016\/j.cor.2008.08.021","article-title":"Uncapacitated single and multiple allocation p-hub center problems","volume":"36","author":"Ernst","year":"2009","journal-title":"Comput. Oper. Res."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"3143","DOI":"10.1016\/j.cor.2008.07.011","article-title":"A 2-phase algorithm for solving the single allocation p-hub center problem","volume":"36","author":"Meyer","year":"2009","journal-title":"Comput. Oper. Res."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/j.ejor.2010.02.022","article-title":"A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem","volume":"206","author":"Brimberg","year":"2010","journal-title":"Eur. J. Oper. Res."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1057\/palgrave.jors.2601473","article-title":"The single-assignment hub covering problem: Models and linearizations","volume":"54","author":"Kara","year":"2003","journal-title":"J. Oper. Res. Soc."},{"key":"ref_20","unstructured":"Ernst, A.T., Jiang, H., Krishnamoorthy, M., Baatar, D., and Judge, C. (CSIRO Math. Inf. Sci., 2005). Reformulations and computational results for uncapacitated single and multiple allocation hub covering problems, CSIRO Math. Inf. Sci., unpublished Report."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1016\/j.ejor.2011.02.018","article-title":"Stochastic uncapacitated hub location","volume":"212","author":"Contreras","year":"2011","journal-title":"Eur. J. Oper. Res."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"4841","DOI":"10.1016\/j.apm.2011.03.046","article-title":"Hub and spoke network design with single-assignment, capacity decisions and balancing requirements","volume":"35","author":"Correia","year":"2011","journal-title":"Appl. Math. Model."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/j.trb.2015.02.006","article-title":"The reliable hub-and-spoke design problem: Models and algorithms","volume":"77","author":"An","year":"2015","journal-title":"Transp. Res. Part B Methodol."},{"key":"ref_24","first-page":"405","article-title":"Solving uncapacitated multiple allocation p-hub center problem by Dijkstra\u2019s algorithm-based genetic algorithm and simulated annealing","volume":"6","author":"Rabbani","year":"2015","journal-title":"Int. J. Ind. Eng. Comput."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"1091","DOI":"10.1007\/s00170-014-6330-5","article-title":"Robust optimization approach to the design of hub-and-spoke networks","volume":"76","author":"Ghazanfari","year":"2015","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1016\/j.cor.2014.05.012","article-title":"The impact of hub failure in hub-and-spoke networks: Mathematical formulations and solution techniques","volume":"65","author":"Azizi","year":"2016","journal-title":"Comput. Oper. Res."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/j.trb.2017.06.008","article-title":"Robust uncapacitated hub location","volume":"106","author":"Zetina","year":"2017","journal-title":"Transp. Res. Part B Methodol."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1016\/j.tre.2016.10.001","article-title":"Planning and optimization of intermodal hub-and-spoke network under mixed uncertainty","volume":"95","author":"Yang","year":"2016","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/j.cor.2018.09.006","article-title":"The 2-allocation p-hub median problem and a modified Benders decomposition method for solving hub location problems","volume":"104","author":"Mokhtar","year":"2019","journal-title":"Comput. Oper. Res."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"1377","DOI":"10.1016\/j.jclepro.2019.04.188","article-title":"Green hub-and-spoke network design for aviation industry","volume":"229","author":"Parsa","year":"2019","journal-title":"J. Clean. Prod."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1287\/trsc.2016.0679","article-title":"Reliable hub network design: Formulation and solution techniques","volume":"51","author":"Tran","year":"2017","journal-title":"Transp. Sci."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10479-017-2656-3","article-title":"Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion","volume":"264","author":"Azizi","year":"2018","journal-title":"Ann. Oper. Res."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/j.trc.2018.12.011","article-title":"A Lagrangian heuristic and GRASP for the hub-and-spoke network system with economies-of-scale and congestion","volume":"102","author":"Alkaabneh","year":"2019","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"102069","DOI":"10.1016\/j.tre.2020.102069","article-title":"Hub-and-spoke network design under congestion: A learning based metaheuristic","volume":"142","author":"Mohammadi","year":"2020","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1016\/j.tre.2008.05.001","article-title":"Containership routing with time deadlines and simultaneous deliveries and pickups","volume":"45","author":"Karlaftis","year":"2009","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"740","DOI":"10.1016\/j.tre.2009.01.002","article-title":"Multi-port vs. Hub-and-Spoke port calls by containerships","volume":"45","author":"Imai","year":"2009","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.retrec.2011.06.010","article-title":"Spatial pattern of the global shipping network and its hub-and-spoke system","volume":"32","author":"Wang","year":"2011","journal-title":"Res. Transp. Econ."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"991","DOI":"10.1016\/j.tre.2010.05.005","article-title":"Liner shipping hub network design in a competitive environment","volume":"46","author":"Gelareh","year":"2010","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"947","DOI":"10.1016\/j.tre.2011.03.002","article-title":"Fleet deployment, network design and hub location of liner shipping companies","volume":"47","author":"Gelareh","year":"2011","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/j.tre.2014.12.014","article-title":"Liner hub-and-spoke shipping network design","volume":"75","author":"Zheng","year":"2015","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1080\/03088839.2017.1396505","article-title":"The role of dry port in hub-and-spoke network under Belt and Road Initiative","volume":"45","author":"Wei","year":"2018","journal-title":"Marit. Policy Manag."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/s12063-022-00315-2","article-title":"Research on strategic liner ship fleet planning with regard to hub-and-spoke network","volume":"16","author":"Bai","year":"2023","journal-title":"Oper. Manag. Res."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"106847","DOI":"10.1016\/j.cie.2020.106847","article-title":"Design and optimisation of an innovative Two-Hub-and-Spoke network for the Mediterranean Short-Sea-Shipping market","volume":"149","author":"Fadda","year":"2020","journal-title":"Comput. Ind. Eng."},{"key":"ref_44","first-page":"673","article-title":"A multi-objective mathematical model to select fleets and maritime routes in short sea shipping: A case study in Chile","volume":"26","year":"2020","journal-title":"J. Mar. Sci. Technol."},{"key":"ref_45","doi-asserted-by":"crossref","unstructured":"Medb\u00f8en, C.A.B., Holm, M.B., Msakni, M.K., Fagerholt, K., and Sch\u00fctz, P. (2020). Combining Optimization and Simulation for Designing a Robust Short-Sea Feeder Network. Algorithms, 13.","DOI":"10.3390\/a13110304"},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.marpol.2018.11.031","article-title":"An examination of trans-Arctic vessel routing in the Central Arctic Ocean","volume":"100","author":"Stevenson","year":"2019","journal-title":"Mar. Policy"},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"106326","DOI":"10.1016\/j.ocecoaman.2022.106326","article-title":"Quantifying Arctic oil spilling event risk by integrating an analytic network process and a fuzzy comprehensive evaluation model","volume":"228","author":"Chen","year":"2022","journal-title":"Ocean Coast. Manag."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/16\/8\/379\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T20:26:58Z","timestamp":1760128018000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/16\/8\/379"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,7]]},"references-count":47,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2023,8]]}},"alternative-id":["a16080379"],"URL":"https:\/\/doi.org\/10.3390\/a16080379","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,7]]}}}