Εντοπίστηκε ένα σφάλμα στη λειτουργία της ΠΥΞΙΔΑΣ όταν χρησιμοποιείται μέσω του προγράμματος περιήγησης Safari. Μέχρι να αποκατασταθεί το πρόβλημα, προτείνουμε τη χρήση εναλλακτικού browser όπως ο Chrome ή ο Firefox. A bug has been identified in the operation of the PYXIDA platform when accessed via the Safari browser. Until the problem is resolved, we recommend using an alternative browser such as Chrome or Firefox.
Λογότυπο αποθετηρίου

Μεταπτυχιακές Εργασίες

Μόνιμο URI για αυτήν τη συλλογήhttps://pyxida.aueb.gr/handle/123456789/51

Περιήγηση

Πλοήγηση Μεταπτυχιακές Εργασίες ανά Συγγραφέα "Boukosis, Dimitrios"

A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Α Β Γ Δ Ε Ζ Η Θ Ι Κ Λ Μ Ν Ξ Ο Π Ρ Σ Τ Υ Φ Χ Ψ Ω
Φιλτράρετε τα αποτελέσματα πληκτρολογώντας τα πρώτα γράμματα
Τώρα δείχνει 1 - 1 από 1
  • Μικρογραφία εικόνας
    Τεκμήριο
    A heuristic algorithm for the fuel delivery problem
    (02/19/2019) Μπούκοσης, Δημήτριος; Boukosis, Dimitrios; Athens University of Economics and Business, Department of Management Science and Technology; Μούρτος, Ιωάννης; Μπουρνέτας, Απόστολος; Ανδρουτσόπουλος, Κωνσταντίνος
    During recent years distribution systems have become increasingly complex. Thisdevelopment is partly due to the high number of company mergers which leavedistribution planners with ever bigger and complex problems. Another fact complicating distribution is the increased focus on timeliness in the distribution chains,as intelligent planning offers potential savings in capital bindings in costs relatedto stock and distribution. In other words, time has become an extremely valuableresource. Nowadays most distribution systems must operate under strict temporalrestrictions. This fact has caused an increasing interest in dynamic transportationmodels and systems in which data are considered to be time-dependent.In this thesis the multi-compartment counterpart of the conventional vehicle routingproblem will be studied. The traditional vehicle routing problem (VRP) consists ofconstructing minimum cost routes for the vehicles to follow so that the set of customersare visited exactly once. The VRP is an important subproblem in a widerange of distribution systems and a lot of effort has been devoted to research on variousaspects of the VRP. However, most of the times different distribution planningproblems may arise in the everyday life. Counterparts of the problem need to besolved, because there are different constraints for each business.The thesis begins by introducing the vehicle routing problem and its counterpartsand discussing the differences between them. The existing literature and its counterpart,the Multi-Compartment VRP is explained later, and the problem descriptionis following, along with an extended explanation of the methodology used to tacklethe problem. Lastly, there have been many tests with various datasets, and the computational results will be presented.