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 -