Pages that link to "Item:Q2668616"
From MaRDI portal
The following pages link to A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem (Q2668616):
Displaying 12 items.
- Hybrid column generation and large neighborhood search for the dial-a-ride problem (Q339608) (← links)
- Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints (Q443822) (← 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)
- A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem (Q2669775) (← links)
- A sample average approximation approach for the stochastic dial-a-ride problem on a multigraph with user satisfaction (Q2672126) (← links)
- The dial-a-ride problem with private fleet and common carrier (Q2676338) (← links)
- A heuristic two-phase solution approach for the multi-objective dial-a-ride problem (Q3057122) (← links)
- Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems (Q6090149) (← links)
- Efficient GRASP solution approach for the prisoner transportation problem (Q6164367) (← 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)