Pages that link to "Item:Q1687673"
From MaRDI portal
The following pages link to Variable neighborhood descent for solving the vehicle routing problem with time windows (Q1687673):
Displaying 10 items.
- A variable iterated greedy algorithm for the traveling salesman problem with time windows (Q506326) (← links)
- Multigraph modeling and adaptive large neighborhood search for the vehicle routing problem with time windows (Q1725604) (← links)
- Variable neighborhood search for vehicle routing problem with multiple time windows (Q1791961) (← 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)
- Local search and variable neighborhood: search algorithms for the vehicle routing problem with time windows (Q2741611) (← links)
- A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows (Q3057119) (← links)
- (Q4827942) (← links)
- Variable neighbourhood search for close–open vehicle routing problem with time windows (Q5382674) (← links)
- Two-phase algorithm for solving vehicle routing problem with time windows (Q6097182) (← links)