Pages that link to "Item:Q4820908"
From MaRDI portal
The following pages link to The moving-target traveling salesman problem (Q4820908):
Displayed 17 items.
- Solving the dynamic traveling salesman problem using a genetic algorithm with trajectory prediction: an application to fish aggregating devices (Q337442) (← links)
- Time-dependent routing problems: a review (Q342083) (← links)
- The multiple traveling salesmen problem with moving targets (Q895767) (← links)
- A note on a motion control problem for a placement machine (Q991822) (← links)
- The pickup and delivery problem with alternative locations and overlapping time windows (Q2147021) (← links)
- Dealing with time in the multiple traveling salespersons problem with moving targets (Q2155136) (← links)
- The single line moving target traveling salesman problem with release times (Q2158632) (← links)
- A customized genetic algorithm for bi-objective routing in a dynamic network (Q2242262) (← links)
- A time-dependent hierarchical Chinese postman problem (Q2303339) (← links)
- An enhanced lower bound for the time-dependent travelling salesman problem (Q2333147) (← links)
- On path ranking in time-dependent graphs (Q2669544) (← links)
- Vehicle Routing Algorithms for Radially Escaping Targets (Q2949981) (← links)
- The Multiple Traveling Salesmen Problem with Moving Targets and Nonlinear Trajectories (Q4685796) (← links)
- The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches (Q5136080) (← links)
- Neural network algorithm for intercepting targets moving along known trajectories by a Dubins' car (Q6047932) (← links)
- A bi-criteria moving-target travelling salesman problem under uncertainty (Q6167752) (← links)
- Optimization of interception plan for rectilinearly moving targets (Q6200426) (← links)