Pricing routines for vehicle routing with time windows on road networks
From MaRDI portal
Publication:337163
DOI10.1016/j.cor.2014.06.022zbMath1348.90547OpenAlexW1979649770WikidataQ57702138 ScholiaQ57702138MaRDI QIDQ337163
Saeideh D. Nasiri, Adam N. Letchford, Amar Oukil
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://eprints.lancs.ac.uk/id/eprint/69001/4/working_paper_Letchford_Nasiri2.pdf
Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Dynamic programming (90C39)
Related Items (10)
The time-dependent shortest path and vehicle routing problem ⋮ The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem ⋮ Empirical analysis for the VRPTW with a multigraph representation for the road network ⋮ Vehicle routing on road networks: how good is Euclidean approximation? ⋮ Safe and secure vehicle routing: a survey on minimization of risk exposure ⋮ Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs ⋮ The Steiner bi-objective shortest path problem ⋮ Multigraph modeling and adaptive large neighborhood search for the vehicle routing problem with time windows ⋮ The time-dependent vehicle routing problem with time windows and road-network information ⋮ Tabu search for the time-dependent vehicle routing problem with time windows on a road network
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Compact formulations of the Steiner traveling salesman problem and related problems
- The vehicle routing problem. Latest advances and new challenges.
- A comparison of solution strategies for biobjective shortest path problems
- Exploiting sparsity in pricing routines for the capacitated arc routing problem
- A cutting plane procedure for the travelling salesman problem on road networks
- Reachability cuts for the vehicle routing problem with time windows
- Vehicle routing problem with elementary shortest path based column generation
- Lagrangian duality applied to the vehicle routing problem with time windows
- Solving capacitated arc routing problems using a transformation to the CVRP
- Vehicle routing problems with alternative paths: an application to on-demand transportation
- The Vehicle Routing Problem
- An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows
- 2-Path Cuts for the Vehicle Routing Problem with Time Windows
- A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows
- New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows
- 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
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- The traveling salesman problem on a graph and some related integer polyhedra
- Routing with time windows by column generation
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- A fundamental problem in vehicle routing
- 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
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
- Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem
- A cutting plane algorithm for the general routing problem
- Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
This page was built for publication: Pricing routines for vehicle routing with time windows on road networks
