An effective memetic algorithm for the cumulative capacitated vehicle routing problem

DOI10.1016/j.cor.2009.06.014zbMath1188.90037OpenAlexW2002663664MaRDI QIDQ975996

Roberto Wolfler Calvo, Sandra Ulrich Ngueveu, Christian Prins

Publication date: 11 June 2010

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

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

zbMATH Keywords

metaheuristicmemetic algorithmtraveling repairman problemcumulative capacitated vehicle routing problemrouting for relief

Mathematics Subject Classification ID

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

Related Items

New formulations and solution approaches for the latency location routing problem, Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem, The latency location-routing problem, Heuristics for the traveling repairman problem with profits, An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size, A branch-and-price algorithm for the minimum latency problem, An effective hybrid search algorithm for the multiple traveling repairman problem with profits, A POPMUSIC approach for the multi-depot cumulative capacitated vehicle routing problem, The hierarchical traveling salesman problem, Modeling emergency response operations: a theory building survey, A hybrid ant colony optimization-variable neighborhood descent approach for the cumulative capacitated vehicle routing problem, An online optimization approach for post-disaster relief distribution with online blocked edges, A comparison of three metaheuristics for the workover rig routing problem, A simple and effective metaheuristic for the minimum latency problem, Routing multiple work teams to minimize latency in post-disaster road network restoration, Efficient frameworks for greedy split and new depth first search split procedures for routing problems, The multi-vehicle cumulative covering tour problem, Skewed general variable neighborhood search for the cumulative capacitated vehicle routing problem, Finished-vehicle transporter routing problem solved by loading pattern discovery, Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND, Improving a state‐of‐the‐art heuristic for the minimum latency problem with data mining, Effective metaheuristics for the latency location routing problem, An iterated local search algorithm for latency vehicle routing problems with multiple depots, The Surgical Patient Routing Problem: A Central Planner Approach, A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem, The cumulative school bus routing problem: Polynomial‐size formulations, Modeling and simulation for microscopic traffic flow based on multiple headway, velocity and acceleration difference, Bio-inspired meta-heuristics for emergency transportation problems, Minimizing customers' waiting time in a vehicle routing problem with unit demands, A truck and drones model for last-mile delivery: a mathematical model and heuristic approach, A bi-level model and memetic algorithm for arc interdiction location-routing problem, The demand weighted vehicle routing problem, The freight consolidation and containerization problem, Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints, An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem, Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem, Heuristic solution approaches for the cumulative capacitated vehicle routing problem, An adaptive large neighborhood search approach for multiple traveling repairman problem with profits, A memetic algorithm approach for solving the multidimensional multi-way number partitioning problem, A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem, A unified solution framework for multi-attribute vehicle routing problems, A memetic algorithm for the orienteering problem with hotel selection, A hybrid reactive GRASP heuristic for the risk-averse \(k\)-traveling repairman problem with profits, Exact and heuristic algorithms for solving the generalized vehicle routing problem with flexible fleet size, Bilayer local search enhanced particle swarm optimization for the capacitated vehicle routing problem, The multi-depot \(k\)-traveling repairman problem, A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem, A cumulative unmanned aerial vehicle routing problem approach for humanitarian coverage path planning, Two-stage vehicle routing problem with arc time windows: a mixed integer programming formulation and a heuristic approach, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis

Uses Software

• VRP

Cites Work

• Exact algorithms for the minimum latency problem
• A simple and effective evolutionary algorithm for the vehicle routing problem
• The linear ordering problem with cumulative costs
• Lagrangian duality applied to the vehicle routing problem with time windows
• The minimum latency problem
• A Faster, Better Approximation Algorithm for the Minimum Latency Problem
• Energy Minimizing Vehicle Routing Problem
• The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
• The Delivery Man Problem and Cumulative Matroids
• The traveling salesman problem with cumulative costs
• Approximations for minimum and min-max vehicle routing problems
• A heuristic for the vehicle routing problem with time windows
• Unnamed Item
• Unnamed Item