Pages that link to "Item:Q1432014"
From MaRDI portal
The following pages link to The dial-a-ride problem (DARP): variants, modeling issues and algorithms (Q1432014):
Displaying 15 items.
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem (Q3392004) (← links)
- A Two-stage Model for a Day-ahead Paratransit Planning Problem (Q3439463) (← links)
- Health Care Logistics, Emergency Preparedness, and Disaster Relief: New Challenges for Routing Problems with a Focus on the Austrian Situation (Q3564375) (← links)
- The school bus routing and scheduling problem with transfers (Q4642460) (← links)
- A HYBRID GREEDY RANDOMIZED ADAPTIVE SEARCH HEURISTIC TO SOLVE THE DIAL-A-RIDE PROBLEM (Q4921475) (← links)
- (Q4944966) (← links)
- New Notation and Classification Scheme for Vehicle Routing Problems (Q5247680) (← links)
- Solution of the Dial-a-Ride Problem with multi-dimensional capacity constraints (Q5449876) (← links)
- A scheme for determining vehicle routes based on Arc-based service network design (Q5881488) (← links)
- Impact of soft ride time constraints on the complexity of scheduling in dial-a-ride problems (Q6040633) (← links)
- The static on‐demand bus routing problem: large neighborhood search for a dial‐a‐ride problem with bus station assignment (Q6071075) (← links)
- Complexity, algorithmic, and computational aspects of a dial-a-ride type problem (Q6113356) (← links)
- Revised eight-step feasibility checking procedure with linear time complexity for the dial-a-ride problem (DARP) (Q6551139) (← links)
- Accelerating value function approximations for dynamic dial-a-ride problems via dimensionality reductions (Q6568451) (← links)
- On the shared transportation problem: computational hardness and exact approach (Q6610092) (← links)
