Hybrid Heuristics for the Vehicle Routing Problem with Time Windows
From MaRDI portal
Publication:5689144
DOI10.1287/trsc.29.2.156zbMath0860.90052OpenAlexW2126207702MaRDI QIDQ5689144
Publication date: 6 January 1997
Published in: Transportation Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/trsc.29.2.156
heuristicsvehicle routingtime window constraintstour construction and local search tour improvement heuristics
Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)
Related Items
Routing relatively few customers per route, Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context, A multi-start local search algorithm for the vehicle routing problem with time windows, The mixed capacitated general routing problem under uncertainty, An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem, Routing problems: A bibliography, Travel time reliability in vehicle routing and scheduling with time windows, Simulated annealing metaheuristics for the vehicle routing problem with time windows, Metaheuristics: A bibliography, Probabilistic diversification and intensification in local search for vehicle routing, Exact and hyper‐heuristic solutions for the distribution‐installation problem from the VeRoLog 2019 challenge, Two-phase algorithm for solving vehicle routing problem with time windows, Local search with annealing-like restarts to solve the VRPTW, Hybridation de l’algorithme de colonie de Fourmis avec l’algorithme de recherche à grand Voisinage pour la résolution du VRPTW statique et dynamique, A heuristic algorithm for solving hazardous materials distribution problems., Finding the first \(K\) shortest paths in a time-window network., COMPARISON OF SYSTEMS BASED ON EVOLUTIONARY SEARCH AND SIMULATED ANNEALING TO SOLVE THE VRPTW PROBLEM, City-courier routing and scheduling problems, Active guided evolution strategies for large-scale vehicle routing problems with time windows, A two-phase hybrid metaheuristic for the vehicle routing problem with time windows, Finding \(K\) shortest looping paths with waiting time in a time--window network, Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows, A route-neighborhood-based metaheuristic for vehicle routing problem with time windows, Fast local search algorithms for the handicapped persons transportation problem, Minimization of travel time and weighted number of stops in a traffic-light network, Tabu search heuristics for the vehicle routing problem with time windows.
