An iterative vertex enumeration method for objective space based vector optimization algorithms

Simple item page
buir.contributor.authorKaya, İrfan Caner
buir.contributor.authorUlus, Firdevs
buir.contributor.orcidUlus, Firdevs|0000-0002-0532-9927
dc.citation.epage2485en_US
dc.citation.issueNumberSupplementen_US
dc.citation.spage2471en_US
dc.citation.volumeNumber55en_US
dc.contributor.authorKaya, İrfan Caner
dc.contributor.authorUlus, Firdevs
dc.date.accessioned2022-02-14T06:27:37Z
dc.date.available2022-02-14T06:27:37Z
dc.date.issued2021-03-02
dc.departmentDepartment of Industrial Engineeringen_US
dc.description.abstractAn application area of vertex enumeration problem (VEP) is the usage within objective space based linear/convex vector optimization algorithms whose aim is to generate (an approximation of) the Pareto frontier. In such algorithms, VEP, which is defined in the objective space, is solved in each iteration and it has a special structure. Namely, the recession cone of the polyhedron to be generated is the ordering cone. We consider and give a detailed description of a vertex enumeration procedure, which iterates by calling a modified “double description (DD) method” that works for such unbounded polyhedrons. We employ this procedure as a function of an existing objective space based vector optimization algorithm (Algorithm 1); and test the performance of it for randomly generated linear multiobjective optimization problems. We compare the efficiency of this procedure with another existing DD method as well as with the current vertex enumeration subroutine of Algorithm 1. We observe that the modified procedure excels the others especially as the dimension of the vertex enumeration problem (the number of objectives of the corresponding multiobjective problem) increases.en_US
dc.identifier.doi10.1051/ro/2020139en_US
dc.identifier.eissn1290-3868
dc.identifier.issn0399-0559
dc.identifier.urihttp://hdl.handle.net/11693/77305
dc.language.isoEnglishen_US
dc.publisherEDP Sciencesen_US
dc.relation.isversionofhttps://doi.org/10.1051/ro/2020139en_US
dc.source.titleRAIRO - Operations Researchen_US
dc.subjectVertex enumerationen_US
dc.subjectMultiobjective optimizationen_US
dc.subjectVector optimizationen_US
dc.subjectPolyhedral approximationen_US
dc.titleAn iterative vertex enumeration method for objective space based vector optimization algorithmsen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
An_iterative_vertex_enumeration_method_for_objective_space_based_vector_optimization_algorithms.pdf
Size:
253.55 KB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.69 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Department of Industrial Engineering