Nalazite se na CroRIS probnoj okolini. Ovdje evidentirani podaci neće biti pohranjeni u Informacijskom sustavu znanosti RH. Ako je ovo greška, CroRIS produkcijskoj okolini moguće je pristupi putem poveznice www.croris.hr
izvor podataka: crosbi !

Adriatic Sea Hub Ports Feeder Service Optimization Using Multi-Criteria Decision-Making Methods (CROSBI ID 300551)

Prilog u časopisu | izvorni znanstveni rad | međunarodna recenzija

Medić, Dario ; Krile, Srećko ; Jelaska, Igor ; Bošnjak, Rino Adriatic Sea Hub Ports Feeder Service Optimization Using Multi-Criteria Decision-Making Methods // Sustainability, 13 (2021), 21; 12325, 12. doi: 10.3390/su132112325

Podaci o odgovornosti

Medić, Dario ; Krile, Srećko ; Jelaska, Igor ; Bošnjak, Rino

engleski

Adriatic Sea Hub Ports Feeder Service Optimization Using Multi-Criteria Decision-Making Methods

From a scientific viewpoint, as well as from the perspective of navigation practice, it is clear that the Adriatic Sea feeder service is relatively underdeveloped. Hence, the objective of this study is to suggest a model for selecting the hub port and to optimize the network of seaports engaged in the feeder service. Accordingly, an appropriate hub port has been identified through the methods of multi-criteria decision making and expert assessment, and the optimum shipping route has been calculated by applying the travelling salesman algorithm (TSA). In order to analyze whether there is a possibility of obtaining better optimization results, an integration of a sub-hub port system is suggested. Optimization has been achieved by applying a minimum spanning tree algorithm (MST) and a combination of these algorithms. The proposed methodology for selecting the hub port, sub-hub port and optimizing the feeder network can be implemented globally. The practical application of the achieved model would result in cost minimization, owing to shorter shipping routes or a combination of different transportation means (feeders).

feeder service ; feeder port ; hub port ; travelling salesman algorithm ; minimum spanning tree

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

Podaci o izdanju

13 (21)

2021.

12325

12

objavljeno

2071-1050

10.3390/su132112325

Povezanost rada

Tehnologija prometa i transport

Poveznice
Indeksiranost