Pages that link to "Item:Q1791961"
From MaRDI portal
The following pages link to Variable neighborhood search for vehicle routing problem with multiple time windows (Q1791961):
Displaying 23 items.
- Scheduled penalty variable neighborhood search (Q337204) (← links)
- A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows (Q337225) (← links)
- Skewed general variable neighborhood search for the location routing scheduling problem (Q337608) (← links)
- A general VNS heuristic for the traveling salesman problem with time windows (Q429659) (← links)
- Variable neighborhood descent for solving the vehicle routing problem with time windows (Q1687673) (← links)
- Multigraph modeling and adaptive large neighborhood search for the vehicle routing problem with time windows (Q1725604) (← links)
- A route-neighborhood-based metaheuristic for vehicle routing problem with time windows (Q1806612) (← links)
- A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times (Q1935881) (← links)
- Variable neighborhood search for the travelling deliveryman problem (Q1942008) (← links)
- A column generation and a post optimization VNS heuristic for the vehicle routing problem with multiple time Windows (Q2070117) (← links)
- An adaptive large neighborhood search algorithm for vehicle routing problem with multiple time windows constraints (Q2083393) (← 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)
- Dynamic vehicle routing using an improved variable neighborhood search algorithm (Q2375629) (← links)
- A variable neighborhood search for the vehicle routing problem with time windows and preventive maintenance activities (Q2631272) (← links)
- A variable neighborhood search algorithm for the vehicle routing problem with multiple trips (Q2631286) (← links)
- A variable neighborhood search for solving the multi-vehicle covering tour problem (Q2631288) (← links)
- An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems (Q2668773) (← links)
- Local search and variable neighborhood: search algorithms for the vehicle routing problem with time windows (Q2741611) (← links)
- (Q4827942) (← links)
- Variable neighbourhood search for close–open vehicle routing problem with time windows (Q5382674) (← links)
- A stochastic approach for planning airport ground support resources (Q6060658) (← links)
- Solving a pickup and delivery routing problem for fourth‐party logistics providers (Q6195030) (← links)
- A variable neighborhood search for the green vehicle routing problem with two-dimensional loading constraints and split delivery (Q6565397) (← links)