An effective memetic algorithm for the cumulative capacitated vehicle routing problem

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

Christian Prins, Roberto Wolfler Calvo, Sandra Ulrich Ngueveu

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

Exact and heuristic algorithms for solving the generalized vehicle routing problem with flexible fleet size, Heuristic solution approaches for the cumulative capacitated vehicle 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, 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, Finished-vehicle transporter routing problem solved by loading pattern discovery, A branch-and-price algorithm for the minimum latency problem, The multi-vehicle cumulative covering tour problem, Minimizing customers' waiting time in a vehicle routing problem with unit demands, The demand weighted vehicle routing problem, An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem, A memetic algorithm approach for solving the multidimensional multi-way number partitioning problem, A comparison of three metaheuristics for the workover rig routing problem, A simple and effective metaheuristic for the minimum latency problem, The freight consolidation and containerization problem, Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints, A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem, 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, Modeling and simulation for microscopic traffic flow based on multiple headway, velocity and acceleration difference, 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, The Surgical Patient Routing Problem: A Central Planner Approach

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