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

DOI10.1002/nav.20361zbMath1182.90011OpenAlexW2042221491MaRDI QIDQ5187945

Michel Gendreau, Charles Bordenave, Gilbert Laporte

Publication date: 9 March 2010

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

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

zbMATH Keywords

vehicle routingbranch-and-cutswapping problem

Mathematics Subject Classification ID

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

Related Items

Vehicle driven approaches for non preemptive vehicle relocation with integrated quality criterion in a vehicle sharing system, The static bicycle relocation problem with demand intervals, A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem, A branch-and-cut algorithm for the preemptive swapping problem, A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem, Bike sharing systems: solving the static rebalancing problem, The unit-capacity constrained permutation problem, Heuristics for the mixed swapping problem, The multi-commodity pickup-and-delivery traveling salesman problem, The preemptive swapping problem on a tree

Uses Software

• CVRPSEP
• CVRPSP

Cites Work

• Unnamed Item
• A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
• Multistars, partial multistars and the capacitated vehicle routing problem
• Efficient separation routines for the symmetric traveling salesman problem. I: General tools and comb separation
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• The traveling salesman problem on a graph and some related integer polyhedra
• Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel
• The swapping problem
• Approximating Capacitated Routing and Delivery Problems
• The Swapping Problem on a Line
• Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries
• The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms