Pages that link to "Item:Q2027083"
From MaRDI portal
The following pages link to A hybrid algorithm for time-dependent vehicle routing problem with time windows (Q2027083):
Displaying 13 items.
- Optimizing departure times in vehicle routes (Q541710) (← links)
- An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows (Q622144) (← links)
- An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen (Q1652283) (← links)
- An improved LNS algorithm for real-time vehicle routing problem with time windows (Q1761960) (← links)
- The vehicle routing problem with load-dependent travel times for cargo bicycles (Q2116921) (← links)
- An efficient optimisation procedure for the workforce scheduling and routing problem: Lagrangian relaxation and iterated local search (Q2147119) (← links)
- Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem (Q2676342) (← links)
- (Q3513916) (← links)
- Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows (Q6113315) (← links)
- QMOEA: a Q-learning-based multiobjective evolutionary algorithm for solving time-dependent green vehicle routing problems with time windows (Q6195430) (← links)
- Nested column generation for split pickup vehicle routing problem with time windows and time-dependent demand (Q6551134) (← links)
- An adaptive variable neighbourhood search approach for the dynamic vehicle routing problem (Q6551141) (← links)
- Vehicle routing with time-dependent travel times: theory, practice, and benchmarks (Q6602334) (← links)
