Väitös (sovellettu matematiikka): MSc Alaleh Maskooki
Aika
14.4.2023 klo 12.00 - 16.00
MSc Alaleh Maskooki esittää väitöskirjansa “Optimal routing in dynamic and uncertain networks: an application to maritime logistics” julkisesti tarkastettavaksi Turun yliopistossa perjantaina 14.4.2023 klo 12 (Turun yliopisto, päärakennus, Säästöpankki-sali, Turku).
Vastaväittäjänä toimii professori Alberto Ceselli (Milanon yliopisto, Italia) ja kustoksena professori Marko M. Mäkelä (Turun yliopisto). Tilaisuus on englanninkielinen. Väitöksen alana on sovellettu matematiikka.
***
Tiivistelmä väitöstutkimuksesta:
The travelling salesman problem (TSP) and its variants have widely been studied in logistics operations and supply chain systems due to the adaptation of the problem definition to such real-world applications. The classical TSP is defined as follows: "Given a list of nodes and the distances between each pair, what is the shortest possible route that visits each node exactly once and returns to the origin". Despite of its simple definition, the problem belongs to the class of computationally hardest among all the optimization problems. The dynamic TSP, which is the base model for the present research, is a TSP with time-varying parameters.
The topic of this research is motivated by a case study on the management of an autonomous or a driven vehicle based on path prediction in a dynamic and uncertain environment. In our case, the dynamic network is defined by uncertain locations of targets to be visited by the vehicle over time. Based on the assumptions and criteria of the case-study, a variant of the problem called moving-target TSP is defined. The models proposed in the dissertation consider the problem from both deterministic and stochastic point of view, and provide mathematical approaches that support decision making for logistics operations. Experiments confirm that high-quality solutions can be found by the proposed methods in a reasonable time. Thus, the methods are highly promising and useful in practical applications.
Vastaväittäjänä toimii professori Alberto Ceselli (Milanon yliopisto, Italia) ja kustoksena professori Marko M. Mäkelä (Turun yliopisto). Tilaisuus on englanninkielinen. Väitöksen alana on sovellettu matematiikka.
***
Tiivistelmä väitöstutkimuksesta:
The travelling salesman problem (TSP) and its variants have widely been studied in logistics operations and supply chain systems due to the adaptation of the problem definition to such real-world applications. The classical TSP is defined as follows: "Given a list of nodes and the distances between each pair, what is the shortest possible route that visits each node exactly once and returns to the origin". Despite of its simple definition, the problem belongs to the class of computationally hardest among all the optimization problems. The dynamic TSP, which is the base model for the present research, is a TSP with time-varying parameters.
The topic of this research is motivated by a case study on the management of an autonomous or a driven vehicle based on path prediction in a dynamic and uncertain environment. In our case, the dynamic network is defined by uncertain locations of targets to be visited by the vehicle over time. Based on the assumptions and criteria of the case-study, a variant of the problem called moving-target TSP is defined. The models proposed in the dissertation consider the problem from both deterministic and stochastic point of view, and provide mathematical approaches that support decision making for logistics operations. Experiments confirm that high-quality solutions can be found by the proposed methods in a reasonable time. Thus, the methods are highly promising and useful in practical applications.
Viestintä