Pages that link to "Item:Q975992"
From MaRDI portal
The following pages link to A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem (Q975992):
Displayed 15 items.
- Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem (Q439653) (← links)
- Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem (Q621685) (← links)
- Memetic algorithm based on improved inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem (Q660966) (← links)
- A two-level metaheuristic for the all colors shortest path problem (Q1616945) (← links)
- GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem (Q1652391) (← links)
- Approximation schemes for the generalized traveling salesman problem (Q1744982) (← links)
- The effect of the asymmetry of road transportation networks on the traveling salesman problem (Q1762144) (← links)
- A memetic algorithm approach for solving the multidimensional multi-way number partitioning problem (Q1792021) (← links)
- Design of experiment for tuning parameters of an ant colony optimization method for the constrained shortest Hamiltonian path problem in the grid networks (Q2061347) (← links)
- A transformation technique for the clustered generalized traveling salesman problem with applications to logistics (Q2183848) (← links)
- A Discrete State Transition Algorithm for Generalized Traveling Salesman Problem (Q2942467) (← links)
- Exact and heuristic algorithms for solving the generalized vehicle routing problem with flexible fleet size (Q4979994) (← links)
- A Memetic Random Key Algorithm for the Balanced Travelling Salesman Problem (Q5011675) (← links)
- New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem (Q6114932) (← links)
- Hybridizations of evolutionary algorithms with large neighborhood search (Q6158769) (← links)