Εντοπίστηκε ένα σφάλμα στη λειτουργία της ΠΥΞΙΔΑΣ όταν χρησιμοποιείται μέσω του προγράμματος περιήγησης 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/26

Περιήγηση

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

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
  • Μικρογραφία εικόνας
    Τεκμήριο
    The capacitated vehicle routing problem. A comparison between integer linear programming and metaheuristic search methods
    (2021) Chiotis, Minas A.; Χιώτης, Μηνάς; Athens University of Economics and Business, Department of Business Administration; Kouretas, Georgios; Agoraki, Maria-Eleni; Nikolopoulou, Amalia
    This thesis presents a comparison between two ways of solving a Capacitated Vehicle Routing Problem (CVRP) - a special variation of the classic Vehicle Routing Problem (VRP) - with Linear Integer Programming versus metaheuristic methods from Operating Research Google developers (OR-Tools). This problem is traditionally as one of the most important issues for companies delivering goods and services and in general in the sector of Logistics and Supply chain. The scope of this thesis is to deliver the best solution between two different methodologies and propose the best use of them at any case they face.In the first part we can find the literature about the Supply Chain Management and the VRP problem in general and the variations of it. There are mentions about the creators and researchers of the sector and highlighting the milestones of their life which was dedicated in their work.We analyze that in the CVRP case we examine the scope of the problem is to serve as many as possible customers and to minimize the total distance of each truck aiming to minimize the total cost of transportation and maximizing the company’s profitability and competitive advantage against other providers. The constraint is the capacity of each vehicle which is not tolerated to be exceeded. The comparison between them focuses on which of the two methods is the most effective in a manner of time, precision, and efficiency.After that we analyze the methodologies we are going to use and based on we are going to implement the experiment at each case. Here we use the linear integer programming to solve the problem and on the other hand a bunch of metaheuristics which come from OR Tools. Details about the integration is listed in the proportionate chapter.Then implementation and conclusion take place and are starting to represent the whole mindset of the problem, the issues, the measurements and finally the results based on how we make our comparison. All in all, the outcome is different and at any case the user (manager) is called to make a decision that has to choose between these two methodologies.