The preemptive swapping problem on a tree

DOI10.1002/NET.20451MaRDI QIDQ3100688zbMATH OpenOpenAlexFDO

Authors Shoshana Anily, Michel Gendreau, G. 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

stacker crane problemswapping problemtransshipment

Mathematics Subject Classification ID

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

Recommendations

• A branch-and-cut algorithm for the preemptive swapping problem
• The swapping problem
• A branch-and-cut algorithm for the nonpreemptive swapping problem
• Heuristics for the mixed swapping problem
• The uncapacitated swapping problem on a line and on a circle

Cites work

• A branch-and-cut algorithm for the nonpreemptive swapping problem
• An approximation algorithm for the pickup and delivery vehicle routing problem on trees
• Approximating Capacitated Routing and Delivery Problems
• Capacitated Vehicle Routing on Trees
• Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel
• Heuristics for the mixed swapping problem
• Heuristics for vehicle routing on tree-like networks
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Nonpreemptive Ensemble Motion Planning on a Tree
• Preemptive Ensemble Motion Planning on a Tree
• Restricted delivery problems on a network
• The swapping problem
• The Swapping Problem on a Line

Cited in

(15)

• Polynomially solvable cases of the bipartite traveling salesman problem
• The unit-capacity constrained permutation problem
• The uncapacitated swapping problem on a line and on a circle
• 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
• The swapping problem
• Preemptive Ensemble Motion Planning on a Tree
• Models for the single-vehicle preemptive pickup and delivery problem
• The Swapping Problem on a Line
• A branch-and-cut algorithm for the nonpreemptive swapping 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

This page was built for publication: The preemptive swapping problem on a tree

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