Pages that link to "Item:Q443822"
From MaRDI portal
The following pages link to Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints (Q443822):
Displaying 15 items.
- Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem (Q296680) (← links)
- Rich vehicle routing problems: from a taxonomy to a definition (Q299767) (← links)
- Ambulance routing for disaster response with patient groups (Q337463) (← links)
- Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports (Q547122) (← 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)
- Making the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problem (Q1751783) (← links)
- The prisoner transportation problem (Q2178139) (← links)
- A matheuristic for the truck and trailer routing problem (Q2355939) (← links)
- A survey on matheuristics for routing problems (Q2513752) (← links)
- Interrelated trips in the rural dial-a-ride problem with autonomous vehicles (Q2673572) (← links)
- A branch-and-price algorithm for a routing problem with inbound and outbound requests (Q2676292) (← links)
- A HYBRID GREEDY RANDOMIZED ADAPTIVE SEARCH HEURISTIC TO SOLVE THE DIAL-A-RIDE PROBLEM (Q4921475) (← links)
- The pickup and delivery problem with time windows and scheduled lines (Q5879649) (← links)
- Efficient GRASP solution approach for the prisoner transportation problem (Q6164367) (← links)
