A general deep reinforcement learning hyperheuristic framework for solving combinatorial optimization problems
From MaRDI portal
Publication:6112785
DOI10.1016/j.ejor.2023.01.017MaRDI QIDQ6112785
Ahmad Hemmati, Jakob Kallestad, Kenneth Sörensen, Ramin Hasibi
Publication date: 10 July 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- 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
- Simulated annealing for complex portfolio selection problems.
- Adaptive large neighborhood search heuristics for multi-tier service deployment problems in clouds
- 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
- Industrial and tramp ship routing problems: closing the gap for real-scale instances
- Adaptive large neighborhood search for vehicle routing problems with transshipment facilities arising in city logistics
- Evaluating the importance of randomization in adaptive large neighborhood search
- Benchmark Suite for Industrial and Tramp Ship Routing and Scheduling Problems
This page was built for publication: A general deep reinforcement learning hyperheuristic framework for solving combinatorial optimization problems
