Combined route capacity and route length models for unit demand vehicle routing problems

DOI10.1016/j.disopt.2007.05.001zbMath1168.90359OpenAlexW2005820728MaRDI QIDQ951110

Thomas L. Magnanti, Maria Teresa Godinho, Luís Gouveia

Publication date: 29 October 2008

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2007.05.001

zbMATH Keywords

travelling salesman problemvehicle routing problemHop-indexed network flow models

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)

Related Items

Layered graph approaches for combinatorial optimization problems, Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem, Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems, Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem, Natural and extended formulations for the time-dependent traveling salesman problem, Minimizing customers' waiting time in a vehicle routing problem with unit demands, Combined route capacity and route length models for unit demand vehicle routing problems, The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time, Unnamed Item, Exact methods for mono-objective and bi-objective multi-vehicle covering tour problems, Further contributions to network optimization

Uses Software

• VRP
• CVRPSP

Cites Work

• Classification of travelling salesman problem formulations
• Combined route capacity and route length models for unit demand vehicle routing problems
• A result on projection for the vehicle routing problem
• Polyhedral results for a vehicle routing problem
• The capacitated minimal spanning tree problem: An experiment with a hop-indexed model
• A branch-and-cut algorithm for vehicle routing problems
• Multistars, partial multistars and the capacitated vehicle routing problem
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• Projection results for vehicle routing
• Lifted Cycle Inequalities for the Asymmetric Traveling Salesman Problem
• The Truck Dispatching Problem
• The Vehicle Routing Problem
• On the Significance of Solving Linear Programming Problems with Some Integer Variables
• A New Formulation for the Travelling Salesman Problem
• Facets of the Asymmetric Traveling Salesman Polytope
• A Polyhedral Intersection Theorem for Capacitated Spanning Trees
• The Fixed-Outdegree 1-Arborescence Polytope
• A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
• Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
• The Asymmetric Assignment Problem and Some New Facets of the Traveling Salesman Polytope on a Directed Graph
• An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
• Solution of a Large-Scale Traveling-Salesman Problem
• The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item