Deep reinforcement learning for solving the stochastic e-waste collection problem
From MaRDI portal
Cites work
- A deep reinforcement learning based hyper-heuristic for combinatorial optimisation with uncertainties
- A general deep reinforcement learning hyperheuristic framework for solving combinatorial optimization problems
- Automated Dynamic Algorithm Configuration
- DASH: dynamic approach for switching heuristics
- Evaluating the importance of randomization in adaptive large neighborhood search
- Handbook of metaheuristics
- scientific article; zbMATH DE number 1054674 (Why is no real title available?)
- Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- Opportunities for reinforcement learning in stochastic dynamic vehicle routing
- Q-learning based framework for solving the stochastic E-waste collection problem
- Recent advances in selection hyper-heuristics
- Solving large-scale dynamic vehicle routing problems with stochastic requests
- Stochastic dynamic vehicle routing in the light of prescriptive analytics: a review
- The first AI4TSP competition: learning to solve stochastic routing problems
- The fleet size and mix vehicle routing problem
- Time-dependent routing problems: a review
- Waste collection routing: a survey on problems and methods
This page was built for publication: Deep reinforcement learning for solving the stochastic e-waste collection problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891789)
