Pages that link to "Item:Q1905085"
From MaRDI portal
The following pages link to A heuristic and lower bound for a multi-depot routing problem (Q1905085):
Displaying 6 items.
- Vehicle dispatching for minimizing arrival conflicts in multi-supplier logistics network (Q1640629) (← links)
- A framing link based tabu search algorithm for large-scale multidepot vehicle routing problems (Q1717769) (← links)
- High-level relay hybrid metaheuristic method for multi-depot vehicle routing problem with time windows (Q1951171) (← links)
- A POPMUSIC approach for the multi-depot cumulative capacitated vehicle routing problem (Q2174909) (← links)
- A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem (Q2630221) (← links)
- Ant colony algorithm for the multi-depot vehicle routing problem in large quantities by a heterogeneous fleet of vehicles (Q6160382) (← links)
