An effective memetic algorithm for the cumulative capacitated vehicle routing problem

DOI10.1016/j.cor.2009.06.014zbMath1188.90037MaRDI 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

metaheuristic; memetic algorithm; traveling repairman problem; cumulative capacitated vehicle routing problem; routing for relief

Mathematics Subject Classification ID

90B06: Transportation, logistics and supply chain management

90C59: Approximation methods and heuristics in mathematical programming

Related Items

Heuristic solution approaches for the cumulative capacitated vehicle routing problem, The hierarchical traveling salesman problem, Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem, Efficient frameworks for greedy split and new depth first search split procedures for routing problems, An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem, A comparison of three metaheuristics for the workover rig routing problem, A simple and effective metaheuristic for the minimum latency problem, Modeling and simulation for microscopic traffic flow based on multiple headway, velocity and acceleration difference

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• 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