Efficient elementary and restricted non-elementary route pricing
From MaRDI portal
Publication:297071
DOI10.1016/j.ejor.2014.05.005zbMath1339.90061OpenAlexW2088672099MaRDI QIDQ297071
Rafael Martinelli, Diego Pecin, Marcus Poggi
Publication date: 24 June 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2014.05.005
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)
Related Items (22)
A column generation approach for a multi-attribute vehicle routing problem ⋮ Stronger multi-commodity flow formulations of the capacitated vehicle routing problem ⋮ A branch-and-price approach for a multi-period vehicle routing problem ⋮ Reformulations and branch-and-price algorithm for the minimum cost hop-and-root constrained forest problem ⋮ A branch-and-price algorithm for the minimum latency problem ⋮ Improved branch-cut-and-price for capacitated vehicle routing ⋮ Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem ⋮ The joint network vehicle routing game with optional customers ⋮ An exact solution approach for the inventory routing problem with time windows ⋮ Selective routing problem with synchronization ⋮ The vehicle routing problem with service level constraints ⋮ A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows ⋮ Selective arc‐ng pricing for vehicle routing ⋮ Linear edge costs and labeling algorithms: The case of the time‐dependent vehicle routing problem with time windows ⋮ New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows ⋮ A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows ⋮ The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time ⋮ A branch-and-price algorithm for a vehicle routing with demand allocation problem ⋮ Route relaxations on GPU for vehicle routing problems ⋮ Branch-price-and-cut for the mixed capacitated general routing problem with time windows ⋮ Industrial and tramp ship routing problems: closing the gap for real-scale instances ⋮ The conditional \(p\)-dispersion problem
Uses Software
Cites Work
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- Improved lower bounds and exact algorithm for the capacitated arc routing problem
- A computational study of solution approaches for the resource constrained elementary shortest path problem
- An efficient transformation of the generalized vehicle routing problem
- A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
- Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
- Vehicle routing problem with elementary shortest path based column generation
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Accelerated label setting algorithms for the elementary resource constrained shortest path problem
- A survey of resource constrained shortest path problems: Exact solution approaches
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
- The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
- New dynamic programming algorithms for the resource constrained elementary shortest path problem
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- Improved Branch-Cut-and-Price for Capacitated Vehicle Routing
This page was built for publication: Efficient elementary and restricted non-elementary route pricing
