TY - GEN A1 - Stieber, Anke A1 - Fügenschuh, Armin A1 - Epp, Maria A1 - Knapp, Matthias A1 - Rothe, Hendrik T1 - The multiple traveling salesmen problem with moving targets T2 - Optimization Letters Y1 - 2015 U6 - https://doi.org/10.1007/s11590-014-0835-6 SN - 1862-4472 SN - 1862-4480 VL - 9 IS - 8 SP - 1569 EP - 1583 ER - TY - GEN A1 - Fügenschuh, Armin A1 - Stieber, Anke ED - Kliewer, Natalia ED - Ehmke, Jan Fabian ED - Borndörfer, Ralf T1 - The Multiple Traveling Salesmen Problem with Moving Targets and Nonlinear Trajectories T2 - Operations Research Proceedings 2017 : Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Freie Universiät Berlin, Germany, September 6-8, 2017 N2 - We consider the multiple traveling salesmen problem with moving targets (MTSPMT), which is a generalization of the classical traveling salesman problem (TSP). Here the nodes (objects, targets) are not static, they are moving over time on trajectories. Moreover, each target has a visibility time window and it can be reached by a salesman only within that time window. The objective function is to minimize the total traveled distances of all salesmen. We recall the time-discrete model formulation from Stieber et al. [9]. This model is applicable to arbitrarily shaped trajectories. Thus, we generated non-linear trajectories based on polynomials, trigonometric functions and their combinations. Computational experiments are carried out with up to 16 trajectories and the results are compared to the ones obtained with linear trajectories. Y1 - 2017 SN - 978-3-319-89920-6 SN - 978-3-319-89919-0 U6 - https://doi.org/10.1007/978-3-319-89920-6_65 SN - 0721-5924 SN - 2197-9294 SP - 489 EP - 494 PB - Springer CY - Cham ER - TY - CHAP A1 - Fügenschuh, Armin A1 - Homfeld, Henning A1 - Johann, Marc A1 - Schülldorf, Hanno A1 - Stieber, Anke ED - Borndörfer, Ralf ED - Klug, Torsten ED - Lamorgese, Leonardo ED - Mannino, Carlo ED - Reuther, Markus ED - Schlechte, Thomas T1 - Use of Optimization Tools for Routing in Rail Freight Transport T2 - Handbook of Optimization in the Railway Industry Y1 - 2018 SN - 978-3-319-72152-1 SN - 978-3-319-72153-8 U6 - https://doi.org/10.1007/978-3-319-72153-8_8 SN - 0884-8289 SN - 2214-7934 SP - 161 EP - 179 PB - Springer International Publishing CY - Berlin ER - TY - RPRT A1 - Stieber, Anke A1 - Fügenschuh, Armin ED - Fügenschuh, Armin T1 - Dealing with Time in the Multiple Traveling Salesmen Problem with Moving Targets Y1 - 2019 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:co1-opus4-48245 SN - 2627-6100 CY - Cottbus ER - TY - GEN A1 - Stieber, Anke A1 - Fügenschuh, Armin T1 - Dealing with Time in the Multiple Traveling Salesmen Problem with Moving Targets T2 - Central European Journal of Operations Research N2 - The multiple traveling salespersons problem with moving targets is a generalization of the classical traveling salespersons problem, where the targets (nodes or objects) are moving over time. Additionally, for each target a visibility time window is given. The task is to find routes for several salespersons so that each target is reached exactly once within its visibility time window and the sum of all traveled distances of all salespersons is minimal. We present different modeling formulations for this TSP variant. The time requirements are modeled differently in each approach. Our goal is to examine what formulation is most suitable in terms of runtime to solve the multiple traveling salespersons problem with moving targets with exact methods. Computational experiments are carried out on randomly generated test instances to compare the different modeling approaches. The results for large-scale instances show, that the best way to model time requirements is to directly insert them into a formulation with discrete time steps. Y1 - 2022 U6 - https://doi.org/10.1007/s10100-020-00712-7 SN - 1613-9178 SN - 1435-246X VL - 30 IS - 3 SP - 991 EP - 1017 ER - TY - THES A1 - Stieber, Anke T1 - The multiple traveling salesperson problem with moving targets Y1 - 2022 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:co1-opus4-61104 ER -