An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation
From MaRDI portal
Publication:4367233
Recommendations
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- Vehicle Routing with Time Windows: Two Optimization Algorithms
- scientific article; zbMATH DE number 4085396
- Lagrangian duality applied to the vehicle routing problem with time windows
- scientific article; zbMATH DE number 3912132
Cited in
(45)- Local search with annealing-like restarts to solve the VRPTW
- New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP
- An assignment-based heuristic for vehicle routing with time windows
- The vehicle routing problem with floating targets: formulation and solution approaches
- Finding \(K\) shortest looping paths in a traffic-light network
- Airline fleet assignment concepts, models, and algorithms
- Exact and heuristic algorithms for the vehicle routing problem with multiple interdependent time windows
- Survey of research in the design and control of automated guided vehicle systems
- Optimization of gas metering maintenance services: A multiobjective vehicle routing problem with a set of predefined overlapping time windows
- Pruning in column generation for service vehicle dispatching
- An improved LNS algorithm for real-time vehicle routing problem with time windows
- Vehicle routing problem for multiple product types, compartments, and trips with soft time windows
- Real-time vehicle rerouting problems with time windows
- Fleet assignment and routing with schedule synchronization constraints
- Finding \(K\) shortest looping paths with waiting time in a time--window network
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem
- Formulations and exact algorithms for the vehicle routing problem with time windows
- COMPARISON OF SYSTEMS BASED ON EVOLUTIONARY SEARCH AND SIMULATED ANNEALING TO SOLVE THE VRPTW PROBLEM
- Routing and scheduling field service operation by P-graph
- Shipping problems with body clock constraints.
- scientific article; zbMATH DE number 3912132 (Why is no real title available?)
- scientific article; zbMATH DE number 4085396 (Why is no real title available?)
- A route-neighborhood-based metaheuristic for vehicle routing problem with time windows
- A goal programming approach to vehicle routing problems with soft time windows
- A survey of resource constrained shortest path problems: exact solution approaches
- Bounding the optimum for the problem of scheduling the photographs of an agile Earth observing satellite
- Approximative solutions to the bicriterion vehicle routing problem with time windows
- An integer L-shaped algorithm for the vehicle routing problem with time windows and stochastic demands
- Lagrangian Relaxation Methods for Solving the Minimum Fleet Size Multiple Traveling Salesman Problem with Time Windows
- Lagrangian duality applied to the vehicle routing problem with time windows
- An iterative vertex coloring algorithm for vehicle routing problems with soft time windows for reverse logistics
- An unpaired pickup and delivery problem with time dependent assignment costs: application in air cargo transportation
- Scatter search for the vehicle routing problem with time windows
- New bundle methods for solving Lagrangian relaxation dual problems
- A two-echelon inventory optimization model with demand time window considerations
- An efficient optimisation procedure for the workforce scheduling and routing problem: Lagrangian relaxation and iterated local search
- The nuclear medicine production and delivery problem
- A heuristic method for dispatching repair men
- scientific article; zbMATH DE number 7155934 (Why is no real title available?)
- A vehicle routing problem with distribution uncertainty in deadlines
- An inventory-routing problem with the objective of travel time minimization
- The first \(K\) shortest unique-arc walks in a traffic-light network
- A column generation approach for a multi-attribute vehicle routing problem
- A light‐touch routing optimization tool (RoOT) for vaccine and medical supply distribution in Mozambique
This page was built for publication: An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4367233)
