The preemptive swapping problem on a tree

DOI10.1002/net.20451zbMath1233.90075OpenAlexW2078190972MaRDI 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

zbMATH Keywords

transshipmentstacker crane problemswapping problem

Mathematics Subject Classification ID

Trees (05C05) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Vehicle driven approaches for non preemptive vehicle relocation with integrated quality criterion in a vehicle sharing system, Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem, A branch-and-cut algorithm for the preemptive swapping problem, Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder), A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem, Models for the single-vehicle preemptive pickup and delivery problem, 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, Heuristics for the mixed 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