Thesis (Selection of subject)Thesis (Selection of subject)(version: 368)
Thesis details
   Login via CAS
Optimization of warehouse locations by evolutionary algorithms
Thesis title in Czech: Optimalizace polohy skladů pomocí evolučních algoritmů
Thesis title in English: Optimization of warehouse locations by evolutionary algorithms
Key words: evolučný algoritmus|evolučné stratégie
English key words: evolutionary algorithm|evolutionary strategies|warehouse location-routing problem
Academic year of topic announcement: 2020/2021
Thesis type: Bachelor's thesis
Thesis language: angličtina
Department: Department of Theoretical Computer Science and Mathematical Logic (32-KTIML)
Supervisor: Mgr. Roman Neruda, CSc.
Author: hidden - assigned and confirmed by the Study Dept.
Date of registration: 28.05.2021
Date of assignment: 28.05.2021
Confirmed by Study dept. on: 08.09.2021
Date and time of defence: 10.09.2021 09:00
Date of electronic submission:21.07.2021
Date of submission of printed version:22.07.2021
Date of proceeded defence: 10.09.2021
Opponents: RNDr. Miroslav Kratochvíl, Ph.D.
 
 
 
Guidelines
The optimization of warehouse locations represents a hard optimization problem with practical applications in logistics. The goal of this work is to apply evolutionary optimization techniques to solve the problem in realistic setting motivated by a logistic company. The student will explore the possibilities to use and modify existing evolutionary techniques, namely evolutionary strategies for a given problem, and will propose en efficient optimization algorithm. The algorithm will be implemented in a distributed version to allow efficient parallelization of computations. Experimental evaluation of the algorithm will be performed on real data.
References
[1] E.A. Eiben, J.M. Smith: Introduction to Evolutionary Computing. 2nd ed, Springer, 2015.

[2] J. Perl, M.S. Daskin: A warehouse location-routing problem. Transportation Research Part B-methodological, 19, 381-396, 1985.

[3] C. Prodhon, C. Prins: A survey of recent research on location-routing problems. European Journal of Operational Research, 238, 1-17, 2014.

[4] I. Karaoglan, F. Altiparmak: A hybrid genetic algorithm for the location-routing problem with simultaneous pickup and delivery. IEMS, 10 (1), 24-33, 2011.

[5] T.H. Wu, C. Low, J.W. Bai: Heuristic solutions to multi-depot location-routing problems. Computers & Operations Research, 29, 1393-1415, 2002.
 
Charles University | Information system of Charles University | http://www.cuni.cz/UKEN-329.html