Dergi makalesi Açık Erişim
Dogan, Ilgin; Lokman, Banu; Koksalan, Murat
A B S T R A C T In this paper, we consider generating a representative subset of nondominated points at a prespecified precision in multi-objective mixed-integer programs (MOMIPs). The number of nondominated points grows exponentially with problem size and finding all nondominated points is typically hard in MOMIPs. Representing the nondominated set with a small subset of nondominated points is important for a decision maker to get an understanding of the layout of solutions. The shape and density of the nondominated points over the objective space may be critical in obtaining a set of solutions that represent the nondominated set well. We develop an exact algorithm that generates a representative set guaranteeing a prespecified precision. Our experiments on a variety of problems demonstrate that our algorithm outperforms existing approaches in terms of both the cardinality of the representative set and computation times. (c) 2021 Elsevier B.V. All rights reserved.
| Dosya adı | Boyutu | |
|---|---|---|
|
bib-236acb8c-bdb0-4a56-a51b-1c4585e7adae.txt
md5:0b4c6bcf8d0a8228ddc3de4830642b89 |
180 Bytes | İndir |
| Görüntülenme | 29 |
| İndirme | 9 |
| Veri hacmi | 1.6 kB |
| Tekil görüntülenme | 29 |
| Tekil indirme | 9 |