Formulations and exact algorithms for the vehicle routing problem with time windows
From MaRDI portal
Publication:2468488
DOI10.1016/J.COR.2006.11.006zbMATH Open1180.90052OpenAlexW1977133702MaRDI QIDQ2468488FDOQ2468488
Authors: Brian Kallehauge 
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
Recommendations
- scientific article; zbMATH DE number 4047423
- scientific article; zbMATH DE number 3985132
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles
- Exact algorithms for the vehicle routing problem with soft time windows
- An exact solution framework for multitrip vehicle-routing problems with time windows
- New enhancements for the exact solution of the vehicle routing problem with time windows
- Exact and heuristic algorithms for the vehicle routing problem with multiple interdependent time windows
- A GRASP for the Vehicle Routing Problem with Time Windows
- Vehicle Routing with Time Windows: Two Optimization Algorithms
Cites Work
- The travelling salesman problem as a constrained shortest path problem: Theory and computational experience
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Title not available (Why is that?)
- Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
- Title not available (Why is that?)
- A reoptimization algorithm for the shortest path problem with time windows
- A branch-and-cut algorithm for the capacitated profitable tour problem
- The shortest-path problem with resource constraints and \(k\)-cycle elimination for \(k\geq 3\)
- Integer Programming Formulation of Traveling Salesman Problems
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- Solution of a Large-Scale Traveling-Salesman Problem
- Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- The truck dispatching problem
- The vehicle routing problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- The Cutting-Plane Method for Solving Convex Programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Validation of subgradient optimization
- Title not available (Why is that?)
- The Traveling-Salesman Problem and Minimum Spanning Trees
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- The traveling-salesman problem and minimum spanning trees: Part II
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- Vehicle Routing Problem with Time Windows
- Decomposition Principle for Linear Programs
- Title not available (Why is that?)
- Newton's method for convex programming and Tschebyscheff approximation
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
- 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
- 2-path cuts for the vehicle routing problem with time windows
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
- The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
- Title not available (Why is that?)
- Title not available (Why is that?)
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- A new approach to the minimum cut problem
- A polyhedral study of the asymmetric traveling salesman problem with time windows
- Title not available (Why is that?)
- Path inequalities for the vehicle routing problem with time windows
- The precedence-constrained asymmetric traveling salesman polytope
- Routing with time windows by column generation
- An algorithm for the resource constrained shortest path problem
- State-space relaxation procedures for the computation of bounds to routing problems
- A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows
- Branch-and-Price Heuristics: A Case Study on the Vehicle Routing Problem with Time Windows
- Optimal Routing under Capacity and Distance Restrictions
- Vehicle Routing with Time Windows
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An exact algorithm for the capacitated shortest spanning arborescence
- An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation
- The complexity of the capacitated tree problem
- Vehicle Routing with Time Windows: Two Optimization Algorithms
- Title not available (Why is that?)
Cited In (36)
- Vehicle routing with soft time windows and stochastic travel times: a column generation and branch-and-price solution approach
- Matheurísticas para resolver el problema de ruteo de vehículos con ventanas de tiempo
- Multigraph modeling and adaptive large neighborhood search for the vehicle routing problem with time windows
- Branch-price-and-cut for the mixed capacitated general routing problem with time windows
- A survey of attended home delivery and service problems with a focus on applications
- A multi-tiered vehicle routing problem with global cross-docking
- A local search heuristic for the pre- and end-haulage of intermodal container terminals
- Using constraint-based operators to solve the vehicle routing problem with time windows
- New enhancements for the exact solution of the vehicle routing problem with time windows
- Ant colony system with characterization-based heuristics for a bottled-products distribution logistics system
- Consistent vehicle routing problem with service level agreements: a case study in the pharmaceutical distribution sector
- Rich vehicle routing problems: from a taxonomy to a definition
- Accounting for cost heterogeneity on the demand in the context of a technician dispatching problem
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
- Vehicle routing with backhauls: review and research perspectives
- Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model
- Path inequalities for the vehicle routing problem with time windows
- The vehicle routing problem with time windows and evidential service and travel times: a recourse model
- A decision framework for automatic guided vehicle routing problem with traffic congestions
- A two-phase heuristic algorithm for the common frequency routing problem with vehicle type choice in the milk run
- A multi‐vehicle covering tour problem with speed optimization
- An iterative vertex coloring algorithm for vehicle routing problems with soft time windows for reverse logistics
- A bi-objective approach for scheduling ground-handling vehicles in airports
- Optimizing the planning of the observation of a catalog of objects by a mobile observer, taking the implicated limitations into account
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- An Extension of Specificity-Based Approximations to Other Belief Function Relations
- Approximation schemes for Euclidean vehicle routing problems with time windows
- An optimization algorithm for a capacitated vehicle routing problem with time windows
- An exact algorithm for the pickup and delivery problem with time windows
- Two-stage vehicle routing problem with arc time windows: a mixed integer programming formulation and a heuristic approach
- A routing and scheduling approach to rail transportation of hazardous materials with demand due dates
- Designing granular solution methods for routing problems with time windows
- Layered Formulation for the Robust Vehicle Routing Problem with Time Windows
- Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows
- Exact algorithms for the vehicle routing problem with soft time windows
- Solving an On-Line Capacitated Vehicle Routing Problem with Structured Time Windows
Uses Software
This page was built for publication: Formulations and exact algorithms for the vehicle routing problem with time windows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2468488)
