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

DOI10.1016/J.COR.2009.06.022zbMATH Open1175.90046OpenAlexW1979488556WikidataQ110086001 ScholiaQ110086001MaRDI QIDQ1040973FDOQ1040973

Authors Yuichi Nagata, Olli Bräysy, Wout 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

time windowspenalty functionvehicle routingmemetic algorithm

Mathematics Subject Classification ID

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

Recommendations

• A memetic algorithm for the vehicle routing problem with time windows
• Edge assembly-based memetic algorithm for the capacitated vehicle routing problem
• scientific article; zbMATH DE number 5179131
• Solve the vehicle routing problem with time windows via a genetic algorithm
• A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows

Cites Work

• scientific article; zbMATH DE number 1082108 (Why is no real title available?)
• scientific article; zbMATH DE number 1749226 (Why is no real title available?)
• A Tabu Search Heuristic for the Vehicle Routing Problem
• A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows
• A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
• A general heuristic for vehicle routing problems
• A parallel hybrid genetic algorithm for the vehicle routing problem with time windows
• A powerful route minimization heuristic for the vehicle routing problem with time windows
• A two-phase hybrid metaheuristic for the vehicle routing problem with time windows
• A two-stage heuristic with ejection pools and generalized ejection chains for the vehicle routing problem with time windows
• Active guided evolution strategies for large-scale vehicle routing problems with time windows
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• An Exchange Heuristic for Routeing Problems with Time Windows
• An iterated local search algorithm for the vehicle routing problem with convex time penalty functions
• Guided Local Search
• Lagrangian duality applied to the vehicle routing problem with time windows
• Subset-Row Inequalities 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\geq 3\)
• The vehicle routing problem. Latest advances and new challenges.
• Two Evolutionary Metaheuristics For The Vehicle Routing Problem With Time Windows
• Vehicle routing problem with elementary shortest path based column generation

Cited In (48)

• A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service
• Memetic search for the minmax multiple traveling salesman problem with single and multiple depots
• A hybrid algorithm for the drilling rig routing problem
• A multi-objective vehicle routing and scheduling problem with uncertainty in customers' request and priority
• An efficient optimisation procedure for the workforce scheduling and routing problem: Lagrangian relaxation and iterated local search
• Granular tabu search for the pickup and delivery problem with time windows and electric vehicles
• Home chemotherapy delivery: an integrated production scheduling and multi-trip vehicle routing problem
• Adaptive large neighborhood search for vehicle routing problems with transshipment facilities arising in city logistics
• Edge assembly-based memetic algorithm for the capacitated vehicle routing problem
• A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet
• Fleet resupply by drones for last-mile delivery
• Industrial and tramp ship routing problems: closing the gap for real-scale instances
• Branch-and-price and constraint programming for solving a real-life technician dispatching problem
• A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
• Routing a mix of conventional, plug-in hybrid, and electric vehicles
• 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
• Multi-armed bandit-based hyper-heuristics for combinatorial optimization problems
• 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
• An iterated local search for the multi-commodity multi-trip vehicle routing problem with time windows
• A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
• Deep infeasibility exploration method for vehicle routing problems
• A hybrid algorithm for time-dependent vehicle routing problem with time windows
• A hybrid genetic algorithm for the Hamiltonian p‐median problem
• 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
• A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading
• A decomposition based memetic algorithm for multi-objective vehicle routing problem with time windows
• Scheduled penalty variable neighborhood search
• A unified solution framework for multi-attribute vehicle routing problems
• Recent progress of local search in handling the time window constraints of the vehicle routing problem
• Recent progress of local search in handling the time window constraints of the vehicle routing problem
• Designing sustainable mid-haul logistics networks with intra-route multi-resource facilities
• 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
• Heuristics for vehicle routing problems with backhauls, time windows, and 3D loading constraints
• High-level relay hybrid metaheuristic method for multi-depot vehicle routing problem with time windows
• A memetic algorithm for the vehicle routing problem with time windows
• Multi-depot vehicle routing problem with time windows under shared depot resources
• Designing granular solution methods for routing problems with time windows
• The Vehicle Routing Problem with Release and Due Dates
• Scheduling issues in vehicle routing

Uses Software

• VRP

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

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