Pages that link to "Item:Q4656743"
From MaRDI portal
The following pages link to New heuristics for the Fleet Size and Mix Vehicle Routing Problem with Time Windows (Q4656743):
Displayed 12 items.
- A flexible adaptive memory-based algorithm for real-life transportation operations: two case studies from dairy and construction sector (Q863996) (← links)
- Scatter search for the fleet size and mix vehicle routing problem with time windows (Q940820) (← links)
- A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows (Q953316) (← links)
- Industrial aspects and literature survey: fleet composition and routing (Q991360) (← links)
- A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem (Q1014948) (← links)
- Theoretical and algorithmic results for a class of hierarchical fleet mix problems (Q1042052) (← links)
- Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil (Q1042225) (← links)
- Routing relatively few customers per route (Q1876468) (← links)
- A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem (Q2378413) (← links)
- A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows (Q2506187) (← links)
- Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs (Q3057117) (← links)
- Routing a Heterogeneous Fleet of Vehicles (Q3564347) (← links)