Title
Generating equidistant representations in biobjective programming
Abstract
In recent years, emphasis has been placed on generating quality representations of the nondominated set of multiobjective optimization problems. This paper presents two methods for generating discrete representations with equidistant points for biobjective problems with solution sets determined by convex, polyhedral cones. The Constraint Controlled-Spacing method is based on the epsilon-constraint method with an additional constraint to control the spacing of generated points. The Bilevel Controlled-Spacing method has a bilevel structure with the lower-level generating the nondominated points and the upper-level controlling the spacing, and is extended to multiobjective problems. Both methods are proven to produce (weakly) nondominated points and are demonstrated on a variety of test problems.
Year
DOI
Venue
2012
10.1007/s10589-011-9403-5
Comp. Opt. and Appl.
Keywords
Field
DocType
Biobjective programs,Discrete representations,Spacing,Coverage,Nondominated set,Efficient set,Convex cones
Equidistant,Mathematical optimization,Regular polygon,Solution set,Multiobjective optimization problem,Mathematics
Journal
Volume
Issue
ISSN
51
3
0926-6003
Citations 
PageRank 
References 
4
0.45
15
Authors
2
Name
Order
Citations
PageRank
Stacey L. Faulkenberg140.45
Margaret M. Wiecek221322.90