Package delivering in preferred times

• Thesis title in Czech: Package delivering in preferred times
• Thesis title in English: Package delivering in preferred times
• Academic year of topic announcement: 2023/2024
• 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: 16.01.2024
• Date of assignment: 16.01.2024
• Confirmed by Study dept. on: 18.01.2024
• Opponents: Mgr. Petra Vysušilová

Guidelines

The topic is a variant of a problem of delivering multiple packages in consumers' preferred times by homogeneous fleet of vehicles.
The student will describe, implement and compare algorithms based on nature inspired algorithms (e.g. evolutionary programming, ant-colony optimization) or meta-heuristic methods (e.g. local search).

References

Blum, Christian, and Günther R. Raidl. Hybrid metaheuristics: powerful tools for optimization. Vol. 157. Cham, Switzerland: Springer International Publishing, 2016.
Kallehauge, Brian, et al. Vehicle routing problem with time windows. Springer US, 2005.
Desrochers, Martin, Jacques Desrosiers, and Marius Solomon. "A new optimization algorithm for the vehicle routing problem with time windows." Operations research 40.2 (1992): 342-354.