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

DOI10.1016/J.EJOR.2015.02.028MaRDI QIDQ319445zbMATH OpenOpenAlexDBLPWikidataFDO

Authors 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 programmingmulti-commodity flowsvehicle routing

Mathematics Subject Classification ID

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

Recommendations

• An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
• The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time
• Projection results for vehicle routing
• Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem
• A computational comparison of flow formulations for the capacitated location-routing problem

Cites work

• A branch and bound algorithm for the capacitated vehicle routing problem
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• A result on projection for the vehicle routing 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
• An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
• An Integer Programming Approach to the Vehicle Scheduling Problem
• Applications of linear programming in the oil industry
• Efficient elementary and restricted non-elementary route pricing
• Energy Minimizing Vehicle Routing Problem
• scientific article; zbMATH DE number 3126094 (Why is no real title available?)
• scientific article; zbMATH DE number 3156381 (Why is no real title available?)
• scientific article; zbMATH DE number 1749228 (Why is no real title available?)
• scientific article; zbMATH DE number 758742 (Why is no real title available?)
• scientific article; zbMATH DE number 1452992 (Why is no real title available?)
• Multistars, partial multistars and the capacitated vehicle routing problem
• Projection results for vehicle routing
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• The ellipsoid method and its consequences in combinatorial optimization
• The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
• The truck dispatching problem
• The vehicle routing problem. Latest advances and new challenges.

Cited in

(29)

• A result on projection for the vehicle routing problem
• Multistars, partial multistars and the capacitated vehicle routing problem
• Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm
• The flexible periodic vehicle routing problem
• The shared customer collaboration vehicle routing problem
• A matheuristic for the asymmetric capacitated vehicle routing problem
• Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems
• The separation problem of rounded capacity inequalities: some polynomial cases
• On the complexity of the separation problem for rounded capacity inequalities
• A computational comparison of flow formulations for the capacitated location-routing problem
• The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time
• The Steiner traveling salesman problem and its extensions
• Strong cuts from compatibility relations for the dial-a-ride problem
• A tailored Benders decomposition approach for last-mile delivery with autonomous robots
• Comparison of formulations for the inventory routing problem
• The arc-item-load and related formulations for the cumulative vehicle routing problem
• Mixed integer formulations for a routing problem with information collection in wireless networks
• Multi-depot rural postman problems
• A symmetry-free polynomial formulation of the capacitated vehicle routing problem
• Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem
• Asymmetric multidepot vehicle routing problems: valid inequalities and a branch-and-cut algorithm
• An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
• 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
• Distributionally robust chance-constrained multicommodity network flow problem in dynamic networks: a column-generation approach
• Formulations and branch-and-cut algorithms for cycle covers with up to p cycles
• New formulations for the robust vehicle routing problem with time windows under demand and travel time uncertainty
• A branch-and-price algorithm for fast and equitable last-mile relief aid distribution

Describes a project that uses

Uses Software

• VRP
• CVRPSP

This page was built for publication: Stronger multi-commodity flow formulations of the capacitated vehicle routing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q319445)