Pages that link to "Item:Q2433383"

The following pages link to A dial-a-ride problem for client transportation in a health-care organization (Q2433383):

Displaying 19 items.

• The dial-A-ride problem with transfers (Q336745) (← links)
• An adaptive large neighborhood search for an E-grocery delivery routing problem (Q342326) (← links)
• Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints (Q443822) (← links)
• An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows (Q617511) (← links)
• An optimization model and a solution algorithm for the many-to-many car pooling problem (Q763101) (← links)
• Typology and literature review for dial-a-ride problems (Q1698288) (← links)
• Minimizing the maximal ergonomic burden in intra-hospital patient transportation (Q1734337) (← links)
• Benchmarking online dispatch algorithms for emergency medical services (Q1751696) (← links)
• Event-based MILP models for ridepooling applications (Q2140290) (← links)
• Dynamic transportation of patients in hospitals (Q2267375) (← links)
• A tabu search heuristic for the dynamic transportation of patients between care units (Q2275836) (← links)
• The dial-a-ride problem: Models and algorithms (Q2480256) (← links)
• A new VRPPD model and a hybrid heuristic solution approach for e-tailing (Q2514740) (← links)
• Vehicle routing problems with alternative paths: an application to on-demand transportation (Q2654320) (← links)
• A HYBRID GREEDY RANDOMIZED ADAPTIVE SEARCH HEURISTIC TO SOLVE THE DIAL-A-RIDE PROBLEM (Q4921475) (← links)
• Étude comparative de divers modèles pour le problème de transport à la demande (Q6102816) (← links)
• A demand‐responsive feeder service with a maximum headway at mandatory stops (Q6180044) (← links)
• An enhanced semi-flexible transit service with introducing meeting points (Q6195264) (← links)
• MILP models of a patient transportation problem (Q6661215) (← links)