Heuristics for the mixed swapping problem

DOI10.1016/J.COR.2009.03.032zbMATH Open1171.90331OpenAlexW2139110007MaRDI QIDQ733528FDOQ733528

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

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

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)

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem
• Title not available (Why is that?)
• Paths, Trees, and Flowers
• Computing Minimum-Weight Perfect Matchings
• Algorithms for the Assignment and Transportation Problems
• A branch-and-cut algorithm for the preemptive swapping problem
• The swapping problem
• A branch-and-cut algorithm for the nonpreemptive swapping problem
• Approximating Capacitated Routing and Delivery Problems
• The preemptive swapping problem on a tree
• Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel
• Preemptive Ensemble Motion Planning on a Tree
• Nonpreemptive Ensemble Motion Planning on a Tree
• The Swapping Problem on a Line
• Heuristics for the mixed rural postman 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
• Title not available (Why is that?)
• 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

Uses Software

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

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)