An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation
From MaRDI portal
Publication:4367233
DOI10.1287/opre.45.3.395zbMath0890.90059OpenAlexW2104361976MaRDI QIDQ4367233
Publication date: 25 November 1997
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.45.3.395
Related Items (37)
Airline fleet assignment concepts, models, and algorithms ⋮ Finding \(K\) shortest looping paths in a traffic-light network ⋮ A column generation approach for a multi-attribute vehicle routing problem ⋮ A goal programming approach to vehicle routing problems with soft time windows ⋮ An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem ⋮ A heuristic method for dispatching repair men ⋮ Routing and scheduling field service operation by P-graph ⋮ Optimization of gas metering maintenance services: A multiobjective vehicle routing problem with a set of predefined overlapping time windows ⋮ A light‐touch routing optimization tool (RoOT) for vaccine and medical supply distribution in Mozambique ⋮ Local search with annealing-like restarts to solve the VRPTW ⋮ An unpaired pickup and delivery problem with time dependent assignment costs: application in air cargo transportation ⋮ Shipping problems with body clock constraints. ⋮ The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches ⋮ Pruning in column generation for service vehicle dispatching ⋮ New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP ⋮ Formulations and exact algorithms for the vehicle routing problem with time windows ⋮ Vehicle routing problem for multiple product types, compartments, and trips with soft time windows ⋮ Exact and heuristic algorithms for the vehicle routing problem with multiple interdependent time windows ⋮ Real-time vehicle rerouting problems with time windows ⋮ COMPARISON OF SYSTEMS BASED ON EVOLUTIONARY SEARCH AND SIMULATED ANNEALING TO SOLVE THE VRPTW PROBLEM ⋮ The first \(K\) shortest unique-arc walks in a traffic-light network ⋮ New bundle methods for solving Lagrangian relaxation dual problems ⋮ Bounding the optimum for the problem of scheduling the photographs of an agile Earth observing satellite ⋮ Lagrangian duality applied to the vehicle routing problem with time windows ⋮ Finding \(K\) shortest looping paths with waiting time in a time--window network ⋮ A vehicle routing problem with distribution uncertainty in deadlines ⋮ An assignment-based heuristic for vehicle routing with time windows ⋮ An inventory-routing problem with the objective of travel time minimization ⋮ A two-phase approach for jointly determining the lot size and delivery policy in a vendor-buyer integrated system with rework ⋮ A survey of resource constrained shortest path problems: Exact solution approaches ⋮ A route-neighborhood-based metaheuristic for vehicle routing problem with time windows ⋮ Fleet assignment and routing with schedule synchronization constraints ⋮ Approximative solutions to the bicriterion vehicle routing problem with time windows ⋮ Scatter search for the vehicle routing problem with time windows ⋮ A two-echelon inventory optimization model with demand time window considerations ⋮ Survey of research in the design and control of automated guided vehicle systems ⋮ The nuclear medicine production and delivery problem
This page was built for publication: An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation
