SSSeyed Mahdi Shavarani

Seyed Mahdi Shavarani

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Seyed Mahdi Shavarani has a total of 16 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Open Loop Layout Optimization: Feasible Path Planning and Exact Door-to-Door Distance Calculation

    by Seyed Mahdi Shavarani, Bela Vizvari, Kovacs Gergely

    The Open Loop Layout Problem (OLLP) seeks to position rectangular cells of varying dimensions on a plane without overlap, minimizing transportation costs computed as the flow-weighted sum of pairwise distances between cells. A key challenge in OLLP is to compute accurate inter-cell distances along feasible paths that avoid rectangle intersections. Existing approaches approximate inter-cell distances using centroids, a simplification that can ignore physical constraints, resulting in infeasible layouts or underestimated distances. This study proposes the first mathematical model that incorporates exact door-to-door distances and feasible paths under the Euclidean metric, with cell doors acting as pickup and delivery points. Feasible paths between doors must either follow rectangle edges as corridors or take direct, unobstructed routes. To address the NP-hardness of the problem, we present a metaheuristic framework with a novel encoding scheme that embeds exact path calculations. Experiments on standard benchmark instances confirm that our approach consistently outperforms existing methods, delivering superior solution quality and practical applicability.

  • Open Access

    Dynamic Detection of Relevant Objectives and Adaptation to Preference Drifts in Interactive Evolutionary Multi-Objective Optimization

    by Seyed Mahdi Shavarani, Mahmoud Golabi, Richard Allmendinger, Lhassane Idoumghar

    Evolutionary Multi-Objective Optimization Algorithms (EMOAs) are widely employed to tackle problems with multiple conflicting objectives. Recent research indicates that not all objectives are equally important to the decision-maker (DM). In the context of interactive EMOAs, preference information elicited from the DM during the optimization process can be leveraged to identify and discard irrelevant objectives, a crucial step when objective evaluations are computationally expensive. However, much of the existing literature fails to account for the dynamic nature of DM preferences, which can evolve throughout the decision-making process and affect the relevance of objectives. This study addresses this limitation by simulating dynamic shifts in DM preferences within a ranking-based interactive algorithm. Additionally, we propose methods to discard outdated or conflicting preferences when such shifts occur. Building on prior research, we also introduce a mechanism to safeguard relevant objectives that may become trapped in local or global optima due to the diminished correlation with the DM-provided rankings. Our experimental results demonstrate that the proposed methods effectively manage evolving preferences and significantly enhance the quality and desirability of the solutions produced by the algorithm.

  • On Benchmarking Interactive Evolutionary Multiobjective Algorithms

    by Seyed Mahdi Shavarani, Manuel López-Ibáñez, Joshua Knowles

    We carry out a detailed performance assessment of two interactive evolutionary multi-objective algorithms (EMOAs) using a machine decision maker that enables us to repeat experiments and study specific behaviours modeled after human decision makers (DMs). Using the same set of benchmark test problems as in the original papers on these interactive EMOAs (in up to 10 objectives), we bring to light interesting effects when we use a machine DM based on sigmoidal utility functions that have support from the psychology literature (replacing the simpler utility functions used in the original papers). Our machine DM enables us to go further and simulate human biases and inconsistencies as well. Our results from this study, which is the most comprehensive assessment of multiple interactive EMOAs so far conducted, suggest that current well-known algorithms have shortcomings that need addressing. These results further demonstrate the value of improving the benchmarking of interactive EMOAs.


  • Detecting Hidden and Irrelevant Objectives in Interactive Multiobjective Optimization

    by Richard Allmendinger, Seyed Mahdi Shavarani, Manuel López-Ibáñez

    Evolutionary multi-objective optimization algorithms (EMOAs) typically assume that all objectives that are relevant to the decision-maker (DM) are optimized by the EMOA. In some scenarios, however, there are irrelevant objectives that are optimized by the EMOA but ignored by the DM, as well as, hidden objectives that the DM considers when judging the utility of solutions but are not optimized. This discrepancy between the EMOA and the DM’s preferences may impede the search for the most-preferred solution and waste resources evaluating irrelevant objectives. Research on objective reduction has focused so far on the structure of the problem and correlations between objectives and neglected the role of the DM. We formally define here the concepts of irrelevant and hidden objectives and propose methods for detecting them, based on uni-variate feature selection and recursive feature elimination, that use the preferences already elicited when a DM interacts with a ranking-based interactive EMOA (iEMOA). We incorporate the detection methods into an iEMOA capable of dynamically switching the objectives being optimized. Our experiments show that this approach can efficiently identify which objectives are relevant to the DM and reduce the number of objectives being optimized, while keeping and often improving the utility, according to the DM, of the best solution found.


  • An Interactive Decision Tree-Based Evolutionary Multi-objective Algorithm

    by Seyed Mahdi Shavarani, Manuel López-Ibáñez, Richard Allmendinger, Joshua Knowles


  • Open Access

    A congested capacitated location problem with continuous network demand

    by Mahmoud Golabi, Seyed Mahdi Shavarani, Lhassane Idoumghar

    This paper presents a multi-objective mixed-integer non-linear programming model for a congested multiple-server discrete facility location problem with uniformly distributed demands along the network edges. Regarding the capacity of each facility and the maximum waiting time threshold, the developed model aims to determine the number and locations of established facilities along with their corresponding number of assigned servers such that the traveling distance, the waiting time, the total cost, and the number of lost sales (uncovered customers) are minimized simultaneously. Also, this paper proposes modified versions of some of the existing heuristics and metaheuristic algorithms currently used to solve NP-hard location problems. Here, the memetic algorithm along with its modified version called the stochastic memetic algorithm, as well as the modified add and modified drop heuristics are used as the solution methods. Computational results and comparisons demonstrate that although the results obtained from the developed stochastic memetic algorithm are slightly better, the applied memetic algorithm could be considered as the most efficient approach in finding reasonable solutions with less required CPU times.


  • A capacitated biobjective location problem with uniformly distributed demands in the UAV‐supported delivery operation

    by Seyed Mahdi Shavarani, Mahmoud Golabi, Gokhan Izbirak

    In recent years, small unmanned aerial vehicles have been used to deliver medicine and goods as a solution to severe traffic jams and to serve the purpose of fast and effective delivery, especially for medical and emergency applications where time is vital. On the other hand, in the competitive market of today, retailers are considering the use of drones to minimize the customers’ waiting times and as a way to lower their transportation costs. This study aims to develop a biobjective mathematical model to account for the optimum number and spatial location of facilities among a set of candidate locations such that the total travel distance, costs, and lost demand are minimized simultaneously. It is assumed that the demand occurrence follows a Poisson distribution and is uniformly distributed along the network edges. The proposed biobjective capacitated facility location model is NP‐hard, thus nondominated sorting genetic algorithm II and reference‐point based nondominated sorting genetic algorithm are applied to solve the problem. The performance of the algorithms, quality of solutions, and the results are investigated and discussed.


  • Assignment of Medical Staff to Operating Rooms in Disaster Preparedness: A Novel Stochastic Approach

    by Seyed Mahdi Shavarani, Mahmoud Golabi, Bela Vizvari

    Following a large-scale disaster in a highly populated city, one can expect a large number of injured people to need urgent operation. If it can be assumed that the city in question is likely to experience a disaster (although the time of its occurrence is unknown), pre-disaster measures should be taken to mitigate the consequences of the disaster. This article aims to minimize the fatality rate through the proper assignment of operating room personnel to hospitals, such that both the expected value of the functioning operating rooms and the expected value of the service level are maximized. Service level is defined as a variable that has a negative relationship to the distance a patient is expected to travel in order to receive the required medical services. The probability of survival, for both personnel and operating rooms, depends on several stochastic factors. A biobjective mixed integer nonlinear model is proposed for the problem. A simulated annealing algorithm, particle swarm and a genetic algorithm are developed to solve the model using a weighted metric method. The model is applied to a possible worst-case earthquake scenario in Tehran. The results show that the proposed approach significantly improves the performance of post-disaster emergency relief.