The moving-target traveling salesman problem

DOI10.1016/S0196-6774(03)00075-0zbMath1134.90521MaRDI QIDQ4820908

Gabriel Robins, C. S. Helvig, Alexander Z. Zelikovsky

Publication date: 1 October 2004

Published in: Journal of Algorithms (Search for Journal in Brave)

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (17)

The pickup and delivery problem with alternative locations and overlapping time windows ⋮ Dealing with time in the multiple traveling salespersons problem with moving targets ⋮ Solving the dynamic traveling salesman problem using a genetic algorithm with trajectory prediction: an application to fish aggregating devices ⋮ Time-dependent routing problems: a review ⋮ The single line moving target traveling salesman problem with release times ⋮ On path ranking in time-dependent graphs ⋮ Vehicle Routing Algorithms for Radially Escaping Targets ⋮ Neural network algorithm for intercepting targets moving along known trajectories by a Dubins' car ⋮ The multiple traveling salesmen problem with moving targets ⋮ A bi-criteria moving-target travelling salesman problem under uncertainty ⋮ Optimization of interception plan for rectilinearly moving targets ⋮ The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches ⋮ A customized genetic algorithm for bi-objective routing in a dynamic network ⋮ The Multiple Traveling Salesmen Problem with Moving Targets and Nonlinear Trajectories ⋮ A note on a motion control problem for a placement machine ⋮ A time-dependent hierarchical Chinese postman problem ⋮ An enhanced lower bound for the time-dependent travelling salesman problem

This page was built for publication: The moving-target traveling salesman problem