Iman Seyedi

Dr. Iman Seyedi

Informatics, Systems and Communication, University of Milano-Bicocca, Milan, Lombardy, Italy
orcid

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

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

Representative Publications

View All Publications
5 January 2023 in Expert Systems with Applications
Verified
Journal Article
Closed access
ARAtefeh Rajabi-Kafshgar
Atefeh Rajabi-Kafshgar
FGFatemeh Gholian-Jouybari
Fatemeh Gholian-Jouybari
Iman SeyediIman Seyedi
Iman Seyedi
Mostafa Hajiaghaei-KeshteliMostafa Hajiaghaei-Keshteli
Mostafa Hajiaghaei-Keshteli

1 January 2013 in Mathematical and Computer Modelling
Verified
Journal Article
Closed access
AMAshkan Mozdgir
Ashkan Mozdgir
IMIraj Mahdavi
Iraj Mahdavi
Iman SeyediIman Seyedi
Iman Seyedi
MSMaghsud Solimanpur
Maghsud Solimanpur

4 October 2012 in Journal of Industrial Engineering International
Verified
Journal Article
Open access
AMAref Maleki-Darounkolaei
Aref Maleki-Darounkolaei
MMMahmoud Modiri
Mahmoud Modiri
RTReza Tavakkoli-Moghaddam
Reza Tavakkoli-Moghaddam
Iman SeyediIman Seyedi
Iman Seyedi
This paper considers a three-stage assembly flowshop scheduling problem with sequence-dependent setup times at the first stage and blocking times between each stage in such a way that the weighted mean completion time and makespan are minimized. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time using traditional approaches or optimization tools is extremely difficult. Thus, this paper proposes a meta-heuristic method based on simulated annealing (SA) in order to solve the given problem. Finally, the computational results are shown and compared in order to show the efficiency of our proposed SA.

2 April 2024 in Environment, Development and Sustainability
Verified
Journal Article
Open access
PDF file
ARAtefeh Rajabi-Kafshgar
Atefeh Rajabi-Kafshgar
Iman SeyediIman Seyedi
Iman Seyedi
Erfan Babaee TirkolaeeErfan Babaee Tirkolaee
Erfan Babaee Tirkolaee
One of the most critical pillars of Industry 4.0 (I4.0) is Additive Manufacturing (AM) or 3D Printing technology. This transformative technology has garnered substantial attention due to its capacity to streamline processes, save time, and enhance product quality. Simultaneously, environmental concerns are mounting, with the growing accumulation of plastic bottle waste, offering a potential source of recycled material for 3D printing. To thoroughly harness the potential of AM and address the challenge of plastic bottle waste, a robust supply chain network is essential. Such a network not only facilitates the reintegration of plastic bottle waste and 3D printing byproducts into the value chain but also delivers significant environmental, social, and economic benefits, aligning with the tenets of sustainable development and circular economy. To tackle this complex challenge, a Mixed-Integer Linear Programming (MILP) mathematical model is offered to configure a Closed-Loop Supply Chain (CLSC) network with a strong emphasis on circularity. Environmental considerations are integral, and the primary objective is to minimize the overall cost of the network. Three well-known metaheuristics of Simulated Annealing (SA), Genetic Algorithm (GA), and Particle Swarm Optimization (PSO) are employed to treat the problem which are also efficiently adjusted by the Taguchi design technique. The efficacy of our solution methods is appraised across various problem instances. The findings reveal that the developed model, in conjunction with the fine-tuned metaheuristics, successfully optimizes the configuration of the desired circular CLSC network. In conclusion, this research represents a significant step toward the establishment of a circular supply chain that combines the strengths of 3D printing technology and the repurposing of plastic bottle waste. This innovative approach holds promise for not only reducing waste and enhancing sustainability but also fostering economic and social well-being.

30 June 2025 in Mathematics
Verified
Journal Article
Open access
PDF file
Iman SeyediIman Seyedi
Iman Seyedi
ACAntonio Candelieri
Antonio Candelieri
EMEnza Messina
Enza Messina
FAFrancesco Archetti
Francesco Archetti
The purpose of this paper is to present a novel optimization framework that enhances Wasserstein Distributionally Robust Optimization (WDRO) for chance-constrained facility location problems under demand uncertainty. Traditional methods often rely on predefined probability distributions, limiting their flexibility in adapting to real-world demand fluctuations. To overcome this limitation, the proposed approach integrates two methodologies, specifically a Genetic Algorithm to search for the optimal decision about facility opening, inventory, and allocation, and a constrained Jordan–Kinderlehrer–Otto (cJKO) scheme for dealing with robustness in the objective function and chance-constraint with respect to possible unknown fluctuations in demand. Precisely, cJKO is used to construct Wasserstein ambiguity sets around empirical demand distributions (historical data) to achieve robustness. As a result, computational experiments demonstrate that the proposed hybrid approach achieves over 90% demand satisfaction with limited violations of probabilistic constraints across various demand scenarios. The method effectively balances operational cost efficiency with robustness, showing superior performance in handling demand uncertainty compared to traditional approaches.

27 October 2025 in Environment, Development and Sustainability
Verified
Journal Article
Closed access
PDF file
ZAZahra Akbari-Aghghaleh
Zahra Akbari-Aghghaleh
AMAshkan Mozdgir
Ashkan Mozdgir
Iman SeyediIman Seyedi
Iman Seyedi
EMEnza Messina
Enza Messina