Robust Optimization Approach in Travelling Salesman Problem with Service Time

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F60460709%3A41110%2F22%3A91352" target="_blank" >RIV/60460709:41110/22:91352 - isvavai.cz</a>

Výsledek na webu

<a href="https://mme2022.vspj.cz/" target="_blank" >https://mme2022.vspj.cz/</a>

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Robust Optimization Approach in Travelling Salesman Problem with Service Time

Popis výsledku v původním jazyce

The travelling salesman problem has been addressed by researchers over again in the past decades. The main focus of the problem is computing a Hamiltonian path over a given set of vertices with respect to edge costs, while other criteria and aspects are considered concerning the needs of practitioners. In our contribution, we consider a travelling salesman problem with a service time needed when each vertex is visited. The expected service time may vary depending on the time of the day. We propose an optimisation model for minimising the total journey length, including the service time. Consequently, we consider that both service time on vertices and travelling time between vertices may be uncertain. The Gamma robustness approach is used in order to deal with the uncertainty issues and propose an optimal travelling strategy.

Název v anglickém jazyce

Robust Optimization Approach in Travelling Salesman Problem with Service Time

Popis výsledku anglicky

The travelling salesman problem has been addressed by researchers over again in the past decades. The main focus of the problem is computing a Hamiltonian path over a given set of vertices with respect to edge costs, while other criteria and aspects are considered concerning the needs of practitioners. In our contribution, we consider a travelling salesman problem with a service time needed when each vertex is visited. The expected service time may vary depending on the time of the day. We propose an optimisation model for minimising the total journey length, including the service time. Consequently, we consider that both service time on vertices and travelling time between vertices may be uncertain. The Gamma robustness approach is used in order to deal with the uncertainty issues and propose an optimal travelling strategy.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10102 - Applied mathematics

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2022

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

40th International Conference Mathematical Methods in Economics 2022 Proceedings

ISBN

978-80-88064-62-6

ISSN

—

e-ISSN

—

Počet stran výsledku

6

Strana od-do

312-317

Název nakladatele

College of Polytechnics Jihlava

Místo vydání

Jihlava

Místo konání akce

Jihlava

Datum konání akce

7. 9. 2022

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—