An effective memetic algorithm for the cumulative capacitated vehicle routing problem

DOI10.1016/J.COR.2009.06.014zbMATH Open1188.90037OpenAlexW2002663664MaRDI QIDQ975996FDOQ975996

Authors: Sandra Ulrich Ngueveu, Christian Prins, Roberto Wolfler Calvo 

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

Recommendations

• An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
• Heuristic solution approaches for the cumulative capacitated vehicle routing problem
• A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
• A two-phase metaheuristic for the cumulative capacitated vehicle routing problem
• A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem

zbMATH Keywords

metaheuristicmemetic algorithmtraveling repairman problemcumulative capacitated vehicle routing problemrouting for relief

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (55)

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

Uses Software

• VRP

This page was built for publication: An effective memetic algorithm for the cumulative capacitated vehicle routing problem

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