The arc-item-load and related formulations for the cumulative vehicle routing problem

DOI10.1016/j.disopt.2022.100710OpenAlexW4281852757MaRDI QIDQ2172084

Mauro Henrique Mulati, Flávio K. Miyazawa, Ricardo Fukasawa

Publication date: 15 September 2022

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

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

zbMATH Keywords

set partitioningcumulative vehicle routing problemarc-itemarc-item-loadarc-load

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Linear programming (90C05) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Uses Software

• VRP
• VRPSolver

Cites Work

• Unnamed Item
• A review of recent research on green road freight transportation
• A matheuristic approach for the pollution-routing problem
• Stronger multi-commodity flow formulations of the capacitated vehicle routing problem
• Classification of travelling salesman problem formulations
• 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
• A new formulation for the traveling deliveryman problem
• The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
• Stabilized column generation
• A branch-and-price algorithm for the minimum latency problem
• Sustainable logistics and transportation. Optimization models and algorithms
• Development of a fuel consumption optimization model for the capacitated vehicle routing problem
• The time dependent traveling salesman problem: polyhedra and algorithm
• The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time
• A generic exact solver for vehicle routing and related problems
• A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
• A heuristic for cumulative vehicle routing using column generation
• Improved branch-cut-and-price for capacitated vehicle routing
• Routing vehicles to minimize fuel consumption
• Approximating the \(k\)-traveling repairman problem with repair times
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• Projection results for vehicle routing
• The Truck Dispatching Problem
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Applications of Linear Programming in the Oil Industry
• Approximation Algorithms for Cumulative VRP with Stochastic Demands
• A survey of resource constrained shortest path problems: Exact solution approaches
• The minimum latency problem
• New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
• Vehicle Routing
• A Faster, Better Approximation Algorithm for the Minimum Latency Problem
• Energy Minimizing Vehicle Routing Problem
• The complexity of the travelling repairman problem
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
• Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
• Time‐dependent traveling salesman problem–the deliveryman case
• The k -traveling repairmen problem
• Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
• The traveling salesman problem with cumulative costs
• A Primer in Column Generation
• Shortest Path Problems with Resource Constraints