An urban transportation problem solved by parallel programming with hyper-heuristics
From MaRDI portal
Recommendations
- Solving urban transit route design problem using selection hyper-heuristics
- Parallel Processing and Applied Mathematics
- Differential evolution with improved sub-route reversal repair mechanism for multiobjective urban transit routing problem
- A cooperative parallel metaheuristic for the capacitated vehicle routing problem
- Parallel solution methods for vehicle routing problems
Cites work
- A column generation based hyper-heuristic to the bus driver scheduling problem
- A review of hyper-heuristics for educational timetabling
- A survey of the standard location-routing problem
- A taxonomical analysis, current methods and objectives on location-routing problems
- A two-phase tabu search approach to the location routing problem
- Asynchronous teams: cooperation schemes for autonomous agents
- Hyper-heuristic approaches for the response time variability problem
- Optimization by simulated annealing
- Parallel Metaheuristics
- The complexity of theorem-proving procedures
Cited in
(4)- Solving urban transit route design problem using selection hyper-heuristics
- Location‐routing problem: a classification of recent research
- Hyper-heuristic for integrated due-window scheduling and vehicle routing problem for perishable products considering production quality
- Operational aircraft maintenance routing problem incorporating cruise speed control
This page was built for publication: An urban transportation problem solved by parallel programming with hyper-heuristics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5059258)
