A branch-and-cut algorithm for the nonpreemptive swapping problem

DOI10.1002/NAV.20361MaRDI QIDQ5187945zbMATH OpenOpenAlexFDO

Authors Charles Bordenave, Michel Gendreau, G. Laporte

Publication date 9 March 2010

Published in Naval Research Logistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nav.20361

zbMATH Keywords

branch-and-cutswapping problemvehicle routing

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Boolean programming (90C09) Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• A branch-and-cut algorithm for the preemptive swapping problem
• A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem
• The swapping problem
• Heuristics for the mixed swapping problem
• The preemptive swapping problem on a tree

Cites work

• A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• Approximating Capacitated Routing and Delivery Problems
• Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries
• Efficient separation routines for the symmetric traveling salesman problem. I: General tools and comb separation
• Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel
• scientific article; zbMATH DE number 742961 (Why is no real title available?)
• Multistars, partial multistars and the capacitated vehicle routing problem
• The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms
• The swapping problem
• The Swapping Problem on a Line
• The traveling salesman problem on a graph and some related integer polyhedra

Cited in

(12)

• The unit-capacity constrained permutation problem
• The uncapacitated swapping problem on a line and on a circle
• Bike sharing systems: solving the static rebalancing problem
• The multi-commodity pickup-and-delivery traveling salesman problem
• A branch-and-cut algorithm for the preemptive swapping problem
• The static bicycle relocation problem with demand intervals
• The preemptive swapping problem on a tree
• A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem
• The 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

Describes a project that uses

Uses Software

• CVRPSEP
• CVRPSP

This page was built for publication: A branch-and-cut algorithm for the nonpreemptive swapping problem

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