Pages that link to "Item:Q943841"
From MaRDI portal
The following pages link to An iterated local search algorithm for the vehicle routing problem with convex time penalty functions (Q943841):
Displaying 9 items.
- Branch-and-price and constraint programming for solving a real-life technician dispatching problem (Q296755) (← links)
- Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services (Q336790) (← links)
- A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows (Q339607) (← links)
- A powerful route minimization heuristic for the vehicle routing problem with time windows (Q1038101) (← links)
- A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows (Q1040973) (← links)
- A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem (Q1652289) (← links)
- The time-dependent capacitated profitable tour problem with time windows and precedence constraints (Q1681438) (← links)
- Designing granular solution methods for routing problems with time windows (Q1694925) (← links)
- Recent progress of local search in handling the time window constraints of the vehicle routing problem (Q5893964) (← links)
