The preemptive swapping problem on a tree
From MaRDI portal
Publication:3100688
DOI10.1002/net.20451zbMath1233.90075MaRDI QIDQ3100688
Shoshana Anily, Michel Gendreau, Gilbert Laporte
Publication date: 21 November 2011
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20451
05C05: Trees
90B06: Transportation, logistics and supply chain management
90C59: Approximation methods and heuristics in mathematical programming
90B10: Deterministic network models in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Models for the single-vehicle preemptive pickup and delivery problem, A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem, Heuristics for the mixed swapping problem, Vehicle driven approaches for non preemptive vehicle relocation with integrated quality criterion in a vehicle sharing system, Polynomially solvable cases of the bipartite traveling salesman problem, The unit-capacity constrained permutation problem, Preemptive stacker crane problem: extending tree-based properties and construction heuristics, Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder), Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem, A branch-and-cut algorithm for the preemptive swapping problem
Cites Work
- Unnamed Item
- Heuristics for the mixed swapping problem
- An approximation algorithm for the pickup and delivery vehicle routing problem on trees
- Nonpreemptive Ensemble Motion Planning on a Tree
- Heuristics for vehicle routing on tree-like networks
- Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel
- Capacitated Vehicle Routing on Trees
- The swapping problem
- Preemptive Ensemble Motion Planning on a Tree
- Approximating Capacitated Routing and Delivery Problems
- The Swapping Problem on a Line
- Restricted delivery problems on a network
- A branch‐and‐cut algorithm for the nonpreemptive swapping problem
