Pages that link to "Item:Q2146986"
From MaRDI portal
The following pages link to Hybrid search with neighborhood reduction for the multiple traveling salesman problem (Q2146986):
Displaying 11 items.
- Seeking global edges for traveling salesman problem in multi-start search (Q652693) (← links)
- Competition-based neural network for the multiple travelling salesmen problem with minmax objective (Q1302604) (← links)
- A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods (Q1681325) (← links)
- An effective iterated two-stage heuristic algorithm for the multiple traveling salesmen problem (Q2147041) (← links)
- An effective hybrid search algorithm for the multiple traveling repairman problem with profits (Q2171586) (← links)
- Modeling and optimization of multiple traveling salesmen problems: an evolution strategy approach (Q2668611) (← links)
- A hybrid iterated local search heuristic for the traveling salesperson problem with hotel selection (Q2668646) (← links)
- A hybrid distribution algorithm based on membrane computing for solving the multiobjective multiple traveling salesman problem (Q2806147) (← links)
- A reinforced hybrid genetic algorithm for the traveling salesman problem (Q6106563) (← links)
- Memetic search for the minmax multiple traveling salesman problem with single and multiple depots (Q6167324) (← links)
- Hybridizing simulated annealing and genetic algorithms with Pythagorean fuzzy uncertainty for traveling salesman problem optimization (Q6578207) (← links)
