Vehicle Routing with Time Windows

DOI10.1287/OPRE.35.2.266zbMath0636.90047OpenAlexW2069530841MaRDI QIDQ3777788

Alexander H. G. Rinnooy Kan, Antoon W. J. Kolen, Harry W. J. M. Trienekens

Publication date: 1987

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.35.2.266

zbMATH Keywords

vehicle routingbranch-and-boundtime windowsfixed fleet of vehicles of limited capacitytotal route length

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35)

Related Items (39)

Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context ⋮ A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows ⋮ Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling ⋮ A goal programming approach to vehicle routing problems with soft time windows ⋮ A heuristic method for dispatching repair men ⋮ Routing problems: A bibliography ⋮ A column generation approach to the heterogeneous fleet vehicle routing problem ⋮ A multi-tiered vehicle routing problem with global cross-docking ⋮ Optimization of gas metering maintenance services: A multiobjective vehicle routing problem with a set of predefined overlapping time windows ⋮ Location‐routing problem: a classification of recent research ⋮ Exact and hyper‐heuristic solutions for the distribution‐installation problem from the VeRoLog 2019 challenge ⋮ Local search with annealing-like restarts to solve the VRPTW ⋮ Visiting a network of services with time constraints. ⋮ Vehicle routing problem with time windows and simultaneous delivery and pick-up service based on MCPSO ⋮ Shipping problems with body clock constraints. ⋮ Finding the first \(K\) shortest paths in a time-window network. ⋮ On the computational complexity of the probabilistic traveling salesman problem with deadlines ⋮ The pickup and delivery problem with time windows ⋮ A review of some issues and identification of some barriers in the implementation of FMS ⋮ 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 ⋮ Patrolling security games: definition and algorithms for solving large instances with single patroller and single intruder ⋮ The directed orienteering problem ⋮ Crane scheduling with time windows in circuit board production lines ⋮ Nodal aggregation of resource constraints in a shortest path problem ⋮ Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem ⋮ Scheduling and routing algorithms for AGVs: A survey ⋮ The Robot Routing Problem for Collecting Aggregate Stochastic Rewards ⋮ A diagonal completion and 2-optimal procedure for the travelling salesman problem ⋮ Reliability of a stochastic intermodal logistics network under spoilage and time considerations ⋮ An assignment-based heuristic for vehicle routing with time windows ⋮ A route-neighborhood-based metaheuristic for vehicle routing problem with time windows ⋮ Approximative solutions to the bicriterion vehicle routing problem with time windows ⋮ A stochastic dynamic traveling salesman problem with hard time windows ⋮ A reactive MILP approach to the multidepot heterogeneous fleet vehicle routing problem with time windows ⋮ Survey of research in the design and control of automated guided vehicle systems ⋮ Scheduling of Automated Guided Vehicles in a Decision Making Hierarchy ⋮ Minimization of travel time and weighted number of stops in a traffic-light network ⋮ Fleet routing position-based model for inventory pickup under production shutdown

This page was built for publication: Vehicle Routing with Time Windows