Pages that link to "Item:Q2644373"
From MaRDI portal
The following pages link to An effective and fast heuristic for the dial-a-ride problem (Q2644373):
Displayed 9 items.
- An optimization model and a solution algorithm for the many-to-many car pooling problem (Q763101) (← links)
- Solving a selective dial-a-ride problem with logic-based Benders decomposition (Q1652651) (← links)
- Dynamic transportation of patients in hospitals (Q2267375) (← links)
- Adaptive memory artificial bee colony algorithm for Green vehicle routing with cross-docking (Q2293789) (← links)
- The dial-a-ride problem: Models and algorithms (Q2480256) (← links)
- Approximation algorithms for multi-vehicle stacker crane problems (Q2687683) (← links)
- Approximation algorithms for some min-max and minimum stacker crane cover problems (Q5918581) (← links)
- Approximation algorithms for some min-max and minimum stacker crane cover problems (Q5918727) (← links)
- Étude comparative de divers modèles pour le problème de transport à la demande (Q6102816) (← links)