Pages that link to "Item:Q2178077"
From MaRDI portal
The following pages link to A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem (Q2178077):
Displaying 13 items.
- Mathematical formulations and improvements for the multi-depot open vehicle routing problem (Q1996758) (← links)
- Scheduling heterogeneous delivery tasks on a mixed logistics platform (Q2076846) (← links)
- Hybrid search with neighborhood reduction for the multiple traveling salesman problem (Q2146986) (← links)
- Vehicle routing for milk collection with gradual blending: a case arising in Chile (Q2160533) (← links)
- An adaptive tabu search algorithm embedded with iterated local search and route elimination for the bike repositioning and recycling problem (Q2664364) (← links)
- An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems (Q2668773) (← links)
- Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order (Q2669495) (← links)
- Crowdsourced humanitarian relief vehicle routing problem (Q2676364) (← links)
- A general VNS for the multi-depot open vehicle routing problem with time windows (Q6063504) (← links)
- Enhanced iterated local search for the technician routing and scheduling problem (Q6068708) (← links)
- Integrating micro-depot freight transport in existing public transport services (Q6168362) (← links)
- On the exact solution of the multi-depot open vehicle routing problem (Q6492461) (← links)
- Iterated local search with ejection chains for the space-free multi-row facility layout problem (Q6565430) (← links)
