Pages that link to "Item:Q2503082"

The following pages link to A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints (Q2503082):

Displaying 14 items.

• 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)
• Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation (Q1652021) (← links)
• A hybrid genetic algorithm for the heterogeneous dial-a-ride problem (Q1652211) (← links)
• Typology and literature review for dial-a-ride problems (Q1698288) (← links)
• Column generation for vehicle routing problems with multiple synchronization constraints (Q1991183) (← links)
• A tabu search heuristic for the dynamic transportation of patients between care units (Q2275836) (← links)
• Optimal charging and repositioning of electric vehicles in a free-floating carsharing system (Q2333127) (← links)
• The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments (Q2455616) (← links)
• The dial-a-ride problem: Models and algorithms (Q2480256) (← links)
• Vehicle routing problems with alternative paths: an application to on-demand transportation (Q2654320) (← links)
• Performance evaluation of dynamic scheduling approaches in vehicle-based internal transport systems (Q3168926) (← links)
• Étude comparative de divers modèles pour le problème de transport à la demande (Q6102816) (← links)
• Planification des tournées dans le domaine de la messagerie rapide (Q6160412) (← links)