Route relaxations on GPU for vehicle routing problems
From MaRDI portal
Publication:1751660
DOI10.1016/j.ejor.2016.09.050zbMath1394.90542OpenAlexW2528734211WikidataQ59195710 ScholiaQ59195710MaRDI QIDQ1751660
Vittorio Maniezzo, Marco Antonio Boschetti, Francesco Strappaveccia
Publication date: 25 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.09.050
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06) Dynamic programming (90C39)
Related Items (2)
Guidelines for the computational testing of machine learning approaches to vehicle routing problems ⋮ Adaptive large neighborhood search on the graphics processing unit
Uses Software
Cites Work
- Efficient elementary and restricted non-elementary route pricing
- The vehicle routing problem. Latest advances and new challenges.
- Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
- Solving path problems on the GPU
- Solving knapsack problems on GPU
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
- Very large-scale vehicle routing: new test problems, algorithms, and results
- Combinatorial Optimization
- The Truck Dispatching Problem
- Using GPU Computing for Solving the Two-Dimensional Guillotine Cutting Problem
- 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
- State-space relaxation procedures for the computation of bounds to routing problems
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- A set covering based matheuristic for a real‐world city logistics problem
- Cvrplib
This page was built for publication: Route relaxations on GPU for vehicle routing problems
