Stronger multi-commodity flow formulations of the capacitated vehicle routing problem

DOI10.1016/j.ejor.2015.02.028zbMath1346.90615OpenAlexW2021244943WikidataQ57702128 ScholiaQ57702128MaRDI QIDQ319445

Adam N. Letchford, Juan-José Salazar-González

Publication date: 6 October 2016

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

Full work available at URL: https://eprints.lancs.ac.uk/id/eprint/72915/1/2015_mcf_cvrp_source.pdf

zbMATH Keywords

integer programmingvehicle routingmulti-commodity flows

Mathematics Subject Classification ID

Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)

Related Items

Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm, Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem, The flexible periodic vehicle routing problem, Comparison of formulations for the inventory routing problem, The arc-item-load and related formulations for the cumulative vehicle routing problem, A symmetry-free polynomial formulation of the capacitated vehicle routing problem, Multi-depot rural postman problems, The shared customer collaboration vehicle routing problem, A matheuristic for the asymmetric capacitated vehicle routing problem, Preprocessing to reduce vehicle capacity for routing problems, Designing a multi-modal and variable-echelon delivery system for last-mile logistics, Valid inequalities and extended formulations for lot-sizing and scheduling problem with sequence-dependent setups, Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems, The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time, The separation problem of rounded capacity inequalities: some polynomial cases, On the complexity of the separation problem for rounded capacity inequalities, The Steiner traveling salesman problem and its extensions, Mixed integer formulations for a routing problem with information collection in wireless networks, Strong cuts from compatibility relations for the dial-a-ride problem, A tailored Benders decomposition approach for last-mile delivery with autonomous robots, Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm

Uses Software

• VRP
• CVRPSP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient elementary and restricted non-elementary route pricing
• A branch and bound algorithm for the capacitated vehicle routing problem
• The vehicle routing problem. Latest advances and new challenges.
• An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
• The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
• A result on projection for the vehicle routing problem
• The ellipsoid method and its consequences in combinatorial optimization
• 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
• The Truck Dispatching Problem
• Applications of Linear Programming in the Oil Industry
• Energy Minimizing Vehicle Routing Problem
• An Integer Programming Approach to the Vehicle Scheduling Problem
• A set‐partitioning‐based exact algorithm for the vehicle routing problem
• An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation