Institutional Repository [SANDBOX]
Technical University of Crete
EN  |  EL

Search

Browse

My Space

Επίλυση του προβλήματος εγκατάστασης και δρομολόγησης δύο επιπέδων με χρήση άπληστης τυχαιοποιημένης προσαρμοστικής διαδικασίας αναζήτησης

Grammatopoulou Maria

Full record


URI: http://purl.tuc.gr/dl/dias/4631CC71-C036-4A39-98E7-A2694853DAAD
Year 2017
Type of Item Diploma Work
License
Details
Bibliographic Citation Μαρία Γραμματοπούλου, "Επίλυση του προβλήματος εγκατάστασης και δρομολόγησης δύο επιπέδων με χρήση άπληστης τυχαιοποιημένης προσαρμοστικής διαδικασίας αναζήτησης", Διπλωματική Εργασία, Σχολή Μηχανικών Παραγωγής και Διοίκησης, Πολυτεχνείο Κρήτης, Χανιά, Ελλάς, 2017 https://doi.org/10.26233/heallink.tuc.69011
Appears in Collections

Summary

The two-echelon location routing problem (LRP-2E) arises from recent transportation applications like city logistics and the ever growing need for optimal transportation networks.This is a variation of the classic location routing problem (LRP) in which the first level involves a main depot and the second level involves many smaller satellites depots (satellites) and, of course, the customers. First level trips, executed by large vehicles, serve from a mail depot a set of satellite depots, while second level trips, executed by much smaller vehicles, visit customers from these satellites.The two-echelon location routing problem plays an important role in transportation networks and particularly in city logistics for two main reasons. Firstly, the location of intermediate depots (satellites), usually located near large cities, allows considerable savings compared to direct deliveries from one main depot. Secondly, more and more municipalities wish to reduce traffic in their city center, by creating peripheral logistic platforms, from which smaller vehicles are allowed to go downtown.In order to solve the two-echelon location routing problem in the context of this diploma thesis, four constructive heuristic algorithms and a hybrid metaheuristic algorithm, a greedy randomized adaptive search procedure (GRASP), are used. The GRASP involves three greedy randomized heuristic algorithms to generate trial solutions and a variable neighborhood decent (VND) procedures to improve them.This diploma thesis presents the implementation of the methods used, as well as the results from the use of the algorithms. The programming environment of MATLAB was used to develop the algorithms.

Available Files

Services

Statistics