A two-phase hybrid metaheuristic for the vehicle routing problem with time windows

DOI10.1016/j.ejor.2004.01.027zbMath1132.90378OpenAlexW2018743970MaRDI QIDQ707148

Jörg Homberger, Hermann Gehring

Publication date: 9 February 2005

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2004.01.027

zbMATH Keywords

Tabu searchMetaheuristicsVehicle routingEvolution strategyHybridizationTime windows

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (36)

An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and synchronized visits ⋮ Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach ⋮ A multi-start local search algorithm for the vehicle routing problem with time windows ⋮ Evaluating two new heuristics for constructing customer clusters in a VRPTW with multiple service workers ⋮ Solution approaches for the vehicle routing problem with occasional drivers and time windows ⋮ An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: application to the MDPVRP ⋮ A knowledge-based evolutionary algorithm for the multiobjective vehicle routing problem with time windows ⋮ An iterated local search for the multi-commodity multi-trip vehicle routing problem with time windows ⋮ Estimation of the arrival time of deliveries by occasional drivers in a crowd-shipping setting ⋮ The vehicle routing problem with flexible time windows and traveling times ⋮ A general heuristic for vehicle routing problems ⋮ The multi-period multi-trip container drayage problem with release and due dates ⋮ A decomposition approach for the stochastic asset protection problem ⋮ The close-open mixed vehicle routing problem ⋮ Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints ⋮ Combining variable neighborhood search and machine learning to solve the vehicle routing problem with crowd-shipping ⋮ An integrated bi-objective optimization model and improved genetic algorithm for vehicle routing problems with temporal and spatial constraints ⋮ A review on integrated scheduling and outbound vehicle routing problems ⋮ Integrated planning of loaded and empty container movements ⋮ Vehicle routing problems with multiple trips ⋮ A P-based hybrid evolutionary algorithm for vehicle routing problem with time windows ⋮ A two-phase heuristic algorithm for the problem of scheduling and vehicle routing for delivery of medication to patients ⋮ An iterated local search algorithm for the vehicle routing problem with convex time penalty functions ⋮ A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs ⋮ Vehicle routing problems with multiple trips ⋮ An iterated local search algorithm for the time-dependent vehicle routing problem with time windows ⋮ Heuristics for vehicle routing problems with backhauls, time windows, and 3D loading constraints ⋮ A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints ⋮ An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows ⋮ A memetic algorithm for the vehicle routing problem with time windows ⋮ A multi‐agent system for the decentralized resource‐constrained multi‐project scheduling problem ⋮ A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows ⋮ The online vehicle routing problem with occasional drivers ⋮ Exact and hybrid methods for the multiperiod field service routing problem ⋮ A two-phase approach for jointly determining the lot size and delivery policy in a vendor-buyer integrated system with rework ⋮ A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows

Uses Software

• MACS-VRPTW
• Tabu search
• GIDEON

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A bi-criteria heuristic for the vehicle routing problem with time windows
• A parallel algorithm for the vehicle routing problem with time window constraints
• Genetic algorithms and tabu search: Hybrids for optimization
• A route-neighborhood-based metaheuristic for vehicle routing problem with time windows
• Future paths for integer programming and links to artificial intelligence
• Simulated annealing metaheuristics for the vehicle routing problem with time windows
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• Solving real-life vehicle routing problems efficiently using tabu search
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Survey Paper—Time Window Constrained Routing and Scheduling Problems
• The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
• A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
• A Reactive Tabu Search Metaheuristic for the Vehicle Routing Problem with Time Windows
• A GRASP for the Vehicle Routing Problem with Time Windows
• An Exchange Heuristic for Routeing Problems with Time Windows
• The Vehicle Routing Problem with Time Windows Part I: Tabu Search
• The Vehicle Routing Problem with Time Windows Part II: Genetic Search
• Computer Solutions of the Traveling Salesman Problem
• Hybrid Heuristics for the Vehicle Routing Problem with Time Windows
• Two Evolutionary Metaheuristics For The Vehicle Routing Problem With Time Windows

This page was built for publication: A two-phase hybrid metaheuristic for the vehicle routing problem with time windows