Pages that link to "Item:Q2741611"
From MaRDI portal
The following pages link to Local search and variable neighborhood: search algorithms for the vehicle routing problem with time windows (Q2741611):
Displaying 14 items.
- A hybrid search method for the vehicle routing problem with time windows (Q613770) (← links)
- An iterated local search algorithm for the vehicle routing problem with convex time penalty functions (Q943841) (← links)
- A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows (Q953316) (← links)
- Algorithm for directing cooperative vehicles of a vehicle routing problem for improving fault-tolerance (Q1787317) (← links)
- Tabu search heuristics for the vehicle routing problem with time windows. (Q1871417) (← links)
- Routing relatively few customers per route (Q1876468) (← links)
- A multi-start local search algorithm for the vehicle routing problem with time windows (Q1887956) (← links)
- A variable neighborhood search-based algorithm with adaptive local search for the vehicle routing problem with time windows and multi-depots aiming for vehicle fleet reduction (Q2108102) (← links)
- A variable neighborhood search for the vehicle routing problem with time windows and preventive maintenance activities (Q2631272) (← links)
- Multiperiod Planning and Routing on a Rolling Horizon for Field Force Optimization Logistics (Q3564374) (← links)
- A memetic algorithm for the vehicle routing problem with time windows (Q3598046) (← links)
- (Q4827942) (← links)
- Variable neighbourhood search for close–open vehicle routing problem with time windows (Q5382674) (← links)
- Recent progress of local search in handling the time window constraints of the vehicle routing problem (Q5893964) (← links)
