Vehicle Routing with Time Windows: Two Optimization Algorithms
From MaRDI portal
Publication:4367240
DOI10.1287/opre.45.3.488zbMath0891.90061OpenAlexW2001944236MaRDI QIDQ4367240
Marshall L. Fisher, Oli B. G. Madsen, Kurt O. Jørnsten
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.488
Related Items
A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows, Routing optimization with time windows under uncertainty, A branch-and-bound approach for a vehicle routing problem with customer costs, Local search with annealing-like restarts to solve the VRPTW, The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches, 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, A route-neighborhood-based metaheuristic for vehicle routing problem with time windows, Approximate and robust bounded job start scheduling for Royal Mail delivery offices, Urban regional logistics distribution path planning considering road characteristics, A reactive MILP approach to the multidepot heterogeneous fleet vehicle routing problem with time windows, Scatter search for the vehicle routing problem 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, Survey of research in the design and control of automated guided vehicle systems, Approximation algorithms for some extensions of the maximum profit routing problem
