Heuristics for the mixed swapping problem

DOI10.1016/J.COR.2009.03.032MaRDI QIDQ733528zbMATH OpenOpenAlexFDO

Authors Charles Bordenave, Michel Gendreau, G. Laporte

Publication date 16 October 2009

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2009.03.032

zbMATH Keywords

heuristictransportation problemvehicle routing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06)

Recommendations

• The swapping problem
• A branch-and-cut algorithm for the preemptive swapping problem
• A branch-and-cut algorithm for the nonpreemptive swapping problem
• The preemptive swapping problem on a tree
• The Swapping Problem on a Line

Cites work

• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• A branch-and-cut algorithm for the nonpreemptive swapping problem
• A branch-and-cut algorithm for the preemptive swapping problem
• Algorithms for the Assignment and Transportation Problems
• Approximating Capacitated Routing and Delivery Problems
• Computing Minimum-Weight Perfect Matchings
• Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel
• Heuristics for the mixed rural postman problem
• Nonpreemptive Ensemble Motion Planning on a Tree
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Paths, Trees, and Flowers
• Preemptive Ensemble Motion Planning on a Tree
• The Swapping Problem on a Line
• The preemptive swapping problem on a tree
• The swapping problem

Cited in

(11)

• Preemptive stacker crane problem: extending tree-based properties and construction heuristics
• The swapping problem
• The Swapping Problem on a Line
• Tree based models and algorithms for the preemptive asymmetric stacker crane problem
• The static bicycle relocation problem with demand intervals
• The uncapacitated swapping problem on a line and on a circle
• A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem
• scientific article; zbMATH DE number 894762 (Why is no real title available?)
• A branch-and-cut algorithm for the nonpreemptive swapping problem
• The preemptive swapping problem on a tree
• A branch-and-cut algorithm for the preemptive swapping problem

Describes a project that uses

Uses Software

• Boost
• Blossom IV
• Concorde
• Boost C++ Libraries

This page was built for publication: Heuristics for the mixed swapping problem

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