Janusz Miroforidis

Dr. Janusz Miroforidis

orcid

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 March 2018 in Computational Optimization and Applications
Verified
Journal Article
Open access
PDF file
EBEwa M. Bednarczuk
Ewa M. Bednarczuk
JMJanusz Miroforidis
Janusz Miroforidis
PPPrzemysław Pyzel
Przemysław Pyzel
We propose a method for finding approximate solutions to multiple-choice knapsack problems. To this aim we transform the multiple-choice knapsack problem into a bi-objective optimization problem whose solution set contains solutions of the original multiple-choice knapsack problem. The method relies on solving a series of suitably defined linearly scalarized bi-objective problems. The novelty which makes the method attractive from the computational point of view is that we are able to solve explicitly those linearly scalarized bi-objective problems with the help of the closed-form formulae. The method is computationally analyzed on a set of large-scale problem instances (test problems) of two categories: uncorrelated and weakly correlated. Computational results show that after solving, in average 10 scalarized bi-objective problems, the optimal value of the original knapsack problem is approximated with the accuracy comparable to the accuracies obtained by the greedy algorithm and an exact algorithm. More importantly, the respective approximate solution to the original knapsack problem (for which the approximate optimal value is attained) can be found without resorting to the dynamic programming. In the test problems, the number of multiple-choice constraints ranges up to hundreds with hundreds variables in each constraint.

1 January 2017 in Computer Science
Verified
Journal Article
Open access
PDF file
IKIgnacy Kaliszewski
Ignacy Kaliszewski
JMJanusz Miroforidis
Janusz Miroforidis
JSJarosław Tomasz Stańczak
Jarosław Tomasz Stańczak
Multiobjective optimization in the Airport Gate Assignment Problem, exact versus evolutionary multiobjective optimization

17 December 2013 in Journal of Optimization Theory and Applications
Verified
Journal Article
Open access
PDF file
IKIgnacy Kaliszewski
Ignacy Kaliszewski
JMJanusz Miroforidis
Janusz Miroforidis
A new approach to derive Pareto front approximations with evolutionary computations is proposed here.

3 February 2022 in International Transactions in Operational Research
Verified
Journal Article
Closed access
PDF file
Przemysław JuszczukPrzemysław Juszczuk
Przemysław Juszczuk
IKIgnacy Kaliszewski
Ignacy Kaliszewski
JMJanusz Miroforidis
Janusz Miroforidis
DPDmitry Podkopaev
Dmitry Podkopaev

19 September 2020 in Journal of Global Optimization
Verified
Journal Article
Open access
PDF file
IKIgnacy Kaliszewski
Ignacy Kaliszewski
JMJanusz Miroforidis
Janusz Miroforidis
When solving large-scale multiobjective optimization problems, solvers can get stuck because of memory and/or time limitations. In such cases, one is left with no information on the distance to the best feasible solution, found before the optimization process has stopped, to the true Pareto optimal solution. In this work, we show how to provide such information. To this aim we make use of the concept of lower shells and upper shells, developed in our earlier works. No specific assumptions about the problems to be solved are made. We illustrate the proposed approach on biobjective multidimensional knapsack problems derived from single-objective multidimensional knapsack problems in the Beasley OR Library. We address cases when a top-class commercial mixed-integer linear solver fails to provide Pareto optimal solutions attempted to be derived by scalarization.

23 April 2021 in Journal of Global Optimization
Verified
Journal Article
Open access
PDF file
JMJanusz Miroforidis
Janusz Miroforidis
When solving large-scale cardinality-constrained Markowitz mean–variance portfolio investment problems, exact solvers may be unable to derive some efficient portfolios, even within a reasonable time limit. In such cases, information on the distance from the best feasible solution, found before the optimization process has stopped, to the true efficient solution is unavailable. In this article, I demonstrate how to provide such information to the decision maker. I aim to use the concept of lower bounds and upper bounds on objective function values of an efficient portfolio, developed in my earlier works. I illustrate the proposed approach on a large-scale data set based upon real data. I address cases where a top-class commercial mixed-integer quadratic programming solver fails to provide efficient portfolios attempted to be derived by Chebyshev scalarization of the bi-objective optimization problem within a given time limit. In this case, I propose to transform purely technical information provided by the solver into information which can be used in navigation over the efficient frontier of the cardinality-constrained Markowitz mean–variance portfolio investment problem.