Vehicle Routing with Time Windows: Two Optimization Algorithms
From MaRDI portal
(Redirected from Publication:4367240)
Recommendations
- An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- scientific article; zbMATH DE number 4047423
- Vehicle Routing with Time Windows
- An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints
Cited in
(32)- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP
- A synthesis of assignment and heuristic solutions for vehicle routing with time windows
- A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
- A two-echelon inventory optimization model with demand time window considerations
- Approximation algorithms for some extensions of the maximum profit routing problem
- Scatter search for the vehicle routing problem with time windows
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- Vehicle Routing Problem with Time Windows
- scientific article; zbMATH DE number 3912132 (Why is no real title available?)
- scientific article; zbMATH DE number 4085396 (Why is no real title available?)
- An assignment-based heuristic for vehicle routing with time windows
- Vehicle Routing with Time Windows
- Lagrangian Relaxation Methods for Solving the Minimum Fleet Size Multiple Traveling Salesman Problem with Time Windows
- Local optimization of routes in vehicle routing problems with time windows
- Approximate and robust bounded job start scheduling for Royal Mail delivery offices
- A branch-and-bound approach for a vehicle routing problem with customer costs
- Routing optimization with time windows under uncertainty
- A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Vehicle routing problem with time windows -- new valid inequalities from polar duality
- An optimization algorithm for a capacitated vehicle routing problem with time windows
- scientific article; zbMATH DE number 5308350 (Why is no real title available?)
- Urban regional logistics distribution path planning considering road characteristics
- Local search with annealing-like restarts to solve the VRPTW
- Formulations and exact algorithms for the vehicle routing problem with time windows
- Lagrangian duality applied to the vehicle routing problem with time windows
- Survey of research in the design and control of automated guided vehicle systems
- An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints
- A route-neighborhood-based metaheuristic for vehicle routing problem with time windows
- The vehicle routing problem with floating targets: formulation and solution approaches
- A reactive MILP approach to the multidepot heterogeneous fleet vehicle routing problem with time windows
This page was built for publication: Vehicle Routing with Time Windows: Two Optimization Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4367240)
