An exact epsilon-constraint method for bi-objective combinatorial optimization problems: Application to the Traveling Salesman Problem with Profits.
Jean-François BérubéMichel GendreauJean-Yves PotvinPublished in: Eur. J. Oper. Res. (2009)
Keyphrases
- traveling salesman problem
- combinatorial optimization problems
- combinatorial optimization
- ant colony optimization
- optimization problems
- continuous optimization problems
- metaheuristic
- search methods
- aco algorithm
- shortest path problem
- vehicle routing problem
- knapsack problem
- optimization algorithm
- cost function
- energy minimization
- objective function
- computational efficiency
- bi objective
- traveling salesman
- search space