An adaptive large neighborhood search for a vehicle routing problem with multiple routes

DOI10.1016/j.cor.2013.08.016zbMath1348.90065OpenAlexW1965882376MaRDI QIDQ336781

Jean-Yves Potvin, Nabila Azi, Michel Gendreau

Publication date: 10 November 2016

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

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

zbMATH Keywords

vehicle routing adaptive large neighborhood search multi-level multiple routes ruin-and-recreate

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)

Related Items

The consultation timetabling problem at Danish high schools, Elective course student sectioning at Danish high schools, Multi-trip vehicle routing problem with order release time, Decomposition based hybrid metaheuristics, The fish feed production routing problem, Scheduling unrelated additive manufacturing machines with practical constraints, An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization, Minimum cost VRP with time-dependent speed data and congestion charge, Dynamic design of sales territories, An adaptive large neighborhood search for the discrete and continuous berth allocation problem, An iterated local search for the traveling salesman problem with release dates and completion time minimization, The multiple trip vehicle routing problem with backhauls: formulation and a two-level variable neighbourhood search, An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen, An adaptive large neighbourhood search for asset protection during escaped wildfires, An adaptive large neighborhood search for an E-grocery delivery routing problem, A waste collection problem with service type option, The traveling purchaser problem with fast service option, A comparison of three metaheuristics for the workover rig routing problem, A sample average approximation approach for the stochastic dial-a-ride problem on a multigraph with user satisfaction, Local branching relaxation heuristics for integer linear programs, A two‐tier urban delivery network with robot‐based deliveries, Split-demand multi-trip vehicle routing problem with simultaneous pickup and delivery in airport baggage transit, The vehicle routing problem with time windows and flexible delivery locations, Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows, Order matters -- a variable neighborhood search for the swap-body vehicle routing problem, A survey of attended home delivery and service problems with a focus on applications, Hybridizations of evolutionary algorithms with large neighborhood search, Vehicle routing problems with multiple trips, Оптимальное планирование пассажирских перевозок в региональной авиатранспортной сети, A two-echelon inventory routing problem for perishable products, Vehicle routing problems with multiple trips, A general framework for assessing the value of social data for disaster response logistics planning, The pickup and delivery traveling salesman problem with handling costs, An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem, A hybrid algorithm for time-dependent vehicle routing problem with time windows, Two-echelon vehicle routing problem with satellite bi-synchronization, The dynamic dispatch waves problem for same-day delivery, Multi-trip time-dependent vehicle routing problem with time windows, Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search, Adaptive large neighborhood search for the commodity constrained split delivery VRP, Learning surrogate functions for the short-horizon planning in same-day delivery problems

Uses Software

VRP

Cites Work