Mazyar Zahedi-Seresht

Dr. Mazyar Zahedi-Seresht

orcid

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
2 January 2024 in Processes
Verified
Journal Article
Open access
PDF file
MZMazyar Zahedi-Seresht
Mazyar Zahedi-Seresht
Bahram Sadeghi BighamBahram Sadeghi Bigham
Bahram Sadeghi Bigham
SKShahrzad Khosravi
Shahrzad Khosravi
HNHoda Nikpour
Hoda Nikpour
This paper presents an approach for optimizing the oil recovery factor by determining initial oil production rates. The proposed method utilizes the Q-learning method and the reservoir simulator (Eclipse 100) to achieve the desired objective. The system identifies the most efficient initial oil production rates by conducting a sufficient number of iterations for various initial oil production rates. To validate the effectiveness of the proposed approach, a case study is conducted using a numerical reservoir model (SPE9) with simplified configurations of two producer wells and one injection well. The simulation results highlight the capabilities of the Q-learning method in assisting reservoir engineers by enhancing the recommended initial rates.

23 July 2024 in Applied Sciences
Verified
Journal Article
Open access
PDF file
SKShahrzad Khosravi
Shahrzad Khosravi
ABAli Bozorgi
Ali Bozorgi
MZMazyar Zahedi-Seresht
Mazyar Zahedi-Seresht
This paper presents a model for a “hub-and-spoke network design considering congestion and flow-based cost function”. The number of hubs and spokes is unknown, and the objective is to minimize the cost (including the transportation cost, lost demand, and facility setup cost). In the post-pandemic era, it is expected to have government-imposed restrictions on the congestion of airports, as a measure of health and safety. Unlike the current literature which considers a monetary penalty for congestion, we consider congestion as an externally imposed factor, which should be modeled as a constraint. We take a gravity-based modeling approach to obtain the desirability of a facility and calculate the demand matrix of the network. To solve the model, a Benders decomposition approach is proposed. Without the Benders decomposition approach, only instances with up to ten nodes were solved within a reasonable time, but with the Benders decomposition approach, instances with up to forty nodes were solved. A heuristic algorithm is developed to have a mechanism for dealing with larger instances. A set of experiments are conducted using data from the Turkish Network dataset to study various aspects of the proposed formulation and different parameters’ effects on the performance of the model.

16 March 2023 in Mathematics
Verified
Journal Article
Open access
PDF file
Bahram Sadeghi BighamBahram Sadeghi Bigham
Bahram Sadeghi Bigham
OAOmid Abbaszadeh
Omid Abbaszadeh
MZMazyar Zahedi-Seresht
Mazyar Zahedi-Seresht
SKShahrzad Khosravi
Shahrzad Khosravi
EZElham Zarezadeh
Elham Zarezadeh
The turning function is a tool in image processing that measures the difference between two polygonal shapes. We propose a localization algorithm for the optimal pose estimation of autonomous mobile robots using the scan-matching method based on the turning function algorithm. There are several methodologies aimed at moving the robots in the right way and carrying out their missions well, which involves the integration of localization and control. In the proposed method, the localization problem is implemented in the form of an optimization problem. Afterwards, the turning function algorithm and the simplex method are applied to estimate the localization and orientation of the robot. The proposed algorithm first receives the polygons extracted from two sensors’ data and then allocates a histogram to each sensor scan. This algorithm attempts to maximize the similarity of the two histograms by converting them to a unified coordinate system. In this way, the estimate of the difference between the two situations is calculated. In more detail, the main objective of this study is to provide an algorithm aimed at reducing errors in the localization and orientation of mobile robots. The simulation results indicate the great performance of this algorithm. Experimental results on simulated and real datasets show that the proposed algorithms achieve better results in terms of both position and orientation metrics.

17 February 2023 in Applied Sciences
Verified
Journal Article
Open access
PDF file
MEMarzieh Eskandari
Marzieh Eskandari
Bahram Sadeghi BighamBahram Sadeghi Bigham
Bahram Sadeghi Bigham
MZMazyar Zahedi-Seresht
Mazyar Zahedi-Seresht
The purpose of the current study is to investigate a special case of art gallery problem, namely a sculpture garden problem. In this problem, for a given polygon P, the ultimate goal is to place the minimum number of guards (landmarks) to define the interior polygon P by applying a monotone Boolean formula composed of the guards. Using this problem, it can replace the operation-based method with time-consuming, pixel-based algorithms. So, the processing time of some problems in the fields of machine vision, image processing and gamification can be strongly reduced. The problem has also many applications in mobile device localization in the Internet of Things (IoT). An open problem in this regard is the proof of Eppstein’s conjecture, which has remained an open problem since 2007. According to his conjecture, in the worst case, n−2 vertex guards are required to describe any n-gon. In this paper, a lower bound is introduced for the special case of this problem (natural vertex guard), which shows that if a polygon can be defined with natural vertex guards, then n−2 is a lower bound.

19 October 2026 in Algorithms
Verified
Journal Article
Open access
PDF file
MKMohadese Khosravi
Mohadese Khosravi
Bahram Sadeghi BighamBahram Sadeghi Bigham
Bahram Sadeghi Bigham
MZMazyar Zahedi-Seresht
Mazyar Zahedi-Seresht
Background: Choosing the number of clusters is still one of the least settled steps in a K-means analysis. The within-cluster sum of squares (WCSS) elbow plot is easy to understand, yet visual inspection is difficult to reproduce, and different validity indices often favor different values because they measure different aspects of the partition. Methods: We propose and evaluate Straw-K, a geometric cluster-number selection method that scores local bends on the normalized WCSS curve. Straw-K is a coined method name, not an acronym. Its construction adapts the local-window and chord-to-path geometry used in ShortStraw corner detection to discrete cluster-number selection; the contribution is the WCSS-specific criterion and its minimization over candidate values of K, rather than a claim that the chord-to-path relation itself is new. Twelve empirical datasets were analyzed without a general sample-size cap. Seven selectors were compared over eight K-means random-state seeds: Straw-K, the official Kneedle implementation, Silhouette, Calinski–Harabasz, Davies–Bouldin, the Gap statistic with B = 50, and the L-method. Agreement with the recorded class count, absolute error, seed stability, runtime, the Friedman test, Holm-adjusted paired Wilcoxon tests, an exploratory ambiguity margin, and a separate Digits/PCA analysis were examined. Results: Across the 96 dataset–seed evaluations available for each method, Straw-K matched the recorded class count in 44.8% of cases and produced a mean absolute error of 1.54, the highest exact-match rate and lowest mean error in the descriptive table. The Friedman test detected an overall difference among the seven selectors (χ2=13.51, p = 0.036), but none of the 21 paired Wilcoxon comparisons remained significant after Holm correction (minimum adjusted p = 0.123). Gap was the slowest method in the independent uncached timing analysis. The ambiguity index showed only a weak, non-significant association with seed instability (Spearman ρ = 0.33, p = 0.303) and is therefore treated as descriptive rather than calibrated uncertainty. Conclusions: Taken together, the experiments suggest a fairly specific use for Straw-K: it offers an inspectable ranking of bends once the short WCSS support curve has been computed. The method did not recover a unique cluster count in every dataset, and Digits remained particularly difficult. The class labels used in the benchmark are best understood as external comparison points; they do not by themselves define the geometry that K-means will uncover.