Μελέτη περίπτωσης ενός προβλήματος δρομολόγησης οχημάτων με περιορισμένη χωρητικότητα (CVRP)
Case study of a capacitated vehicle routing problem (CVRP)
Σιδεριάδης, Κωνσταντίνος Θ.
KeywordsΕφοδιαστική αλυσίδα ; Πρόβλημα δρομολόγησης οχημάτων με περιορισμένη χωρητικότητα ; Αλγόριθμος βελτιστοποίησης αποικίας μυρμηγκιών ; Μεταευρεστικοί αλγόριθμοι ; Logistics ; Capacitated vehicle routing problem ; Hybrid algorithm ; Ant colony optimization algorithm ; Meta-heuristics
For the purpose of this master thesis was conducted a study for the vehicle routing problems in the Logistics department of a company. At first, the study describes the relationships inside a routing network and its role in the supply chain. Then are described the main features of all the problems to be addressed in a routing network. After analyzing the main categories of problems, follows the analysis of the basic problem investigated in this case study. More specifically, it is assumed that the problem belongs to the class of Capacitated Vehicle Routing Problems. This class has the distinction of a limited capacity for the vehicles. The problem taken to resolve has a number of 100 customers, with each truck having a capacity of 9 tons per truck and the maximum time that a truck can operate is 9 hours at most. The study investigates the way in which the algorithm that will optimize the system "warehouse - customer" is constructed. More specifically, the algorithm uses the basic principles of ant colony optimization for finding the optimal path and combines it with the basic principles of the best meta-heuristic tools to optimize it even more. Having described the way in which the hybrid algorithm will suit the problem and solve it, what follows next is the mathematical presentation of what is described. Finally, it is given a commitment that the investigations will continue in the near future and a new addition in the work will be released, where the algorithm will be implemented and some comparisons between existing tools will be carried out.