Approximating the Pareto curve with local search for the bicriteria TSP(1, 2) problem.
Eric AngelEvripidis BampisLaurent GourvèsPublished in: Theor. Comput. Sci. (2004)
Keyphrases
- bicriteria
- genetic algorithm
- optimal solution
- efficient solutions
- combinatorial optimization
- knapsack problem
- search space
- traveling salesman problem
- parametric curves
- integer linear programming
- multi objective
- tabu search
- ant colony optimization
- aco algorithm
- metaheuristic
- multi objective optimization
- shortest path problem
- search algorithm
- flowshop
- np hard
- optimization problems
- combinatorial optimization problems
- simulated annealing
- lower bound
- manufacturing cell
- branch and bound
- multiple objectives
- greedy algorithm
- heuristic methods
- differential evolution
- objective function
- genetic programming
- neural network
- branch and bound algorithm
- feasible solution
- single machine scheduling problem
- linear program
- completion times