Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search
From MaRDI portal
(Redirected from Publication:2030591)
Recommendations
- A survey of adaptive large neighborhood search algorithms and applications
- Metaheuristics ``In the large
- scientific article; zbMATH DE number 1488085
- The influence of problem specific neighborhood structures in metaheuristics performance
- Revisiting the self-adaptive large neighborhood search
- ADCLUS and INDCLUS: analysis, experimentation, and meta-heuristic algorithm extensions
Cites work
- A general heuristic for vehicle routing problems
- A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment
- A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem
- A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking
- A selective adaptive large neighborhood search heuristic for the profitable tour problem with simultaneous pickup and delivery services
- A template-based adaptive large neighborhood search for the consistent vehicle routing problem
- Adaptive large neighborhood search for the curriculum-based course timetabling problem
- Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests
- Adaptive large neighborhood search heuristics for multi-tier service deployment problems in clouds
- Adaptive large neighborhood search on the graphics processing unit
- An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem
- An adaptive large neighborhood search for a vehicle routing problem with multiple routes
- An adaptive large neighborhood search for an E-grocery delivery routing problem
- An adaptive large neighborhood search for relocating vehicles in electric carsharing services
- An adaptive large neighborhood search for the discrete and continuous berth allocation problem
- An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization
- An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization
- An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
- An adaptive large neighborhood search heuristic for the electric vehicle scheduling 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 pollution-routing problem
- An adaptive large neighborhood search heuristic for the share-a-ride problem
- An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and synchronized visits
- An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
- An adaptive large neighborhood search metaheuristic for agile satellite scheduling with time-dependent transition time
- An improved adaptive large neighborhood search algorithm for multiple agile satellites scheduling
- Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows
- Dynamic Adaptive Large Neighborhood Search for Inventory Routing Problem
- Evaluating the importance of randomization in adaptive large neighborhood search
- scientific article; zbMATH DE number 2065615 (Why is no real title available?)
- Hybrid adaptive large neighborhood search for the optimal statistic median problem
- Hybrid column generation and large neighborhood search for the dial-a-ride problem
- Large neighborhood search for multi-trip vehicle routing
- Multigraph modeling and adaptive large neighborhood search for the vehicle routing problem with time windows
- Record breaking optimization results using the ruin and recreate principle
- Revisiting the self-adaptive large neighborhood search
- STUDIES IN THE HISTORY OF PROBABILITY AND STATISTICS: VII. THE PRINCIPLE OF THE ARITHMETIC MEAN
Cited in
(28)- Using group theory and transition matrices to study a class of metaheuristic neighborhoods
- Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem
- The vehicle routing problem with load-dependent travel times for cargo bicycles
- Across neighborhood search algorithm: a comprehensive analysis
- The consistent electric-vehicle routing problem with backhauls and charging management
- A survey of adaptive large neighborhood search algorithms and applications
- Evaluating the importance of randomization in adaptive large neighborhood search
- A general deep reinforcement learning hyperheuristic framework for solving combinatorial optimization problems
- Real-world vehicle routing using adaptive large neighborhood search
- Joint relocation and pricing in electric car-sharing systems
- Home chemotherapy delivery: an integrated production scheduling and multi-trip vehicle routing problem
- A practical and robust approach for solving the multi-compartment vehicle routing problem under demand uncertainty using machine learning
- A selection hyper-heuristic approach to the single airport slot allocation problem
- Reinforcement learning-guided adaptive large neighborhood search for vehicle routing problem with time windows
- Optimizing plastic product manufacturing scheduling: an integrated approach to minimize setup costs and tardiness with preventive maintenance considerations
- On the integration of reinforcement learning and simulated annealing for the parallel batch scheduling problem with setups
- A new adaptation mechanism of the ALNS algorithm using reinforcement learning
- Solution-based versus attribute-based tabu search for binary integer programming
- A causal framework for stochastic local search optimization algorithms
- A large neighborhood search-based approach to tackle the very large scale team orienteering problem in industrial context
- A deep reinforcement learning hyperheuristic for the covering tour problem with varying coverage
- A graph reinforcement learning framework for neural adaptive large neighbourhood search
- A review and ranking of operators in adaptive large neighborhood search for vehicle routing problems
- Fifty years of metaheuristics
- Assigning parcel destinations to drop-off points in a congested robotic sorting system
- Optimizing transport operations in a hybrid mobility system for rural-urban transport
- Integrated trucks assignment and scheduling problem with mixed service mode docks: a Q-learning based adaptive large neighborhood search algorithm
- Very large-scale neighborhood search for drone routing with energy replenishment
This page was built for publication: Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2030591)
