Themistoklis Stamadianos, "Metaheuristic algorithm for realistic vehicle routing problems", Diploma Work, School of Production Engineering and Management, Technical University of Crete, Chania, Greece, 2020
https://doi.org/10.26233/heallink.tuc.84536
The Vehicle Routing Problem with three-dimensional loading constraints, is regarded as significant problem, on account of its important role in logistics around the globe. Due to the perplexity of this problem, research is quite compelling. In the present thesis, the problem is solved in different phases. Initially, the determination of the level of complexity of the problem must be determined, based on the mathematics involved in the solution. Following that, some of the most common variations of the Vehicle Routing Problems were presented and, while the variation of loading space constraint was analyzed thoroughly. Coming after, algorithms such as GRASP, TABU and VNS were also inspected among other. In regards to the solution of the problem, all algorithms and the graphical user interface that were developed alongside, were presented and meticulously described. At last, the results were shown and compared with comparable research.