Pages that link to "Item:Q336743"
From MaRDI portal
The following pages link to GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem (Q336743):
Displaying 8 items.
- Metaheuristics for the distance constrained generalized covering traveling salesman problem (Q832809) (← links)
- A fast two-level variable neighborhood search for the clustered vehicle routing problem (Q1652293) (← links)
- GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem (Q1652391) (← links)
- Metaheuristics for the tabu clustered traveling salesman problem (Q1652436) (← links)
- A multifactorial optimization paradigm for linkage tree genetic algorithm (Q2053810) (← links)
- Evolutionary algorithm and multifactorial evolutionary algorithm on clustered shortest-path tree problem (Q2123564) (← links)
- Solving the clustered traveling salesman problem with ‐relaxed priority rule (Q6070874) (← links)
- New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem (Q6114932) (← links)
