Formulations and exact algorithms for the vehicle routing problem with time windows
From MaRDI portal
Publication:2468488
DOI10.1016/j.cor.2006.11.006zbMath1180.90052OpenAlexW1977133702MaRDI QIDQ2468488
Publication date: 23 January 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2006.11.006
Related Items (21)
Rich vehicle routing problems: from a taxonomy to a definition ⋮ The vehicle routing problem with time windows and evidential service and travel times: a recourse model ⋮ Vehicle routing with backhauls: review and research perspectives ⋮ A bi-objective approach for scheduling ground-handling vehicles in airports ⋮ A two-phase heuristic algorithm for the common frequency routing problem with vehicle type choice in the milk run ⋮ Optimizing the planning of the observation of a catalog of objects by a mobile observer, taking the implicated limitations into account ⋮ A multi-tiered vehicle routing problem with global cross-docking ⋮ A multi‐vehicle covering tour problem with speed optimization ⋮ Designing granular solution methods for routing problems with time windows ⋮ A survey of attended home delivery and service problems with a focus on applications ⋮ Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints ⋮ Multigraph modeling and adaptive large neighborhood search for the vehicle routing problem with time windows ⋮ A decision framework for automatic guided vehicle routing problem with traffic congestions ⋮ Consistent vehicle routing problem with service level agreements: a case study in the pharmaceutical distribution sector ⋮ A routing and scheduling approach to rail transportation of hazardous materials with demand due dates ⋮ Branch-price-and-cut for the mixed capacitated general routing problem with time windows ⋮ Accounting for cost heterogeneity on the demand in the context of a technician dispatching problem ⋮ Vehicle routing with soft time windows and stochastic travel times: a column generation and branch-and-price solution approach ⋮ A two-phase approach for jointly determining the lot size and delivery policy in a vendor-buyer integrated system with rework ⋮ A local search heuristic for the pre- and end-haulage of intermodal container terminals ⋮ Ant colony system with characterization-based heuristics for a bottled-products distribution logistics system
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A reoptimization algorithm for the shortest path problem with time windows
- Newton's method for convex programming and Tschebyscheff approximation
- The travelling salesman problem as a constrained shortest path problem: Theory and computational experience
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- The precedence-constrained asymmetric traveling salesman polytope
- An exact algorithm for the capacitated shortest spanning arborescence
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- A branch-and-cut algorithm for the capacitated profitable tour problem
- 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
- Lagrangian duality applied to the vehicle routing problem with time windows
- The Truck Dispatching Problem
- The Vehicle Routing Problem
- 2-Path Cuts for the Vehicle Routing Problem with Time Windows
- 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
- Decomposition Principle for Linear Programs
- The Cutting-Plane Method for Solving Convex Programs
- Integer Programming Formulation of Traveling Salesman Problems
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- Routing with time windows by column generation
- Optimal Routing under Capacity and Distance Restrictions
- Vehicle Routing with Time Windows
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- An algorithm for the resource constrained shortest path problem
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
- The complexity of the capacitated tree 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
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
- 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 Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation
- Vehicle Routing with Time Windows: Two Optimization Algorithms
- A new approach to the minimum cut problem
- A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows
- A polyhedral study of the asymmetric traveling salesman problem with time windows
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- Validation of subgradient optimization
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
- Path inequalities for the vehicle routing problem with time windows
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- Solution of a Large-Scale Traveling-Salesman Problem
- Vehicle Routing Problem with Time Windows
- Branch-and-Price Heuristics: A Case Study on the Vehicle Routing Problem with Time Windows
- The Traveling-Salesman Problem and Minimum Spanning Trees
- The traveling-salesman problem and minimum spanning trees: Part II
- Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
This page was built for publication: Formulations and exact algorithms for the vehicle routing problem with time windows
