The following pages link to Guided Local Search (Q4452896):
Displaying 19 items.
- Algorithms for nesting with defects (Q406491) (← links)
- Local search for the undirected capacitated arc routing problem with profits (Q531469) (← links)
- Looking ahead with the pilot method (Q816423) (← links)
- Classification of applied methods of combinatorial optimization (Q844352) (← 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)
- Fast local search and guided local search and their application to British Telecom's workforce scheduling problem (Q1362516) (← links)
- Optimisation of transportation service network using \(\kappa\)-node large neighbourhood search (Q1652466) (← links)
- Knowledge-guided local search for the vehicle routing problem (Q1722960) (← links)
- What makes a VRP solution good? The generation of problem-specific knowledge for heuristics (Q1734855) (← links)
- Efficiently solving very large-scale routing problems (Q1738815) (← links)
- Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art (Q2242290) (← links)
- A neutrality-based iterated local search for shift scheduling optimization and interactive reoptimization (Q2312327) (← links)
- Towards a practical engineering tool for rostering (Q2468743) (← links)
- Using multi-objective evolutionary algorithms for single-objective constrained and unconstrained optimization (Q2630818) (← links)
- A progressive filtering heuristic for the location-routing problem and variants (Q2668599) (← links)
- VERY STRONGLY CONSTRAINED PROBLEMS: AN ANT COLONY OPTIMIZATION APPROACH (Q3393492) (← links)
- A vertex weighting-based double-tabu search algorithm for the classical \(p\)-center problem (Q6068702) (← links)
- From fitness landscapes evolution to automatic local search algorithm generation (Q6082174) (← links)
