Name
Abstract | ||
|---|---|---|
The paper presents a metaheuristic method for solving fuzzy multi-objective combinatorial optimization problems. It extends the Pareto simulated annealing (PSA) method proposed originally for the crisp multi-objective combinatorial (MOCO) problems and is called fuzzy Pareto simulated annealing (FPSA). The method does not transform the original fuzzy MOCO problem to an auxiliary deterministic problem but works in the original fuzzy objective space. Its goal is to find a set of approximately efficient solutions being a good approximation of the whole set of efficient solutions defined in the fuzzy objective space. The extension of PSA to FPSA requires the definition of the dominance in the fuzzy objective space, modification of rules for calculating probability of accepting a new solution and application of a defuzzification operator for updating the average position of a solution in the objective space. The use of the FPSA method is illustrated by its application to an agricultural multi-objective project scheduling problem. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1023/A:1009678314795 | J. Heuristics |
Keywords | Field | DocType |
fuzzy multi-objective combinatorial optimization,metaheuristics in fuzzy objective space,simulated annealing,fuzzy multi-objective project scheduling | Simulated annealing,Mathematical optimization,Defuzzification,Fuzzy set operations,Fuzzy logic,Fuzzy transportation,Combinatorial optimization,Artificial intelligence,Optimization problem,Mathematics,Machine learning,Metaheuristic | Journal |
Volume | Issue | ISSN |
6 | 3 | 1572-9397 |
Citations | PageRank | References |
13 | 1.32 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Maciej Hapke | 1 | 61 | 6.51 |
| A. Jaszkiewicz | 2 | 660 | 50.68 |
| Roman Slowinski | 3 | 5561 | 516.06 |