Tabu Search
Bi-Criterion Optimization with Multi Colony Ant Algorithms
EMO '01 Proceedings of the First International Conference on Evolutionary Multi-Criterion Optimization
The Supported Solutions Used as a Genetic Information in a Population Heuristics
EMO '01 Proceedings of the First International Conference on Evolutionary Multi-Criterion Optimization
MOPSO: a proposal for multiple objective particle swarm optimization
CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
A population and interval constraint propagation algorithm
EMO'03 Proceedings of the 2nd international conference on Evolutionary multi-criterion optimization
Multiobjective capacitated arc routing problem
EMO'03 Proceedings of the 2nd international conference on Evolutionary multi-criterion optimization
Computers and Operations Research
EMO '09 Proceedings of the 5th International Conference on Evolutionary Multi-Criterion Optimization
Decomposition, reformulation, and diving in university course timetabling
Computers and Operations Research
A multiobjective metaheuristic for a mean-risk multistage capacity investment problem
Journal of Heuristics
A spreadsheet-like user interface for combinatorial multi-objective optimization
CASCON '09 Proceedings of the 2009 Conference of the Center for Advanced Studies on Collaborative Research
A multi-objective genetic algorithm with path relinking for the p-median problem
IBERAMIA'10 Proceedings of the 12th Ibero-American conference on Advances in artificial intelligence
A bi-objective iterated local search heuristic with path-relinking for the p-median problem
EMO'11 Proceedings of the 6th international conference on Evolutionary multi-criterion optimization
Electronic Notes in Theoretical Computer Science (ENTCS)
Multiobjective Evolutionary Algorithms for Portfolio Management: A comprehensive literature review
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
After 20 years of development of multiobjective metaheuristics the procedures for solving multiple objective combinatorial optimization problems are generally the result of a blend of evolutionary, neighborhood search, and problem dependent components. Indeed, even though the first procedures were direct adaptations of single objective metaheuristics inspired by evolutionary algorithms or neighborhood search algorithms, hybrid procedures have been introduced very quickly. This paper discusses hybridations found in the literature and mentions recently introduced metaheuristic principles.