A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows

DOI10.1016/j.cor.2009.06.022zbMath1175.90046OpenAlexW1979488556WikidataQ110086001 ScholiaQ110086001MaRDI QIDQ1040973

Olli Bräysy, Yuichi Nagata, Wout E. H. Dullaert

Publication date: 27 November 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2009.06.022

zbMATH Keywords

vehicle routingpenalty functiontime windowsmemetic algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)

Related Items (43)

A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service ⋮ Branch-and-price and constraint programming for solving a real-life technician dispatching problem ⋮ Comparison of anticipatory algorithms for a dial-a-ride problem ⋮ On service consistency in multi-period vehicle routing ⋮ An effective iterated two-stage heuristic algorithm for the multiple traveling salesmen problem ⋮ An efficient optimisation procedure for the workforce scheduling and routing problem: Lagrangian relaxation and iterated local search ⋮ The fleet size and mix location-routing problem with time windows: formulations and a heuristic algorithm ⋮ The vehicle-routing problem with time windows and driver-specific times ⋮ The electric fleet size and mix vehicle routing problem with time windows and recharging stations ⋮ A note on the time travel approach for handling time windows in vehicle routing problems ⋮ Coupling a memetic algorithm to simulation models for promising multi-period asset allocations ⋮ 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 ⋮ Scheduled penalty variable neighborhood search ⋮ A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading ⋮ A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows ⋮ A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows ⋮ Deep infeasibility exploration method for 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 hybrid algorithm for the drilling rig routing problem ⋮ Multi-armed bandit-based hyper-heuristics for combinatorial optimization problems ⋮ Minimizing earliness-tardiness costs in supplier networks -- a just-in-time truck routing problem ⋮ A reinforced hybrid genetic algorithm for the traveling salesman problem ⋮ Hybrid genetic algorithm for undirected traveling salesman problems with profits ⋮ Designing granular solution methods for routing problems with time windows ⋮ Memetic search for the minmax multiple traveling salesman problem with single and multiple depots ⋮ A hybrid genetic algorithm for the Hamiltonian p‐median problem ⋮ High-level relay hybrid metaheuristic method for multi-depot vehicle routing problem with time windows ⋮ The Vehicle Routing Problem with Release and Due Dates ⋮ A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet ⋮ Recent progress of local search in handling the time window constraints of the vehicle routing problem ⋮ Routing a mix of conventional, plug-in hybrid, and electric vehicles ⋮ Heuristics for vehicle routing problems with backhauls, time windows, and 3D loading constraints ⋮ A multi-objective vehicle routing and scheduling problem with uncertainty in customers' request and priority ⋮ Granular tabu search for the pickup and delivery problem with time windows and electric vehicles ⋮ Recent progress of local search in handling the time window constraints of the vehicle routing problem ⋮ A hybrid algorithm for time-dependent vehicle routing problem with time windows ⋮ Scheduling issues in vehicle routing ⋮ Multi-depot vehicle routing problem with time windows under shared depot resources ⋮ A unified solution framework for multi-attribute vehicle routing problems ⋮ Industrial and tramp ship routing problems: closing the gap for real-scale instances ⋮ Heuristics for multi-attribute vehicle routing problems: a survey and synthesis

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• A two-phase hybrid metaheuristic for the vehicle routing problem with time windows
• A general heuristic for vehicle routing problems
• The vehicle routing problem. Latest advances and new challenges.
• An iterated local search algorithm for the vehicle routing problem with convex time penalty functions
• A powerful route minimization heuristic for the vehicle routing problem with time windows
• Active guided evolution strategies for large-scale vehicle routing problems with time windows
• A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
• A parallel hybrid genetic algorithm for the vehicle routing problem with time windows
• Vehicle routing problem with elementary shortest path based column generation
• Lagrangian duality applied to the vehicle routing problem with time windows
• The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
• The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
• A Two-Stage Heuristic with Ejection Pools and Generalized Ejection Chains for the Vehicle Routing Problem with Time Windows
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows
• Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
• Guided Local Search
• A Tabu Search Heuristic for the Vehicle Routing Problem
• An Exchange Heuristic for Routeing Problems with Time Windows
• Two Evolutionary Metaheuristics For The Vehicle Routing Problem With Time Windows

This page was built for publication: A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows