Pages that link to "Item:Q3512379"

The following pages link to Solving the Dial-a-Ride problem using genetic algorithms (Q3512379):

Displaying 18 items.

• Local search heuristics for the probabilistic dial-a-ride problem (Q657055) (← links)
• An optimization model and a solution algorithm for the many-to-many car pooling problem (Q763101) (← links)
• The single vehicle pickup and delivery problem with time windows: Intelligent operators for heuristic and metaheuristic algorithms (Q972640) (← links)
• A two-stage model for a day-ahead paratransit planning problem (Q1014313) (← 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)
• An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization (Q2125364) (← links)
• Event-based MILP models for ridepooling applications (Q2140290) (← links)
• Dynamic transportation of patients in hospitals (Q2267375) (← links)
• Solving a dial-a-flight problem using composite variables (Q2307323) (← links)
• The paired many-to-many pickup and delivery problem: an application (Q2343076) (← 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)
• Variable neighborhood search for the dial-a-ride problem (Q2655965) (← links)
• Scheduling heterogeneous multi-load AGVs with battery constraints (Q2669605) (← links)
• A heuristic two-phase solution approach for the multi-objective dial-a-ride problem (Q3057122) (← links)
• Ride sharing with flexible participants: a metaheuristic approach for large‐scale problems (Q6070411) (← links)
• Étude comparative de divers modèles pour le problème de transport à la demande (Q6102816) (← links)