@misc{StieberFuegenschuhEppetal., author = {Stieber, Anke and F{\"u}genschuh, Armin and Epp, Maria and Knapp, Matthias and Rothe, Hendrik}, title = {The multiple traveling salesmen problem with moving targets}, series = {Optimization Letters}, volume = {9}, journal = {Optimization Letters}, number = {8}, issn = {1862-4472}, doi = {10.1007/s11590-014-0835-6}, pages = {1569 -- 1583}, language = {en} } @misc{FuegenschuhStieber, author = {F{\"u}genschuh, Armin and Stieber, Anke}, title = {The Multiple Traveling Salesmen Problem with Moving Targets and Nonlinear Trajectories}, series = {Operations Research Proceedings 2017 : Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Freie Universi{\"a}t Berlin, Germany, September 6-8, 2017}, journal = {Operations Research Proceedings 2017 : Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Freie Universi{\"a}t Berlin, Germany, September 6-8, 2017}, editor = {Kliewer, Natalia and Ehmke, Jan Fabian and Bornd{\"o}rfer, Ralf}, publisher = {Springer}, address = {Cham}, isbn = {978-3-319-89920-6}, issn = {0721-5924}, doi = {10.1007/978-3-319-89920-6_65}, pages = {489 -- 494}, abstract = {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.}, language = {en} } @incollection{FuegenschuhHomfeldJohannetal., author = {F{\"u}genschuh, Armin and Homfeld, Henning and Johann, Marc and Sch{\"u}lldorf, Hanno and Stieber, Anke}, title = {Use of Optimization Tools for Routing in Rail Freight Transport}, series = {Handbook of Optimization in the Railway Industry}, booktitle = {Handbook of Optimization in the Railway Industry}, editor = {Bornd{\"o}rfer, Ralf and Klug, Torsten and Lamorgese, Leonardo and Mannino, Carlo and Reuther, Markus and Schlechte, Thomas}, publisher = {Springer International Publishing}, address = {Berlin}, isbn = {978-3-319-72152-1}, issn = {0884-8289}, doi = {10.1007/978-3-319-72153-8_8}, pages = {161 -- 179}, language = {en} } @techreport{StieberFuegenschuh, author = {Stieber, Anke and F{\"u}genschuh, Armin}, title = {Dealing with Time in the Multiple Traveling Salesmen Problem with Moving Targets}, editor = {F{\"u}genschuh, Armin}, address = {Cottbus}, issn = {2627-6100}, doi = {10.26127/BTUOpen-4824}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-48245}, pages = {20}, language = {en} } @misc{StieberFuegenschuh, author = {Stieber, Anke and F{\"u}genschuh, Armin}, title = {Dealing with Time in the Multiple Traveling Salesmen Problem with Moving Targets}, series = {Central European Journal of Operations Research}, volume = {30}, journal = {Central European Journal of Operations Research}, number = {3}, issn = {1613-9178}, doi = {10.1007/s10100-020-00712-7}, pages = {991 -- 1017}, abstract = {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.}, language = {en} } @phdthesis{Stieber, author = {Stieber, Anke}, title = {The multiple traveling salesperson problem with moving targets}, doi = {10.26127/BTUOpen-6110}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-61104}, pages = {107}, language = {en} }