Ignacy Kaliszewski

Prof. Dr. Ignacy Kaliszewski

orcid

Research Focus & Metrics

Academic Career Length

33Years (1994-Present)

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

Representative Publications

View All Publications
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.

13 March 2018 in Journal of Global Optimization
Verified
Journal Article
Open access
PDF file
IKIgnacy Kaliszewski
Ignacy Kaliszewski
JMJ. Miroforidis
J. Miroforidis
In one of our earlier works, we proposed to approximate Pareto fronts to multiobjective optimization problems by two-sided approximations, one from inside and another from outside of the feasible objective set, called, respectively, lower shell and upper shell. We worked there under the assumption that for a given problem an upper shell exists. As it is not always the case, in this paper we give some sufficient conditions for the existence of upper shells. We also investigate how to constructively search infeasible sets to derive upper shells. We approach this issue by means of problem relaxations. We formally show that under certain conditions some subsets of lower shells to relaxed multiobjective optimization problems are upper shells in the respective unrelaxed problems. Results are illustrated by a numerical example representing a small but real mechanical problem. Practical implications of the results are discussed.

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.

16 May 2003 in European Journal of Operational Research
Verified
Journal Article
Closed access
IKIgnacy Kaliszewski
Ignacy Kaliszewski