An effective memetic algorithm for the cumulative capacitated vehicle routing problem

DOI10.1016/J.COR.2009.06.014MaRDI QIDQ975996zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

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

Cited in

(55)

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

Describes a project that uses

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)