A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem

DOI10.1016/S0377-2217(03)00377-1zbMath1061.90020OpenAlexW1973326170MaRDI QIDQ596294

Gilbert Laporte, Imdat Kara, Tolga Bektaş

Publication date: 10 August 2004

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(03)00377-1

zbMATH Keywords

Subtour elimination constraintsVehicle routing problem

Mathematics Subject Classification ID

Traffic problems in operations research (90B20)

Related Items (31)

The time-dependent shortest path and vehicle routing problem ⋮ A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem ⋮ The multiple vehicle pickup and delivery problem with LIFO constraints ⋮ The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation ⋮ A waste collection problem with service type option ⋮ Carrier collaboration with the simultaneous presence of transferable and non-transferable utilities ⋮ A symmetry-free polynomial formulation of the capacitated vehicle routing problem ⋮ The close-open mixed vehicle routing problem ⋮ The min-cost parallel drone scheduling vehicle routing problem ⋮ A robust multi-trip vehicle routing problem of perishable products with intermediate depots and time windows ⋮ Minimizing earliness-tardiness costs in supplier networks -- a just-in-time truck routing problem ⋮ Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems ⋮ New mathematical models of the generalized vehicle routing problem and extensions ⋮ A conditional-logic interpretation for Miller-Tucker-Zemlin inequalities and extensions ⋮ The cumulative school bus routing problem: Polynomial‐size formulations ⋮ Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints ⋮ The stop-and-drop problem in nonprofit food distribution networks ⋮ A hybrid genetic algorithm for the multi-depot open vehicle routing problem ⋮ A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for routing problems with time windows ⋮ Solving a school bus scheduling problem with integer programming ⋮ Mathematical formulations and improvements for the multi-depot open vehicle routing problem ⋮ The vehicle routing problem with profits and consistency constraints ⋮ Selective and periodic inventory routing problem for waste vegetable oil collection ⋮ The inventory-routing problem with transshipment ⋮ Formulations and valid inequalities for the heterogeneous vehicle routing problem ⋮ The multiple shortest path problem with path deconfliction ⋮ An improved formulation for the multi-depot open vehicle routing problem ⋮ A variable neighborhood search for the last-mile delivery problem during major infectious disease outbreak ⋮ A covering traveling salesman problem with profit in the last mile delivery ⋮ A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars ⋮ Two-stage vehicle routing problem with arc time windows: a mixed integer programming formulation and a heuristic approach

Uses Software

• VRP

Cites Work

• Models, relaxations and exact approaches for the capacitated vehicle routing problem
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• Integer Programming Formulation of Traveling Salesman Problems

This page was built for publication: A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem