Special cases of traveling salesman and repairman problems with time windows
From MaRDI portal
Publication:3993633
DOI10.1002/net.3230220305zbMath0819.90124OpenAlexW1995284651WikidataQ96173857 ScholiaQ96173857MaRDI QIDQ3993633
Publication date: 23 July 1992
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230220305
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)
Related Items
A note on the traveling repairman problem ⋮ Scheduling electric vehicles and locating charging stations on a path ⋮ An approximability result of the multi-vehicle scheduling problem on a path with release and handling times ⋮ Algorithms for the on-line quota traveling salesman problem ⋮ Linear time approximation schemes for vehicle scheduling problems ⋮ Solving the traveling repairman problem on a line with general processing times and deadlines ⋮ A logic-based Benders decomposition method for the multi-trip traveling repairman problem with drones ⋮ Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem ⋮ Cyclic inventory routing in a line-shaped network ⋮ Improved algorithms for joint optimization of facility locations and network connections ⋮ Routing and scheduling problems with two agents on a line-shaped network ⋮ A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem ⋮ The Steiner traveling salesman problem with online advanced edge blockages ⋮ A branch-and-price algorithm for the minimum latency problem ⋮ Finding optimal tour schedules on transportation paths under extended time window constraints ⋮ A reclaimer scheduling problem arising in coal stockyard management ⋮ How to collect balls moving in the Euclidean plane ⋮ The single line moving target traveling salesman problem with release times ⋮ Routing problems: A bibliography ⋮ Network construction/restoration problems: cycles and complexity ⋮ Modeling emergency response operations: a theory building survey ⋮ Integrated real-time control of mixed-model assembly lines and their part feeding processes ⋮ A comparison of three metaheuristics for the workover rig routing problem ⋮ A simple and effective metaheuristic for the minimum latency problem ⋮ Minimizing sequence-dependent setup costs in feeding batch processes under due date restrictions ⋮ A performance study on multi improvement neighborhood search strategy ⋮ Spider covers and their applications ⋮ How to charge while driving: scheduling point-to-point deliveries of an electric vehicle under overhead wiring ⋮ An iterated local search algorithm for latency vehicle routing problems with multiple depots ⋮ Routing open shop and flow shop scheduling problems ⋮ Approximation algorithms for the traveling repairman and speeding deliveryman problems ⋮ 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times. ⋮ Scheduling on a graph with release times ⋮ Two-agent vehicle scheduling problem on a line-shaped network ⋮ Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle ⋮ The delivery man problem with time windows ⋮ Emergency path restoration problems ⋮ Dynamic Traveling Repair Problem with an Arbitrary Time Window ⋮ Data mule scheduling on a path with handling time and time span constraints ⋮ Minimizing customers' waiting time in a vehicle routing problem with unit demands ⋮ New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP ⋮ A truck and drones model for last-mile delivery: a mathematical model and heuristic approach ⋮ Online Vehicle Routing Problems: A Survey ⋮ Approximating a vehicle scheduling problem with time windows and handling times ⋮ Patrolling security games: definition and algorithms for solving large instances with single patroller and single intruder ⋮ A polyhedral study of the asymmetric traveling salesman problem with time windows ⋮ How to whack moles ⋮ Almost sure asymptotic optimality for online routing and machine scheduling problems ⋮ Tree optimization based heuristics and metaheuristics in network construction problems ⋮ A \(\frac{5}{3}\)-approximation algorithm for scheduling vehicles on a path with release and handling times ⋮ Optimally solving a versatile traveling salesman problem on tree networks with soft due dates and multiple congestion scenarios ⋮ A metaheuristic for the delivery man problem with time windows ⋮ Single-vehicle scheduling problems with release and service times on a line ⋮ Improved algorithms for single vehicle scheduling on tree/cycle networks ⋮ Vehicle routing problems on a line-shaped network with release time constraints ⋮ Randomized heuristics for the family traveling salesperson problem ⋮ A faster 2-approximation algorithm for the minmax \(p\)-traveling salesmen problem on a tree ⋮ An improved approximation ratio for the minimum latency problem ⋮ Vehicle scheduling with combinable delivery and pickup operations ⋮ Combining traveling salesman and traveling repairman problems: a multi-objective approach based on multiple scenarios ⋮ A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem ⋮ Vehicle scheduling problems with two agents on a line ⋮ Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems ⋮ Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks
Cites Work
