Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing

DOI10.1016/j.ejor.2011.07.020zbMath1242.90186MaRDI QIDQ421709

Tolga Bektaş

Publication date: 14 May 2012

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2011.07.020

zbMATH Keywords

Benders decomposition; fixed destination; multicommodity network design; multiple traveling salesman problem

Mathematics Subject Classification ID

90B10: Deterministic network models in operations research

90C27: Combinatorial optimization

Related Items

Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route, The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods, Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm, A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem, Revisiting the Hamiltonian \(p\)-median problem: a new formulation on directed graphs and a branch-and-cut algorithm, Combinatorial Benders cuts for assembly line balancing problems with setups, Hybrid search with neighborhood reduction for the multiple traveling salesman problem, Solution of preemptive multi-objective network design problems applying Benders decomposition method, Polynomial-time separation of enhanced reverse multistar inequalities, Mathematical formulations for a 1-full-truckload pickup-and-delivery problem, Compact formulations for multi-depot routing problems: theoretical and computational comparisons

Uses Software

• TSPLIB
• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• VRP
• Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
• The vehicle routing problem. Latest advances and new challenges.
• A comparative analysis of several asymmetric traveling salesman problem formulations
• Practical enhancements to the Magnanti-Wong method
• Partitioning procedures for solving mixed-variables programming problems
• The traveling salesman problem: An overview of exact and approximate algorithms
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• The traveling salesman problem and its variations.
• Multi-objective vehicle routing problems
• Integer linear programming formulations of multiple salesman problems and its variations
• A note on the selection of Benders' cuts
• The Vehicle Routing Problem
• The balanced billing cycle vehicle routing problem
• Integer Programming Formulation of Traveling Salesman Problems
• Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
• A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
• A tabu search heuristic for periodic and multi-depot vehicle routing problems