Pages that link to "Item:Q2583172"
From MaRDI portal
The following pages link to A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem (Q2583172):
Displaying 12 items.
- A hybrid ACO-GRASP algorithm for clustering analysis (Q646719) (← links)
- Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP (Q841596) (← links)
- Path planning on a cuboid using genetic algorithms (Q942312) (← links)
- A hybrid stochastic genetic-GRASP algorithm for clustering analysis (Q949381) (← links)
- Optimization of nearest neighbor classifiers via metaheuristic algorithms for credit risk assessment (Q960116) (← links)
- Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem (Q1044139) (← links)
- A cumulative unmanned aerial vehicle routing problem approach for humanitarian coverage path planning (Q2116920) (← links)
- Bilayer local search enhanced particle swarm optimization for the capacitated vehicle routing problem (Q2331412) (← links)
- A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm (Q2465483) (← links)
- A particle swarm optimization algorithm with path relinking for the location routing problem (Q2481605) (← links)
- Expanding neighborhood GRASP for the traveling salesman problem (Q2490365) (← links)
- A hybrid genetic algorithm, list-based simulated annealing algorithm, and different heuristic algorithms for the travelling salesman problem (Q6094389) (← links)
