Optimization of delivery problems
| Thesis title in Czech: | Optimalizace přepravních problémů |
|---|---|
| Thesis title in English: | Optimization of delivery problems |
| Key words: | Vehicle Routing Problem|VeRoLog Solver Challenge|Heuristické algoritmy |
| English key words: | Vehicle Routing Problem|VeRoLog Solver Challenge|Heuristic Algorithms |
| Academic year of topic announcement: | 2019/2020 |
| Thesis type: | Bachelor's thesis |
| Thesis language: | angličtina |
| Department: | Department of Theoretical Computer Science and Mathematical Logic (32-KTIML) |
| Supervisor: | RNDr. Jiří Fink, Ph.D. |
| Author: | hidden - assigned and confirmed by the Study Dept. |
| Date of registration: | 22.06.2020 |
| Date of assignment: | 23.06.2020 |
| Confirmed by Study dept. on: | 08.09.2021 |
| Date and time of defence: | 10.09.2021 09:00 |
| Date of electronic submission: | 22.07.2021 |
| Date of submission of printed version: | 22.07.2021 |
| Date of proceeded defence: | 10.09.2021 |
| Opponents: | Mgr. Martin Pilát, Ph.D. |
| Guidelines |
| Last mile delivery is a modern problem where goods have to be delivered from a central depot to a number of costumer locations.
In this problem both minimization of travel length and optimizing the usage of capacity has to be considered. The goal of this thesis is to explore and compare several ways of solving this problem. |
| References |
| Gu, W., Cattaruzza, D., Ogier, M., Semet, F. (2019). Adaptive large neighborhood search for the commodity constrained split delivery VRP. Computers & Operations Research, 112.
Elshaer, R., Awad, H. (2020). A taxonomic review of metaheuristic algorithms for solving the vehicle routing problem and its variants. Computers & Industrial Engineering, 140. Blum, C., Raidl, G. R. (2016). Hybrid Metaheuristics: Powerful Tools for Optimization. Springer. |
| Preliminary scope of work |
| Vehicle Routing Problem (VRP) je NP-těžký problém, který se zabývá hledáním optimální cesty pro vozový park, rozvážející zboží z jedné centrální lokace.
Tento problém nabývá na důležitosti s nárůstem elektronických obchodů, které spoléhají na efektivní rozvoz zboží. VeRoLog Solver Challenge je každoroční soutěž, která poskytuje prostor pro porovnávání různých přístupů k VRP na konkrétním příkladu, který je brán z reálných dat. V této práci shrneme několik nedávných teoretických poznatků, implementujeme je v rámci modulárních optimizačního algoritmu a porovnáme je na instancích z nedávné VeRoLog Solver Challenge. |
| Preliminary scope of work in English |
| Vehicle Routing Problem (VRP) is an NP-hard problem dealing with last mile delivery of goods from a central depot to costumers using multiple delivery vehicles.
This problem has become more relevant in recent years due to the rise of e-commerce, where efficient routing can help reduce overhead. The VeRoLog Solver Challenge is a yearly open competition, where the goal is to solve a real-world example of VRP. In this thesis we review several recent theoretical advances in VRP, implement them in a modular optimization framework and compare them on a recent VeRoLog Solver Challenge data set. |