Heuristics for the mixed swapping problem

DOI10.1016/j.cor.2009.03.032zbMath1171.90331OpenAlexW2139110007MaRDI QIDQ733528

Charles Bordenave, Gilbert Laporte, Michel Gendreau

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

vehicle routingheuristictransportation problem

Mathematics Subject Classification ID

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

Related Items

The static bicycle relocation problem with demand intervals, Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem, A branch-and-cut algorithm for the preemptive swapping problem, A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem, Preemptive stacker crane problem: extending tree-based properties and construction heuristics, The preemptive swapping problem on a tree

Uses Software

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

Cites Work

• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Heuristics for the mixed rural postman problem
• A branch-and-cut algorithm for the preemptive swapping problem
• The preemptive swapping problem on a tree
• Nonpreemptive Ensemble Motion Planning on a Tree
• Algorithms for the Assignment and Transportation Problems
• Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel
• The swapping problem
• Preemptive Ensemble Motion Planning on a Tree
• Approximating Capacitated Routing and Delivery Problems
• The Swapping Problem on a Line
• Computing Minimum-Weight Perfect Matchings
• A branch‐and‐cut algorithm for the nonpreemptive swapping problem
• Paths, Trees, and Flowers