Javad Tayyebi

Prof. Javad Tayyebi

orcid

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

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

Representative Publications

View All Publications
1 May 2018 in Discrete Applied Mathematics
Verified
Journal Article
Closed access
JTJavad Tayyebi
Javad Tayyebi
MAMassoud Aman
Massoud Aman

25 September 2019 in Mathematics
Verified
Journal Article
Open access
PDF file
JTJavad Tayyebi
Javad Tayyebi
Adrian Marius DeaconuAdrian Marius Deaconu
Adrian Marius Deaconu
A natural extension of maximum flow problems is called the generalized maximum flow problem taking into account the gain and loss factors for arcs. This paper investigates an inverse problem corresponding to this problem. It is to increase arc capacities as less cost as possible in a way that a prescribed flow becomes a maximum flow with respect to the modified capacities. The problem is referred to as the generalized maximum flow problem (IGMF). At first, we present a fast method that determines whether the problem is feasible or not. Then, we develop an algorithm to solve the problem under the max-type distances in O ( m n · log n ) time. Furthermore, we prove that the problem is strongly NP-hard under sum-type distances and propose a heuristic algorithm to find a near-optimum solution to these NP-hard problems. The computational experiments show the accuracy and the efficiency of the algorithm.

13 September 2024 in Mathematics
Verified
Journal Article
Open access
PDF file
MNMalihe Niksirat
Malihe Niksirat
MSMohsen Saffarian
Mohsen Saffarian
JTJavad Tayyebi
Javad Tayyebi
Adrian Marius DeaconuAdrian Marius Deaconu
Adrian Marius Deaconu
Delia Elena SpridonDelia Elena Spridon
Delia Elena Spridon
This paper explores a multi-objective, multi-period integrated routing and scheduling problem under uncertain conditions for distributing relief to disaster areas. The goals are to minimize costs and maximize satisfaction levels. To achieve this, the proposed mathematical model aims to speed up the delivery of relief supplies to the most affected areas. Additionally, the demands and transportation times are represented using fuzzy numbers to more accurately reflect real-world conditions. The problem was formulated using a fuzzy multi-objective integer programming model. To solve it, a hybrid algorithm combining a multi-objective ant colony system and simulated annealing algorithm was proposed. This algorithm adopts two ant colonies to obtain a set of nondominated solutions (the Pareto set). Numerical analyses have been conducted to determine the optimal parameter values for the proposed algorithm and to evaluate the performance of both the model and the algorithm. Furthermore, the algorithm’s performance was compared with that of the multi-objective cat swarm optimization algorithm and multi-objective fitness-dependent optimizer algorithm. The numerical results demonstrate the computational efficiency of the proposed method.

27 September 2020 in Journal of Combinatorial Optimization
Verified
Journal Article
Closed access
PDF file
JTJavad Tayyebi
Javad Tayyebi
ASAli Reza Sepasian
Ali Reza Sepasian

1 October 2020 in Computers & Industrial Engineering
Verified
Journal Article
Closed access
AAAbolfazl Abdolahzadeh
Abolfazl Abdolahzadeh
MAMassoud Aman
Massoud Aman
JTJavad Tayyebi
Javad Tayyebi

20 May 2022 in European Journal of Operational Research
Verified
Journal Article
Closed access
JTJavad Tayyebi
Javad Tayyebi
AMAnkan Mitra
Ankan Mitra
JSJorge A. Sefair
Jorge A. Sefair