Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Banu Lokman"'
Publikováno v:
European Journal of Operational Research. 300:713-726
We study the day-ahead electricity market clearing problem under the prevailing market design in the European electricity markets. We revisit the Benders decomposition algorithm that has been used to solve this problem. We develop new valid inequalit
Publikováno v:
European Journal of Operational Research. 297:1151-1161
Funding Information: We wish to thank the reviewers for useful suggestions and comments, which greatly improved our paper. Publisher Copyright: © 2021 The Authors Our paper focuses on a robustness analysis of efficiency scores in the context of Data
Publikováno v:
European Journal of Operational Research. 296:804-818
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 a
Publikováno v:
Management Science.
We consider a class of three-objective mixed-integer linear programs (MILPs) where at least one of the objective functions takes only discrete values. These problems commonly occur in MILPs where one or more of the three objective functions contain o
Autor:
Mustafa Koksalan, Banu Lokman
Publikováno v:
Lokman, B & Koksalan, M 2019, ' Identifying preferred solutions in multiobjective combinatorial optimization problems ', Turkish Journal of Electrical Engineering and Computer Sciences, vol. 27, no. 3, pp. 1970-1981 . https://doi.org/10.3906/elk-1807-18
We develop an evolutionary algorithm for multi-objective combinatorial optimization problems. The algorithm aims at converging the preferred solutions of a decision maker. We test the performance of the algorithm on the multi-objective knapsack and m
Publikováno v:
University of Portsmouth
We develop an interactive algorithm that approximates the most preferred solution for any multi-objective integer program with a desired level of accuracy, provided that the decision maker's (DM's) preferences are consistent with a nondecreasing quas
Publikováno v:
Omega. 103:102370
Clustering is a long and widely-used technique to group similar objects based on their distance. Recently, it has been found that this grouping exercise can be enhanced if the preference information of a decision-maker is taken into account. Conseque
Autor:
Banu Lokman
Publikováno v:
Volume: 35, Issue: 4 2075-2088
Gazi Üniversitesi Mühendislik Mimarlık Fakültesi Dergisi
Gazi Üniversitesi Mühendislik Mimarlık Fakültesi Dergisi
Bu çalışmada, maksimum ağırlıklı geç bitirme ve ağırlıklı toplam akış zamanının en küçüklendiği iki kriterli tek makinalı çizelgeleme problemi için bir yaklaşım önerilmiştir. Tüm baskın noktaları üretebilen bu algoritma
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0dd289082e62a67d9e93eaf519a73cee
https://dergipark.org.tr/tr/pub/gazimmfd/issue/56113/573734
https://dergipark.org.tr/tr/pub/gazimmfd/issue/56113/573734
Autor:
Banu Lokman
Publikováno v:
Lokman, B 2019, ' Optimizing a linear function over the nondominated set of multiobjective integer programs ', International Transactions in Operational Research . https://doi.org/10.1111/itor.12627
In this paper, we develop two algorithms to optimize a linear function over the nondominated set of multi-objective integer programs. The algorithms iteratively generate nondominated points and converge to the optimal solution reducing the feasible s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4d3e9ae7f7ba71af31b69275a94ed519
https://researchportal.port.ac.uk/portal/en/publications/optimizing-a-linear-function-over-the-nondominated-set-of-multiobjective-integer-programs(d2680f79-b2da-4ae3-bf55-4f0bd3ea354a).html
https://researchportal.port.ac.uk/portal/en/publications/optimizing-a-linear-function-over-the-nondominated-set-of-multiobjective-integer-programs(d2680f79-b2da-4ae3-bf55-4f0bd3ea354a).html
In this paper, we develop an interactive algorithm that finds the most preferred solution of a decision maker (DM) for multi-objective integer programming problems. We assume that the DM's preferences are consistent with a quasiconcave value function
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b33a43da6fd47a1029d15ff2f814b381
https://hdl.handle.net/11511/57971
https://hdl.handle.net/11511/57971