Pareto Simulated Annealing for Fuzzy Multi-Objective Combinatorial Optimization.
Maciej HapkeAndrzej JaszkiewiczRoman SlowinskiPublished in: J. Heuristics (2000)
Keyphrases
- combinatorial optimization
- multi objective
- simulated annealing
- evolutionary algorithm
- genetic algorithm
- multi objective optimization
- metaheuristic
- pareto dominance
- tabu search
- combinatorial optimization problems
- optimization algorithm
- traveling salesman problem
- multiobjective optimization
- multi criteria
- evolutionary computation
- benchmark problems
- multiple objectives
- fuzzy sets
- solution quality
- fuzzy logic
- optimization problems
- branch and bound
- differential evolution
- genetic algorithm ga
- optimization method
- branch and bound algorithm
- multi objective optimization problems
- particle swarm optimization
- pareto optimal
- mathematical programming
- combinatorial problems
- particle swarm optimization pso
- quadratic assignment problem
- nsga ii
- hill climbing
- genetic programming
- objective function
- vehicle routing problem
- conflicting objectives
- global minimum
- path relinking
- hard combinatorial optimization problems
- job shop scheduling problem
- fitness function
- combinatorial search
- multi objective evolutionary algorithms
- exact algorithms
- optimum design
- search procedure
- single machine scheduling problem
- neural network
- max min
- pareto optimal solutions
- fuzzy rules
- bi objective
- image segmentation