Routing searching algorithm for combined freight transport trips in South East Europe region
Initially the characteristics of combined freight transport such as main operations, network formulation and design issues are reviewed. South East Europe region plays a key important role to cargo movement due to its geographical position. For this reason, an examination about the state of the curr...
Αποθηκεύτηκε σε:
| Κύριος συγγραφέας: | |
|---|---|
| Άλλοι συγγραφείς: | |
| Γλώσσα: | en_US |
| Δημοσίευση: |
2017
|
| Θέματα: | |
| Διαθέσιμο Online: | http://hdl.handle.net/11610/17367 |
| Ετικέτες: |
Προσθήκη ετικέτας
Δεν υπάρχουν, Καταχωρήστε ετικέτα πρώτοι!
|
| _version_ | 1828460603346255872 |
|---|---|
| author | Οταπασίδης, Παναγιώτης |
| author2 | Ζεϊμπέκης, Βασίλειος |
| author_sort | Οταπασίδης, Παναγιώτης |
| collection | DSpace |
| description | Initially the characteristics of combined freight transport such as main operations, network formulation and design issues are reviewed. South East Europe region plays a key important role to cargo movement due to its geographical position. For this reason, an examination about the state of the current infrastructure and a further analysis about freight transport operations, which are excecuted either road, rail, or inland waterway (IWW), is implemented. Subsequently, a combined freight transport classification model is presented and analyzed based on the existing literature. This model encompasses all main aspects of a typical model such as actors and key players, regulations and policies, infrastructure, environment and Information and Communication Technologies (ICT). Furthermore, (a) different freight transportation routes for cargo movement within the SEE area are assessed and (b) the optimal solution per case based on the criteria set is identified. To this end, an application of an extension of Dijkstra’s algorithm that identifies the optimal way of cargo movement based on transportation cost, trip duration and CO2 emissions. The proposed algorithm was applied in real-life data and identifing the optimal transportation mode for cases where (a) goods should cross 2 or 3 SEE countries respectively, (b) goods should cover a distance more or less than 500 kilometers respectively, and (c) goods with origin the Port of Piraeus and destination four capital cities of SEE (Sofia, Bucharest, Budapest, and Ljubljana respectively). The results show that the use of road transport is the most convenient solution if trip duration is the main criterion, whereas combined transport is selected when minimization of cost and CO2 emissions is the objective. Finally a mathematical formulation of a shortest path with transshipments model enhanced with a multi-criteria method based on goal programming model was created. |
| id | oai:hellanicus.lib.aegean.gr:11610-17367 |
| institution | Hellanicus |
| language | en_US |
| publishDate | 2017 |
| record_format | dspace |
| title | Routing searching algorithm for combined freight transport trips in South East Europe region |
| topic | routing algorithm combined transport mahtematical model συνδυασμενη μεταφορα αλγοριθμος ευρεσης διαδρομης μαθηματικο μοντελο Transportation (URL: http://id.loc.gov/authorities/subjects/sh85137027) Mathematical analysis (URL: http://id.loc.gov/authorities/subjects/sh85082116) |
| url | http://hdl.handle.net/11610/17367 |
| work_keys_str_mv | AT otapasidēspanagiōtēs routingsearchingalgorithmforcombinedfreighttransporttripsinsoutheasteuroperegion |