A survey of adaptive large neighborhood search algorithms and applications

DOI10.1016/j.cor.2022.105903OpenAlexW4281660288MaRDI QIDQ2676311

Setyo Tri Windras Mara, Achmad Pratama Rifai, Rachmadi Norcahyo, Luluk Lusiantoro, Panca Jodiawan

Publication date: 27 September 2022

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

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

zbMATH Keywords

surveyoptimizationmetaheuristiccombinatorialadaptive large neighborhood search

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items

Metaheuristics for bilevel optimization: a comprehensive review ⋮ Novel model and solution method for flexible job shop scheduling problem with batch processing machines ⋮ Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows ⋮ Integrating micro-depot freight transport in existing public transport services

Uses Software

• Paramils
• irace
• GTSP-LIB

Cites Work

• Optimization by Simulated Annealing
• Decomposition based hybrid metaheuristics
• Routing a mixed fleet of electric and conventional vehicles
• The fleet size and mix location-routing problem with time windows: formulations and a heuristic algorithm
• Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests
• An iterative two-phase hybrid matheuristic for a multi-product short sea inventory-routing problem
• The electric fleet size and mix vehicle routing problem with time windows and recharging stations
• An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization
• The synchronized arc and node routing problem: application to road marking
• The multi-district team orienteering problem
• A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction
• Battery swap station location-routing problem with capacitated electric vehicles
• Dynamic design of sales territories
• A hybrid method for the probabilistic maximal covering location-allocation problem
• A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading
• Lower and upper bounds for the two-echelon capacitated location-routing problem
• An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
• An adaptive large neighborhood search heuristic for the share-a-ride problem
• An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines
• An adaptive large neighborhood search heuristic for the electric vehicle scheduling problem
• Location arc routing problem with inventory constraints
• A parallel matheuristic for the technician routing and scheduling problem
• Optimizing yard assignment in an automotive transshipment terminal
• A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times
• A survey of very large-scale neighborhood search techniques
• Scheduling technicians and tasks in a telecommunications company
• A unified heuristic for a large class of vehicle routing problems with backhauls
• Simultaneous product and service delivery vehicle routing problem with time windows and order release dates
• A general heuristic for vehicle routing problems
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• New optimization heuristics. The great deluge algorithm and the record- to-record travel
• Pareto optimality in multiobjective problems
• An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and synchronized visits
• An adaptive large neighborhood search for relocating vehicles in electric carsharing services
• Tramp ship routing and scheduling with voyage separation requirements
• An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization
• Large neighborhood search with constraint programming for a vehicle routing problem with synchronization constraints
• Vehicle routing with cross-dock selection
• An adaptive large neighborhood search metaheuristic for agile satellite scheduling with time-dependent transition time
• 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
• Failure-specific cooperative recourse strategy for simultaneous pickup and delivery problem with stochastic demands
• Fuzzy optimization: milestones and perspectives
• Designing sustainable mid-haul logistics networks with intra-route multi-resource facilities
• A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem
• Utilizing individual picker skills to improve order batching in a warehouse
• Multigraph modeling and adaptive large neighborhood search for the vehicle routing problem with time windows
• Exact and heuristic methods for optimizing lock-quay system in inland waterway
• Electric vehicle routing problem with time-dependent waiting times at recharging stations
• A two-echelon inventory routing problem for perishable products
• The multi-pickup and delivery problem with time windows
• Adaptive large neighborhood search heuristics for multi-tier service deployment problems in clouds
• A metaheuristic for the time-dependent pollution-routing problem
• A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment
• The inventory-routing problem with transshipment
• Hybrid adaptive large neighborhood search for the optimal statistic median problem
• An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
• Synchronized arc routing for snow plowing operations
• A matheuristic method for the electric vehicle routing problem with time windows and fast chargers
• Adaptive large neighborhood search algorithm for route planning of freight buses with pickup and delivery
• The two-echelon capacitated electric vehicle routing problem with battery swapping stations: formulation and efficient methodology
• Multi-depot two-echelon fuel minimizing routing problem with heterogeneous fleets: model and heuristic
• Prioritized single nurse routing and scheduling for home healthcare services
• Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem
• Forecasting and planning during a pandemic: COVID-19 growth rates, supply chain disruptions, and governmental decisions
• Multi-trip time-dependent vehicle routing problem with time windows
• Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search
• An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and delivery robots
• An adaptive large neighborhood search heuristic for the pollution-routing problem
• The bi-objective pollution-routing problem
• A multi-compartment vehicle routing problem in cold-chain distribution
• An adaptive large neighborhood search approach for multiple traveling repairman problem with profits
• The clustered team orienteering problem
• A survey of hybrid metaheuristics for the resource-constrained project scheduling problem
• The vehicle routing problem with simultaneous pickup and delivery and handling costs
• Solving the vehicle routing problem with multi-compartment vehicles for city logistics
• Decomposition methods for the lot-sizing and cutting-stock problems in paper industries
• Survey on blood supply chain management: models and methods
• Adaptive large neighborhood search for the commodity constrained split delivery VRP
• Waste collection inventory routing with non-stationary stochastic demands
• A survey on matheuristics for routing problems
• Vehicle routing with soft time windows and stochastic travel times: a column generation and branch-and-price solution approach
• A hybrid adaptive large neighborhood heuristic for a real-life dial-a-ride problem
• A heuristic approach for a real-world electric vehicle routing problem
• A hybrid adaptive large neighborhood search heuristic for the team orienteering problem
• A new constraint programming model and a linear programming-based adaptive large neighborhood search for the vehicle routing problem with synchronization constraints
• A simulation-based heuristic for the electric vehicle routing problem with time windows and stochastic waiting times at recharging stations
• A stochastic inventory routing problem for infectious medical waste collection
• Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
• Introduction to Stochastic Programming
• ParamILS: An Automatic Algorithm Configuration Framework
• Fuzzy green vehicle routing problem with simultaneous pickup – delivery and time windows
• A selective adaptive large neighborhood search heuristic for the profitable tour problem with simultaneous pickup and delivery services
• Multi-trip vehicle routing problem with order release time
• Metaheuristics—the metaphor exposed
• Evaluating the importance of randomization in adaptive large neighborhood search
• Handbook of metaheuristics
• The electric vehicle routing problem with shared charging stations
• Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location
• The Vehicle Routing Problem with Stochastic Demands and Split Deliveries