Pages that link to "Item:Q5963101"
From MaRDI portal
The following pages link to Dynamic programming based metaheuristics for the dial-a-ride problem (Q5963101):
Displaying 15 items.
- Tabu search for the real-world carpooling problem (Q306096) (← links)
- Daily aircraft routing for amphibious ready groups (Q1639311) (← links)
- Online spatio-temporal matching in stochastic and dynamic domains (Q1648078) (← links)
- Typology and literature review for dial-a-ride problems (Q1698288) (← links)
- Critical objective function values in linear sum assignment problems (Q1743488) (← links)
- Benchmarking online dispatch algorithms for emergency medical services (Q1751696) (← links)
- Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization (Q1991103) (← links)
- Ballast water dynamic allocation optimization model and analysis for safe and reliable operation of floating cranes (Q2115813) (← links)
- An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization (Q2125364) (← links)
- Comparison of anticipatory algorithms for a dial-a-ride problem (Q2140208) (← links)
- A vector evaluated evolutionary algorithm with exploitation reinforcement for the dynamic pollution routing problem (Q2165264) (← links)
- A fuzzy programming method for modeling demand uncertainty in the capacitated road-rail multimodal routing problem with time windows (Q2334965) (← links)
- Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem (Q2676342) (← links)
- A new approximate dynamic programming algorithm based on an actor–critic framework for optimal control of alkali–surfactant–polymer flooding (Q5059277) (← links)
- A simheuristic algorithm for time-dependent waste collection management with stochastic travel times (Q5158698) (← links)