An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem

DOI10.1016/j.cor.2011.05.005zbMath1251.90057OpenAlexW1999257035MaRDI QIDQ1762031

Gilbert Laporte, Glaydston Mattos Ribeiro

Publication date: 15 November 2012

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

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

zbMATH Keywords

metaheuristicsadaptive large neighborhood searchdisaster reliefcumulative objective

Mathematics Subject Classification ID

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

Related Items

The consultation timetabling problem at Danish high schools, Elective course student sectioning at Danish high schools, An adaptive large neighborhood search for relocating vehicles in electric carsharing services, A heuristic approach for a real-world electric vehicle routing problem, Integrating order delivery and return operations for order fulfillment in an online retail environment, 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, Battery swap station location-routing problem with capacitated electric vehicles, Dynamic design of sales territories, Visualizing proportions and dissimilarities by space-filling maps: a large neighborhood search approach, A large neighborhood search heuristic for supply chain network design, A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem, GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem, The periodic supply vessel planning problem with flexible departure times and coupled vessels, An effective heuristic for solving a combined cargo and inventory routing problem in tramp shipping, An adaptive large neighborhood search for an E-grocery delivery routing 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 distributionally robust machine scheduling problem with job selection and sequence-dependent setup times, Modeling emergency response operations: a theory building survey, Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order, A hybrid ant colony optimization-variable neighborhood descent approach for the cumulative capacitated vehicle 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, A survey of adaptive large neighborhood search algorithms and applications, The multi-vehicle cumulative covering tour problem, Truck and drone routing problem with synchronization on arcs, An ALNS-based matheuristic algorithm for a multi-product many-to-many maritime inventory routing problem, Skewed general variable neighborhood search for the cumulative capacitated vehicle routing problem, Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND, An iterated local search algorithm for latency vehicle routing problems with multiple depots, Mobility offer allocations in corporate settings, The Surgical Patient Routing Problem: A Central Planner Approach, Benchmark Suite for Industrial and Tramp Ship Routing and Scheduling Problems, Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network, A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem, A unified matheuristic for solving multi-constrained traveling salesman problems with profits, Exact and heuristic algorithms for the fleet composition and periodic routing problem of offshore supply vessels with berth allocation decisions, The two-echelon capacitated electric vehicle routing problem with battery swapping stations: formulation and efficient methodology, A general framework for assessing the value of social data for disaster response logistics planning, A metaheuristic for the time-dependent pollution-routing problem, Scheduling identical parallel machines with tooling constraints, An efficient matheuristic for offline patient-to-bed assignment problems, Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints, Heuristic solution approaches for the cumulative capacitated vehicle routing problem, An adaptive large neighborhood search approach for multiple traveling repairman problem with profits, A matheuristic method for the electric vehicle routing problem with time windows and fast chargers, A hybrid algorithm for time-dependent vehicle routing problem with time windows, Two-echelon vehicle routing problem with satellite bi-synchronization, Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search, Robust car sequencing for automotive assembly, 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 hybrid reactive GRASP heuristic for the risk-averse \(k\)-traveling repairman problem with profits, Distance-based adaptive large neighborhood search algorithm for green-PDPTW, A modeling framework and local search solution methodology for a production-distribution problem with supplier selection and time-aggregated quantity discounts, Exact and heuristic algorithms for solving the generalized vehicle routing problem with flexible fleet size, The multi-depot \(k\)-traveling repairman problem, A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem, Adaptive Iterated Local Search with Random Restarts for the Balanced Travelling Salesman Problem, A cumulative unmanned aerial vehicle routing problem approach for humanitarian coverage path planning, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• An adaptive large neighborhood search for a vehicle routing problem with multiple routes
• The delivery man problem with time windows
• A unified heuristic for a large class of vehicle routing problems with backhauls
• A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine
• A comparison of five heuristics for the multiple depot vehicle scheduling problem
• A general heuristic for vehicle routing problems
• An effective memetic algorithm for the cumulative capacitated vehicle routing problem
• The school bus routing problem: a review
• Inequality measures and equitable approaches to location problems
• A simple and effective evolutionary algorithm for the vehicle routing problem
• A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
• A Bi-objective Metaheuristic for Disaster Relief Operation Planning
• The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
• The Delivery Man Problem and Cumulative Matroids
• Time‐dependent traveling salesman problem–the deliveryman case
• Handbook of metaheuristics