@Inbook{Deb2003, author="Deb, Kalyanmoy", editor="Ghosh, Ashish and Tsutsui, Shigeyoshi", title="Multi-objective Evolutionary Algorithms: Introducing Bias Among Pareto-optimal Solutions", bookTitle="Advances in Evolutionary Computing: Theory and Applications", year="2003", publisher="Springer Berlin Heidelberg", address="Berlin, Heidelberg", pages="263--292", abstract="Since the beginning of the 1990s, research and application of multiobjective evolutionary algorithms (MOEAs) have attracted increasing attention. This is mainly due to the ability of evolutionary algorithms to find multiple Paretooptimal solutions in one single simulation run. In this chapter, we present an overview of MOEAs and then discuss a particular algorithm in detail. Although MOEAs can find multiple Pareto-optimal solutions, often, users need to impose a particular order of priority to objectives. In this chapter, we present a few classical techniques to identify a preferred or a compromise solution, and finally suggest a biased sharing technique which can be used during the optimization phase to find a biased distribution of Pareto-optimal solutions in the region of interest. The results are encouraging and suggest further application of the proposed strategy to more complex multi-objective optimization problems.", isbn="978-3-642-18965-4", doi="10.1007/978-3-642-18965-4_10", url="https://doi.org/10.1007/978-3-642-18965-4_10" }