An Exchange Heuristic for Routeing Problems with Time Windows

DOI10.1057/JORS.1995.204zbMATH Open0843.90043OpenAlexW1993257498MaRDI QIDQ4868786FDOQ4868786

Authors: Jean-Yves Potvin, Jean-Marc Rousseau 

Publication date: 7 March 1996

Published in: The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/jors.1995.204

Recommendations

• A heuristic for the vehicle routing problem with time windows
• Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints
• A powerful route minimization heuristic for the vehicle routing problem with time windows
• scientific article; zbMATH DE number 4047422

zbMATH Keywords

time windowsexchange heuristicsvehicle routeing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Transportation, logistics and supply chain management (90B06)

Cited In (60)

• Memetic search for the minmax multiple traveling salesman problem with single and multiple depots
• Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems
• Multi-period time window assignment for attended home delivery
• A metaheuristic algorithm for a locomotive routing problem arising in the steel industry
• Deriving Convergence of Vehicle Routing Problems using a Fictitious Play Approach
• Visiting nurses assignment and routing for decentralized telehealth service networks
• Metaheuristics: A Canadian Perspective
• Title not available (Why is that?)
• A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem
• The mixed capacitated general routing problem under uncertainty
• An adaptive iterated local search heuristic for the heterogeneous fleet vehicle routing problem
• A sequential GRASP for the therapist routing and scheduling problem
• Modelization of time-dependent urban freight problems by using a multiple number of distribution centers
• Minimizing the maximal ergonomic burden in intra-hospital patient transportation
• An Heuristic Method for Solving Time-Sensitive Routeing Problems
• An optimization approach for communal home meal delivery service: A case study
• Granular tabu search for the pickup and delivery problem with time windows and electric vehicles
• Adaptive large neighborhood search for vehicle routing problems with transshipment facilities arising in city logistics
• Integrated planning of loaded and empty container movements
• Applying the attribute based hill climber heuristic to the vehicle routing problem
• A multi-start local search heuristic for the green vehicle routing problem based on a multigraph reformulation
• A heuristic for the vehicle routing problem with time windows
• Edge assembly-based memetic algorithm for the capacitated vehicle routing problem
• An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
• A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
• An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
• Variable neighborhood search for the stochastic and dynamic vehicle routing problem
• Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks
• Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows
• Integrated planning for electric commercial vehicle fleets: a case study for retail mid-haul logistics networks
• Vehicle routing with compartments: applications, modelling and heuristics
• A multi-start local search algorithm for the vehicle routing problem with time windows
• A two-phase hybrid metaheuristic for the vehicle routing problem with time windows
• The vehicle-routing problem with time windows and driver-specific times
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
• Self-imposed time windows in vehicle routing problems
• Exchanges procedures for timetabling problems
• A powerful route minimization heuristic for the vehicle routing problem with time windows
• On the tour planning problem
• A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls
• Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows
• Designing sustainable mid-haul logistics networks with intra-route multi-resource facilities
• Active-guided evolution strategies for large-scale capacitated vehicle routing problems
• Approximative solutions to the bicriterion vehicle routing problem with time windows
• Modeling rolling batch planning as vehicle routing problem with time windows.
• An optimization algorithm for solving the rich vehicle routing problem based on variable neighborhood search and tabu search metaheuristics
• Tabu search heuristics for the vehicle routing problem with time windows.
• Vehicle routing-scheduling for waste collection in Hanoi
• An efficient implementation of local search algorithms for constrained routing problems
• A parallel hybrid genetic algorithm for the vehicle routing problem with time windows
• A hybrid GRASP+VND heuristic for the two-echelon vehicle routing problem arising in city logistics
• Local search with annealing-like restarts to solve the VRPTW
• Designing granular solution methods for routing problems with time windows
• A heuristic algorithm for solving hazardous materials distribution problems.
• A hybrid genetic algorithm for the heterogeneous dial-a-ride problem
• A two-stage hybrid heuristic solution for the container drayage problem with trailer reposition
• COMPARISON OF SYSTEMS BASED ON EVOLUTIONARY SEARCH AND SIMULATED ANNEALING TO SOLVE THE VRPTW PROBLEM
• A cooperative parallel metaheuristic for the capacitated vehicle routing problem
• Active guided evolution strategies for large-scale vehicle routing problems with time windows
• A route-neighborhood-based metaheuristic for vehicle routing problem with time windows

This page was built for publication: An Exchange Heuristic for Routeing Problems with Time Windows

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4868786)