The multiple traveling salesmen problem with moving targets

DOI10.1007/s11590-014-0835-6zbMath1335.90084OpenAlexW2050965489MaRDI QIDQ895767

Anke Stieber, Hendrik Rothe, Matthias Knapp, Maria Epp, Armin Fügenschuh

Publication date: 4 December 2015

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-014-0835-6

zbMATH Keywords

heuristicsinteger linear programmingmoving targetstraveling salesmen problem

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

Dealing with time in the multiple traveling salespersons problem with moving targets, The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches, The Multiple Traveling Salesmen Problem with Moving Targets and Nonlinear Trajectories

Uses Software

• TSPLIB
• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The traveling salesman. Computational solutions for RSP applications
• Improving hit-and-run for global optimization
• The moving-target traveling salesman problem
• Computational Integer Programming and Cutting Planes