Hybrid metaheuristics for multi-objective combinatorial optimization
Studies in Computational Intelligence, ISSN: 1860-949X, Vol: 114, Page: 221-259
2008
- 52Citations
- 64Captures
Metric Options: CountsSelecting the 1-year or 3-year option will change the metrics count to percentiles, illustrating how an article or review compares to other articles or reviews within the selected time period in the same journal. Selecting the 1-year option compares the metrics against other articles/reviews that were also published in the same calendar year. Selecting the 3-year option compares the metrics against other articles/reviews that were also published in the same calendar year plus the two years prior.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Book Chapter Description
Many real-world optimization problems can be modelled as combinatorial optimization problems. Often, these problems are characterized by their large size and the presence of multiple, conflicting objectives. Despite progress in solving multi-objective combinatorial optimization problems exactly, the large size often means that heuristics are required for their solution in acceptable time. Since the middle of the nineties the trend is towards heuristics that "pick and choose" elements from several of the established metaheuristic schemes. Such hybrid approximation techniques may even combine exact and heuristic approaches. In this chapter we give an overview over approximation methods in multi-objective combinatorial optimization. We briefly summarize "classical" metaheuristics and focus on recent approaches, where metaheuristics are hybridized and/or combined with exact methods. © 2008 Springer-Verlag Berlin Heidelberg.
Bibliographic Details
http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=46949100589&origin=inward; http://dx.doi.org/10.1007/978-3-540-78295-7_8; http://link.springer.com/10.1007/978-3-540-78295-7_8; https://dx.doi.org/10.1007/978-3-540-78295-7_8; https://link.springer.com/chapter/10.1007/978-3-540-78295-7_8; http://www.springerlink.com/index/10.1007/978-3-540-78295-7_8; http://www.springerlink.com/index/pdf/10.1007/978-3-540-78295-7_8
Springer Science and Business Media LLC
Provide Feedback
Have ideas for a new metric? Would you like to see something else here?Let us know