An Exchange Heuristic for Routeing Problems with Time Windows
From MaRDI portal
Publication:4868786
DOI10.1057/JORS.1995.204zbMath0843.90043OpenAlexW1993257498MaRDI QIDQ4868786
Jean-Yves Potvin, Jean-Marc Rousseau
Publication date: 7 March 1996
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.1995.204
Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)
Related Items (53)
A parallel hybrid genetic algorithm for the vehicle routing problem with time windows ⋮ An optimization approach for communal home meal delivery service: A case study ⋮ A multi-start local search algorithm for the vehicle routing problem with time windows ⋮ The mixed capacitated general routing problem under uncertainty ⋮ A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem ⋮ The vehicle-routing problem with time windows and driver-specific times ⋮ Applying the attribute based hill climber heuristic to the vehicle routing problem ⋮ A hybrid genetic algorithm for the heterogeneous dial-a-ride problem ⋮ An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics ⋮ An efficient variable neighborhood search heuristic for very large scale vehicle routing problems ⋮ Active-guided evolution strategies for large-scale capacitated vehicle routing problems ⋮ Adaptive large neighborhood search for vehicle routing problems with transshipment facilities arising in city logistics ⋮ Designing sustainable mid-haul logistics networks with intra-route multi-resource facilities ⋮ A sequential GRASP for the therapist routing and scheduling problem ⋮ An adaptive iterated local search heuristic for the heterogeneous fleet vehicle routing problem ⋮ Metaheuristics: A Canadian Perspective ⋮ Local search with annealing-like restarts to solve the VRPTW ⋮ Designing granular solution methods for routing problems with time windows ⋮ Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems ⋮ Memetic search for the minmax multiple traveling salesman problem with single and multiple depots ⋮ A metaheuristic algorithm for a locomotive routing problem arising in the steel industry ⋮ Modeling rolling batch planning as vehicle routing problem with time windows. ⋮ Integrated planning of loaded and empty container movements ⋮ A heuristic algorithm for solving hazardous materials distribution problems. ⋮ Deriving Convergence of Vehicle Routing Problems using a Fictitious Play Approach ⋮ A hybrid GRASP+VND heuristic for the two-echelon vehicle routing problem arising in city logistics ⋮ Vehicle routing with compartments: applications, modelling and heuristics ⋮ Minimizing the maximal ergonomic burden in intra-hospital patient transportation ⋮ An optimization algorithm for solving the rich vehicle routing problem based on variable neighborhood search and tabu search metaheuristics ⋮ Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks ⋮ COMPARISON OF SYSTEMS BASED ON EVOLUTIONARY SEARCH AND SIMULATED ANNEALING TO SOLVE THE VRPTW PROBLEM ⋮ Granular tabu search for the pickup and delivery problem with time windows and electric vehicles ⋮ A multi-start local search heuristic for the green vehicle routing problem based on a multigraph reformulation ⋮ A cooperative parallel metaheuristic for the capacitated vehicle routing problem ⋮ Active guided evolution strategies for large-scale vehicle routing problems with time windows ⋮ Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows ⋮ A two-phase hybrid metaheuristic for the vehicle routing problem with time windows ⋮ Self-imposed time windows in vehicle routing problems ⋮ Edge assembly-based memetic algorithm for the capacitated vehicle routing problem ⋮ Integrated planning for electric commercial vehicle fleets: a case study for retail mid-haul logistics networks ⋮ Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows ⋮ Variable neighborhood search for the stochastic and dynamic vehicle routing problem ⋮ A route-neighborhood-based metaheuristic for vehicle routing problem with time windows ⋮ On the tour planning problem ⋮ A powerful route minimization heuristic for the vehicle routing problem with time windows ⋮ Approximative solutions to the bicriterion vehicle routing problem with time windows ⋮ A two-stage hybrid heuristic solution for the container drayage problem with trailer reposition ⋮ A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows ⋮ Vehicle routing-scheduling for waste collection in Hanoi ⋮ A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls ⋮ Heuristics for multi-attribute vehicle routing problems: a survey and synthesis ⋮ Tabu search heuristics for the vehicle routing problem with time windows. ⋮ Modelization of time-dependent urban freight problems by using a multiple number of distribution centers
This page was built for publication: An Exchange Heuristic for Routeing Problems with Time Windows
