Athens University Economics and Business (AUEB)
Σχεδιασμός, χαρτογράφηση και δημιουργία ωρολογίου προγράμματος δρομολογίων των ελληνικών ακτοπλοϊκών μεταφορών
Abstract
dc:descriptionThe Greek coastal shipping transportations’ network, as designed and formed through the years, is based on factors bearing little relation to the coverage of the real need on the part of the Greek islands for connection with mainland Greece and one another. The issue of the improvement of this network has very little occupied the minds of the various parties involved. Today, however, a new framework is beginning to take shape. Tourism throughout the Greek islands is increasing at a fast rate year after year. The islanders need more speedy and regular connections. New coastal shipping companies are on the point of entering the coastal navigation market. De facto, the issue of the Greek coastal shipping transportation network optimization, discussed in the present publication, is becoming exceedingly topical and imperative. Centered on the optimization factors and the methodology proposed, the heuristic algorithm by the name of ‘Nautilus’ is presented in this paper. On the basis of the optimization algorithm put forward, certain specific proposals concerning the structure of the Greek coastal shipping transportation network, the optimal coastal lines, the optimal ports of departure, and the optimal types of ship to serve these lines, have therefore been set forth. Further, in this essay we present a heuristic, directed algorithm for Vehicle Routing Problem (VRP), which is a well-known problem of combinational optimization, negotiating serving a number of clients, from vehicles of the same capacity starting from a central warehouse and not returning to it, after serving the last client. The proposed algorithm methodology consists in the study of the specific topology of node positions, forming a number of “instructions”, based on which search and selection of the routing nodes is carried out. That is, the algorithm based on these “instructions” selects the nodes in the direction of the defined terminal node, creating relevant optimal routes, minimizing the total distance traveled and the number of vehicles to be used for covering the client demand. Further in this essay we present a heuristic, directed algorithm for VRP, which is a well-known problem of combinational optimization, negotiating serving a number of clients, from vehicles of the same capacity starting from a central warehouse and not returning to it, after serving the last client. The proposed algorithm methodology consists in the study of the specific topology of node positions, forming a number of “instructions”, based on which search and selection of the routing nodes is carried out. That is, the algorithm based on these “instructions” selects the nodes in the direction of the defined terminal node, creating relevant optimal routes, minimizing the total distance traveled and the number of vehicles to be used for covering the client demand.
Degree
thesis:*- Grantor dc:publisher
- Athens University Economics and Business (AUEB)
- Year dc:date
- 2017
Author and committee
dc:creator, dc:contributor.*- Authors dc:creator
-
- Chainas, Konstantinos
- Χαϊνάς, Κωνσταντίνος
Subjects
dc:subject × 6Rights
- Language dc:language
- gre
Identifiers
dc:identifier.*- Identifier
- 10.12681/eadd/41396