Dealing with time in the multiple traveling salespersons problem with moving targets

DOI10.1007/S10100-020-00712-7MaRDI QIDQ2155136zbMATH OpenOpenAlexFDO

Authors Anke Stieber, Armin Fügenschuh

Publication date 15 July 2022

Published in CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s10100-020-00712-7

zbMATH Keywords

integer linear programmingmoving targetssecond-order cone programmingtime-relaxationdynamic traveling salespersons problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1305099 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• scientific article; zbMATH DE number 3895002 (Why is no real title available?)
• A dynamic vehicle routing problem with time-dependent travel times
• A note on two problems in connexion with graphs
• A queueing framework for routing problems with time-dependent travel times
• A way to optimally solve a time-dependent vehicle routing problem with time windows
• An Efficient Transformation Of The Generalized Traveling Salesman Problem
• An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation
• An efficient transformation of the generalized vehicle routing problem
• Constructing maximal dynamic flows from static flows
• Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm
• Generalized travelling salesman problem through n sets of nodes: The asymmetrical case
• How to collect balls moving in the Euclidean plane
• Integer Programming Formulation of Traveling Salesman Problems
• Integer Programming and Combinatorial Optimization
• Scheduling and Routing of Fly-in Safari Planes Using a Flow-over-Flow Model
• The Multiple Traveling Salesmen Problem with Moving Targets and Nonlinear Trajectories
• The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
• The moving-target traveling salesman problem
• The multiple traveling salesmen problem with moving targets
• The time dependent traveling salesman problem: polyhedra and algorithm
• The traveling salesman. Computational solutions for RSP applications
• Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
• Time-dependent routing problems: a review
• Vehicle dispatching with time-dependent travel times

Cited in

(3)

• Minimum-time interception of a moving target by a material point in a viscous medium
• A bi-criteria moving-target travelling salesman problem under uncertainty
• The Multiple Traveling Salesmen Problem with Moving Targets and Nonlinear Trajectories

This page was built for publication: Dealing with time in the multiple traveling salespersons problem with moving targets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2155136)