Pages that link to "Item:Q613770"
From MaRDI portal
The following pages link to A hybrid search method for the vehicle routing problem with time windows (Q613770):
Displaying 12 items.
- Combining meta-heuristics to effectively solve the vehicle routing problems with time windows (Q704619) (← links)
- Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows (Q975995) (← links)
- An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen (Q1652283) (← links)
- Variable neighborhood descent for solving the vehicle routing problem with time windows (Q1687673) (← links)
- A time-based pheromone approach for the ant system (Q1758053) (← links)
- A branch-and-price algorithm for a vehicle routing problem with cross-docking (Q2840717) (← links)
- (Q3513916) (← links)
- A memetic algorithm for the vehicle routing problem with time windows (Q3598046) (← links)
- (Q4494449) (← links)
- Sequential Simulated Annealing for the Vehicle Routing Problem with Time Windows (Q4931920) (← links)
- (Q5310731) (← links)
- An improved transformer model with multi-head attention and attention to attention for low-carbon multi-depot vehicle routing problem (Q6589088) (← links)