Search

Browse

• Communities
• Authors
• Year
• Titles
• Subjects

My Space

• Login

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

Malaxianakis Themistoklis

Full record

---

Summary

This thesis will explore the Close-Open Vehicle Routing Problem with private and household vehicles, including multiple returns to the depot. It is a variation of the open vehicle routing problem that considers the possibility of vehicles returning to the starting depot, reloading, and continuing a new route until they cover their assigned time slots. Our objective is to minimize the cost of all vehicles' trips while providing the best customer service. Our primary restrictions for each route are to ensure that the vehicle does not exceed the maximum capacity limit andthe maximum allowed time margin. To determine the order in which customers will be served, we will use the Nearest Neighbor algorithm to obtain our initial solution to the problem. To further improve the overall cost efficiency of our solution, we will employ three local search algorithms (2 Opt, 1-1 exchange, 1-0 relocate). Finally, we will use the Simulated Annealing metaheuristic algorithm to enhance our solution, which will be applied with different approaches depending on the temperature reduction function used.

Available Files

Services