Pages that link to "Item:Q2480256"
From MaRDI portal
The following pages link to The dial-a-ride problem: Models and algorithms (Q2480256):
Displaying 17 items.
- The static on‐demand bus routing problem: large neighborhood search for a dial‐a‐ride problem with bus station assignment (Q6071075) (← links)
- Graph representation of the fixed route dial-a-ride problem (Q6090221) (← links)
- Étude comparative de divers modèles pour le problème de transport à la demande (Q6102816) (← links)
- Complexity, algorithmic, and computational aspects of a dial-a-ride type problem (Q6113356) (← links)
- Efficient GRASP solution approach for the prisoner transportation problem (Q6164367) (← links)
- A deterministic annealing local search for the electric autonomous dial-a-ride problem (Q6167858) (← links)
- An improved algorithm for open online dial-a-ride (Q6176557) (← links)
- The cumulative school bus routing problem: Polynomial‐size formulations (Q6180039) (← links)
- Branch and price algorithm for route optimization on customized bus service (Q6546992) (← links)
- Revised eight-step feasibility checking procedure with linear time complexity for the dial-a-ride problem (DARP) (Q6551139) (← links)
- A ride time-oriented scheduling algorithm for dial-a-ride problems (Q6561235) (← links)
- Accelerating value function approximations for dynamic dial-a-ride problems via dimensionality reductions (Q6568451) (← links)
- A data-driven system for cooperative-bus route planning based on generative adversarial network and metric learning (Q6589085) (← links)
- Earliest deadline first is a 2-approximation for DARP with time windows (Q6606221) (← links)
- On the shared transportation problem: computational hardness and exact approach (Q6610092) (← links)
- The rich heterogeneous dial-a-ride problem with trip time prediction (Q6659104) (← links)
- Maximizing the number of rides served for time-limited Dial-a-Ride* (Q6661115) (← links)
