A heuristic for cumulative vehicle routing using column generation
From MaRDI portal
Publication:2357169
DOI10.1016/j.dam.2016.05.030zbMath1373.90018OpenAlexW2470126219MaRDI QIDQ2357169
Rishi Ranjan Singh, Daya Ram Gaur
Publication date: 19 June 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.05.030
Linear programming (90C05) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)
Related Items
The arc-item-load and related formulations for the cumulative vehicle routing problem, Improved approximation algorithms for cumulative VRP with stochastic demands, Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network, A matheuristic for tactical locomotive and driver scheduling for the swiss national railway company SBB Cargo AG, The multi-depot \(k\)-traveling repairman problem
Uses Software
Cites Work
- Unnamed Item
- A review of recent research on green road freight transportation
- A column generation algorithm for the vehicle routing problem with soft time windows
- A tutorial on column generation and branch-and-price for vehicle routing problems
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- The vehicle routing problem: An overview of exact and approximate algorithms
- On the ratio of optimal integral and fractional covers
- New classes of efficiently solvable generalized traveling salesman problems
- Development of a fuel consumption optimization model for the capacitated vehicle routing problem
- Solving VRPTWs with constraint programming based column generation
- Routing vehicles to minimize fuel consumption
- Vehicle routing problem with elementary shortest path based column generation
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
- An approach for analysing transportation costs and a case study
- The Truck Dispatching Problem
- A Suggested Computation for Maximal Multi-Commodity Network Flows
- Approximation Algorithms for Cumulative VRP with Stochastic Demands
- A survey of resource constrained shortest path problems: Exact solution approaches
- The minimum latency problem
- A threshold of ln n for approximating set cover
- Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees
- Energy Minimizing Vehicle Routing Problem
- Optimal Routing under Capacity and Distance Restrictions
- Bounds and Heuristics for Capacitated Routing Problems
- An algorithm for the resource constrained shortest path problem
- State-space relaxation procedures for the computation of bounds to routing problems
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- Approximation Schemes for the Restricted Shortest Path Problem
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
- A heuristic column generation method for the heterogeneous fleet VRP
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- Cumulative Vehicle Routing Problem: A Column Generation Approach
- The traveling salesman problem with cumulative costs
- Shortest Path Problems with Resource Constraints
- The Traveling-Salesman Problem and Minimum Spanning Trees
- Probabilistic Analyses and Practical Algorithms for the Vehicle Routing Problem with Time Windows
- A column generation approach for the split delivery vehicle routing problem
