Pages that link to "Item:Q1634298"
From MaRDI portal
The following pages link to Solving urban transit route design problem using selection hyper-heuristics (Q1634298):
Displaying 16 items.
- A metaheuristic approach to the urban transit routing problem (Q972642) (← links)
- Differential evolution with improved sub-route reversal repair mechanism for multiobjective urban transit routing problem (Q1713245) (← links)
- The grid based approach, a fast local evaluation technique for line planning (Q2095522) (← links)
- A deep reinforcement learning based hyper-heuristic for combinatorial optimisation with uncertainties (Q2116843) (← links)
- Recent advances in selection hyper-heuristics (Q2183846) (← links)
- Metaheuristics ``In the large'' (Q2242238) (← links)
- Decomposition-based hyperheuristic approaches for the bi-objective cold chain considering environmental effects (Q2664375) (← links)
- A hyper-heuristic approach based upon a hidden Markov model for the multi-stage nurse rostering problem (Q2668655) (← links)
- BO-B\&B: a hybrid algorithm based on Bayesian optimization and branch-and-bound for discrete network design problems (Q2699090) (← links)
- An urban transportation problem solved by parallel programming with hyper-heuristics (Q5059258) (← links)
- Multi-armed bandit-based hyper-heuristics for combinatorial optimization problems (Q6069215) (← links)
- Exact and hyper‐heuristic solutions for the distribution‐installation problem from the VeRoLog 2019 challenge (Q6092665) (← links)
- A framework for the generation of complex scenario instances in the Urban Transit Routing Problem (Q6113062) (← links)
- Simulated-annealing-based hyper-heuristic for flexible job-shop scheduling (Q6191890) (← links)
- An improved solution methodology for the urban transit routing problem (Q6551086) (← links)
- Speeding up the passenger assignment problem in transit planning by the direct link network representation (Q6568464) (← links)
