Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search
From MaRDI portal
Publication:2030591
DOI10.1016/j.ejor.2020.10.045zbMath1487.90652OpenAlexW2996281513MaRDI QIDQ2030591
Renata Turkeš, Kenneth Sörensen, Lars Magnus Hvattum
Publication date: 7 June 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://orbit.dtu.dk/en/publications/metaanalysis-of-metaheuristics-quantifying-the-effect-of-adaptiveness-in-adaptive-large-neighborhood-search(799a5843-cb7e-4fcc-8275-f8c6f483b87b).html
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (6)
The consistent electric-vehicle routing problem with backhauls and charging management ⋮ A survey of adaptive large neighborhood search algorithms and applications ⋮ A general deep reinforcement learning hyperheuristic framework for solving combinatorial optimization problems ⋮ Real-world vehicle routing using adaptive large neighborhood search ⋮ 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
Uses Software
Cites Work
- Unnamed Item
- An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem
- Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests
- An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization
- Large neighborhood search for multi-trip vehicle routing
- An adaptive large neighborhood search for a vehicle routing problem with multiple routes
- Hybrid column generation and large neighborhood search for the dial-a-ride 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 for an E-grocery delivery routing 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
- A general heuristic for vehicle routing problems
- Revisiting the self-adaptive large neighborhood search
- 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
- An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization
- An adaptive large neighborhood search for the discrete and continuous berth allocation problem
- Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows
- A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking
- An adaptive large neighborhood search metaheuristic for agile satellite scheduling with time-dependent transition time
- A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem
- Adaptive large neighborhood search on the graphics processing unit
- Multigraph modeling and adaptive large neighborhood search for the vehicle routing problem with time windows
- Adaptive large neighborhood search heuristics for multi-tier service deployment problems in clouds
- A GRASP with adaptive large neighborhood search for pickup and delivery problems 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
- An improved adaptive large neighborhood search algorithm for multiple agile satellites scheduling
- Record breaking optimization results using the ruin and recreate principle
- An adaptive large neighborhood search heuristic for the pollution-routing problem
- Adaptive large neighborhood search for the curriculum-based course timetabling problem
- A template-based adaptive large neighborhood search for the consistent vehicle routing problem
- STUDIES IN THE HISTORY OF PROBABILITY AND STATISTICS: VII. THE PRINCIPLE OF THE ARITHMETIC MEAN
- A selective adaptive large neighborhood search heuristic for the profitable tour problem with simultaneous pickup and delivery services
- Dynamic Adaptive Large Neighborhood Search for Inventory Routing Problem
- Evaluating the importance of randomization in adaptive large neighborhood search
This page was built for publication: Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search
