Approximating the Pareto Curve with Local Search for the Bicriteria TSP (1, 2) Problem.
Eric AngelEvripidis BampisLaurent GourvèsPublished in: FCT (2003)
Keyphrases
- bicriteria
- genetic algorithm
- optimal solution
- efficient solutions
- combinatorial optimization
- search space
- traveling salesman problem
- knapsack problem
- parametric curves
- integer linear programming
- multi objective
- flowshop
- shortest path problem
- aco algorithm
- combinatorial optimization problems
- ant colony optimization
- search algorithm
- tabu search
- simulated annealing
- metaheuristic
- multi objective optimization
- optimization problems
- search procedure
- fitness function
- branch and bound
- heuristic methods
- column generation
- scheduling problem
- lower bound
- response time
- constraint satisfaction problems
- manufacturing cell
- evolutionary algorithm