taghi rezvan - Academia.edu (original) (raw)
Papers by taghi rezvan
Achieving effective coordination among members of the supply chain has become a pertinent researc... more Achieving effective coordination among members of the supply chain has become a pertinent research issue in the supply chain management. This is because coordination has the advantage of reducing total cost and of improving system performance. In this paper, a coordination mechanism is derived under credit period for a two-level supply chain that includes a single manufacturer and a single buyer for a single product. A centralized system is designed to minimize the total variable cost per unit time. Then, theorems are developed to determine the optimal ordering policies and bounds are provided for credit period to develop an algorithm. Numerical examples reveal that our optimization procedure is effective. Cost saving due to coordination is shared as a result of agreement between the two parties involved.
This paper presents an effective memetic algorithm (MA) for a hybrid flow shop scheduling problem... more This paper presents an effective memetic algorithm (MA) for a hybrid flow shop scheduling problem with multiprocessor tasks (HFSMT) to minimize the makespan. The problem is modeled as deterministic by a mixed graph. This problem has at least two production stages, each of which has several machines, operating in parallel. Two sub-problems are considered for solving this problem: determining the sequence of jobs in the first stage and reducing the idle time of the processors in the next stages. The developed algorithm uses an operator called Bad Selection Operator. This operator holds the worst chromosomes of each generation and uses them to search in the space of other problems at predetermined timescales. Besides, this algorithm uses a dynamic adjustment structure to improve the ratio of crossover and mutation operators that could reduce the execution time. The efficiency of the proposed MA is investigated by testing it on well-known benchmark instances and also compared with other...
International Journal of Industrial Engineering-theory Applications and Practice, 2019
Vendor managed inventory (VMI) is a partnership between a supplier and buyers whereby supplier ma... more Vendor managed inventory (VMI) is a partnership between a supplier and buyers whereby supplier makes inventory replenishment decisions on behalf of buyers. A (z, Z) VMI contract is one of the strategies that protects the buyers from dispatching a lot of inventory by the supplier using lower bound z and upper bound Z on the buyer’s inventory level. This paper develops a model for a single vendor and multiple retailers supply chain under (z, Z) VMI contracts by considering the time value of money and also introduces a novel approach designated as “secondary negotiations” in order to improve manufacturer’s cost or retailers’ profits. Numerical analysis is designed to compare the performance (z, Z) VMI contract and independent system (without VMI) that both consider the time value of money. Furthermore, computational results shows that secondary negotiation how change in both upper bounds and replenishment quantity and cause to absorb and keep important retailers and increase their leve...
Achieving effective coordination among members of the supply chain has become a pertinent researc... more Achieving effective coordination among members of the supply chain has become a pertinent research issue in the supply chain management. This is because coordination has the advantage of reducing total cost and of improving system performance. In this paper, a coordination mechanism is derived under credit period for a two-level supply chain that includes a single manufacturer and a single buyer for a single product. A centralized system is designed to minimize the total variable cost per unit time. Then, theorems are developed to determine the optimal ordering policies and bounds are provided for credit period to develop an algorithm. Numerical examples reveal that our optimization procedure is effective. Cost saving due to coordination is shared as a result of agreement between the two parties involved.
Abstract. In original minority game, each agent at every time step chooses the highest-score stra... more Abstract. In original minority game, each agent at every time step chooses the highest-score strategy from its limited number of strategies given arbitrarily in the beginning of the game. In this paper, agents of the minority game are equipped to a multi-layer perceptron neural network that at every time step learns by back propagation error. Simulation results and the comparison of them with the results from original minority game model indicate that the proposed neural network-based learning technique of agents improves the overall performance of the agents.
In original minority game, each agent at every time step chooses the highest-score strategy from ... more In original minority game, each agent at every time step chooses the highest-score strategy from its limited number of strategies given arbitrarily in the beginning of the game. In this paper, agents of the minority game are equipped to a multi-layer perceptron neural network that at every time step learns by back propagation error. Simulation results and the comparison of them with the results from original minority game model indicate that the proposed neural network-based learning technique of agents improves the overall performance of the agents.
One of the most important activities in preventive maintenance is replacement of spare parts prio... more One of the most important activities in preventive maintenance is replacement of spare parts prior to failure. The aim of this paper is to propose an approach which determines jointly the preventive replacement interval and the spare parts inventory by considering different criteria and interacting with decision makers. In this approach, preventive replacement intervals, determined by experts of production and maintenance, are ranked by the analytical hierarchy process (AHP). Criteria such as cost per unit of time, availability, remaining lifetime, and reliability are used. Then, a mixed integer nonlinear multi-objective model is presented that simultaneously specifies the period of preventive replacement and the required number of spare parts. This model considers the mentioned criteria and the inventory control costs of spare parts as different objective functions. Since the solution of the problem depends on the decision maker’s strategy, it needs to interact with the decision-ma...
Journal of Magnetism and Magnetic Materials
Reliability Engineering & System Safety
Operational Research, 2017
Achieving effective coordination among members of the supply chain has become a pertinent researc... more Achieving effective coordination among members of the supply chain has become a pertinent research issue in the supply chain management. This is because coordination has the advantage of reducing total cost and of improving system performance.
International Journal of Operational Research, Mar 20, 2015
290 Int. J. Operational Research, Vol. 10, No. 3, 2011 ... Supply chain coordination for minimisa... more 290 Int. J. Operational Research, Vol. 10, No. 3, 2011 ... Supply chain coordination for minimisation of total cost with credit period approach ... Ali Arkan, Taghi Rezvan and Seyed Reza Hejazi* ... Department of Industrial and Systems Engineering, Isfahan University of Technology, ...
World Journal of Modelling and Simulation
In original minority game, each agent at every time step chooses the highest-score strategy from ... more In original minority game, each agent at every time step chooses the highest-score strategy from its limited number of strategies given arbitrarily in the beginning of the game. In this paper, agents of the minority game are equipped to a multi-layer perceptron neural network that at every time step learns by back propagation error. Simulation results and the comparison of them with the results from original minority game model indicate that the proposed neural network-based learning technique of agents improves the overall performance of the agents.
Decision Science Letters, 2014
Case-based reasoning (CBR) is the process of solving new cases by retrieving the most relevant on... more Case-based reasoning (CBR) is the process of solving new cases by retrieving the most relevant ones from an existing knowledge-base. Since, irrelevant or redundant features not only remarkably increase memory requirements but also the time complexity of the case retrieval, reducing the number of dimensions is an issue worth considering. This paper uses rough set theory (RST) in order to reduce the number of dimensions in a CBR classifier with the aim of increasing accuracy and efficiency. CBR exploits a distance based co-occurrence of categorical data to measure similarity of cases. This distance is based on the proportional distribution of different categorical values of features. The weight used for a feature is the average of cooccurrence values of the features. The combination of RST and CBR has been applied to real categorical datasets of Wisconsin Breast Cancer, Lymphography, and Primary cancer. The 5fold cross validation method is used to evaluate the performance of the proposed approach. The results show that this combined approach lowers computational costs and improves performance metrics including accuracy and interpretability compared to other approaches developed in the literature.
Inappropriate management in some fields such as credit allocation has imposed too many losses to ... more Inappropriate management in some fields such as credit allocation has imposed too many losses to financial institutions and even has forced some of them to go bankrupt. Moreover, large volume data sets collected by credit departments has necessitated utilizing highly accurate models with less complexities. Credit scoring models with classification and forecasting customers into two groups good and bad can dramatically reduce risks of granting credits to customers.
International Journal of Operational Research, 2011
290 Int. J. Operational Research, Vol. 10, No. 3, 2011 ... Supply chain coordination for minimisa... more 290 Int. J. Operational Research, Vol. 10, No. 3, 2011 ... Supply chain coordination for minimisation of total cost with credit period approach ... Ali Arkan, Taghi Rezvan and Seyed Reza Hejazi* ... Department of Industrial and Systems Engineering, Isfahan University of Technology, ...
Transport Policy, 2013
ABSTRACT The aim of this paper is to propose a new hybrid method of urban road(s) selection and c... more ABSTRACT The aim of this paper is to propose a new hybrid method of urban road(s) selection and construction by using a combination of simulation and weighted goal programming (WGP) with different environmental and economical criteria. First, different scenarios were developed based on current and proved future urban land use and on feasibility. These scenarios then were simulated by applying EMME3 software for a scheduled year. The outputs for each scenario were used as input in weighted goal programming. By using the significance of goals which determined by opinion of experts, the pair-wise comparison procedure has been done. The results of WGP determine the scenario with the highest possible utility. This integrated methodology has been applied in the city of Isfahan (Iran). The selected scenario by the proposed methodology, improves the conditions of all six criteria in comparison with current traffic network. This methodology could be applicable for large-scale transportation networks.
Socio-Economic Planning Sciences, 2013
ABSTRACT This paper presents the location-allocation problem of parking facilities in Mobarakeh S... more ABSTRACT This paper presents the location-allocation problem of parking facilities in Mobarakeh Steel Company. The aim is to find the optimal location for the parking facilities and allocate travels between departments to each parking facility. To optimize the cost and facing the transportation demands of all departments, a mathematical model is designed and solved by a commercial software package. Also, the number of vehicles allocated to each parking facility is determined. A hybrid meta-heuristic algorithm combining a genetic algorithm with parallel simulated annealing is developed which can be used even in more complicated structure of the problem. The results show that this hybrid algorithm is highly efficient in solving this kind of problems.
International Journal of Computer Integrated Manufacturing, 2014
ABSTRACT This article considers the two-machine fl ow-shop scheduling problem with the objective o... more ABSTRACT This article considers the two-machine fl ow-shop scheduling problem with the objective of minimising the number of tardy jobs in which jobs have release dates. Since the problem under consideration is an NP-hard problem, a branch-and-bound (B&B) algorithm is viable to solve the problem exactly. A heuristic algorithm as an upper bound, some lower bounds and several ef fi cient dominance properties are used to speed up the elimination process of the B&B algorithm. For the evaluation of the performance of the proposed algorithm, computational experiments are performed on test problems and results are displayed. The experimental results show that the proposed B&B algorithm can solve problems with up to 28 jobs in timely manner, and the average percentage gap of the heuristic solutions is about 10%.
Achieving effective coordination among members of the supply chain has become a pertinent researc... more Achieving effective coordination among members of the supply chain has become a pertinent research issue in the supply chain management. This is because coordination has the advantage of reducing total cost and of improving system performance. In this paper, a coordination mechanism is derived under credit period for a two-level supply chain that includes a single manufacturer and a single buyer for a single product. A centralized system is designed to minimize the total variable cost per unit time. Then, theorems are developed to determine the optimal ordering policies and bounds are provided for credit period to develop an algorithm. Numerical examples reveal that our optimization procedure is effective. Cost saving due to coordination is shared as a result of agreement between the two parties involved.
This paper presents an effective memetic algorithm (MA) for a hybrid flow shop scheduling problem... more This paper presents an effective memetic algorithm (MA) for a hybrid flow shop scheduling problem with multiprocessor tasks (HFSMT) to minimize the makespan. The problem is modeled as deterministic by a mixed graph. This problem has at least two production stages, each of which has several machines, operating in parallel. Two sub-problems are considered for solving this problem: determining the sequence of jobs in the first stage and reducing the idle time of the processors in the next stages. The developed algorithm uses an operator called Bad Selection Operator. This operator holds the worst chromosomes of each generation and uses them to search in the space of other problems at predetermined timescales. Besides, this algorithm uses a dynamic adjustment structure to improve the ratio of crossover and mutation operators that could reduce the execution time. The efficiency of the proposed MA is investigated by testing it on well-known benchmark instances and also compared with other...
International Journal of Industrial Engineering-theory Applications and Practice, 2019
Vendor managed inventory (VMI) is a partnership between a supplier and buyers whereby supplier ma... more Vendor managed inventory (VMI) is a partnership between a supplier and buyers whereby supplier makes inventory replenishment decisions on behalf of buyers. A (z, Z) VMI contract is one of the strategies that protects the buyers from dispatching a lot of inventory by the supplier using lower bound z and upper bound Z on the buyer’s inventory level. This paper develops a model for a single vendor and multiple retailers supply chain under (z, Z) VMI contracts by considering the time value of money and also introduces a novel approach designated as “secondary negotiations” in order to improve manufacturer’s cost or retailers’ profits. Numerical analysis is designed to compare the performance (z, Z) VMI contract and independent system (without VMI) that both consider the time value of money. Furthermore, computational results shows that secondary negotiation how change in both upper bounds and replenishment quantity and cause to absorb and keep important retailers and increase their leve...
Achieving effective coordination among members of the supply chain has become a pertinent researc... more Achieving effective coordination among members of the supply chain has become a pertinent research issue in the supply chain management. This is because coordination has the advantage of reducing total cost and of improving system performance. In this paper, a coordination mechanism is derived under credit period for a two-level supply chain that includes a single manufacturer and a single buyer for a single product. A centralized system is designed to minimize the total variable cost per unit time. Then, theorems are developed to determine the optimal ordering policies and bounds are provided for credit period to develop an algorithm. Numerical examples reveal that our optimization procedure is effective. Cost saving due to coordination is shared as a result of agreement between the two parties involved.
Abstract. In original minority game, each agent at every time step chooses the highest-score stra... more Abstract. In original minority game, each agent at every time step chooses the highest-score strategy from its limited number of strategies given arbitrarily in the beginning of the game. In this paper, agents of the minority game are equipped to a multi-layer perceptron neural network that at every time step learns by back propagation error. Simulation results and the comparison of them with the results from original minority game model indicate that the proposed neural network-based learning technique of agents improves the overall performance of the agents.
In original minority game, each agent at every time step chooses the highest-score strategy from ... more In original minority game, each agent at every time step chooses the highest-score strategy from its limited number of strategies given arbitrarily in the beginning of the game. In this paper, agents of the minority game are equipped to a multi-layer perceptron neural network that at every time step learns by back propagation error. Simulation results and the comparison of them with the results from original minority game model indicate that the proposed neural network-based learning technique of agents improves the overall performance of the agents.
One of the most important activities in preventive maintenance is replacement of spare parts prio... more One of the most important activities in preventive maintenance is replacement of spare parts prior to failure. The aim of this paper is to propose an approach which determines jointly the preventive replacement interval and the spare parts inventory by considering different criteria and interacting with decision makers. In this approach, preventive replacement intervals, determined by experts of production and maintenance, are ranked by the analytical hierarchy process (AHP). Criteria such as cost per unit of time, availability, remaining lifetime, and reliability are used. Then, a mixed integer nonlinear multi-objective model is presented that simultaneously specifies the period of preventive replacement and the required number of spare parts. This model considers the mentioned criteria and the inventory control costs of spare parts as different objective functions. Since the solution of the problem depends on the decision maker’s strategy, it needs to interact with the decision-ma...
Journal of Magnetism and Magnetic Materials
Reliability Engineering & System Safety
Operational Research, 2017
Achieving effective coordination among members of the supply chain has become a pertinent researc... more Achieving effective coordination among members of the supply chain has become a pertinent research issue in the supply chain management. This is because coordination has the advantage of reducing total cost and of improving system performance.
International Journal of Operational Research, Mar 20, 2015
290 Int. J. Operational Research, Vol. 10, No. 3, 2011 ... Supply chain coordination for minimisa... more 290 Int. J. Operational Research, Vol. 10, No. 3, 2011 ... Supply chain coordination for minimisation of total cost with credit period approach ... Ali Arkan, Taghi Rezvan and Seyed Reza Hejazi* ... Department of Industrial and Systems Engineering, Isfahan University of Technology, ...
World Journal of Modelling and Simulation
In original minority game, each agent at every time step chooses the highest-score strategy from ... more In original minority game, each agent at every time step chooses the highest-score strategy from its limited number of strategies given arbitrarily in the beginning of the game. In this paper, agents of the minority game are equipped to a multi-layer perceptron neural network that at every time step learns by back propagation error. Simulation results and the comparison of them with the results from original minority game model indicate that the proposed neural network-based learning technique of agents improves the overall performance of the agents.
Decision Science Letters, 2014
Case-based reasoning (CBR) is the process of solving new cases by retrieving the most relevant on... more Case-based reasoning (CBR) is the process of solving new cases by retrieving the most relevant ones from an existing knowledge-base. Since, irrelevant or redundant features not only remarkably increase memory requirements but also the time complexity of the case retrieval, reducing the number of dimensions is an issue worth considering. This paper uses rough set theory (RST) in order to reduce the number of dimensions in a CBR classifier with the aim of increasing accuracy and efficiency. CBR exploits a distance based co-occurrence of categorical data to measure similarity of cases. This distance is based on the proportional distribution of different categorical values of features. The weight used for a feature is the average of cooccurrence values of the features. The combination of RST and CBR has been applied to real categorical datasets of Wisconsin Breast Cancer, Lymphography, and Primary cancer. The 5fold cross validation method is used to evaluate the performance of the proposed approach. The results show that this combined approach lowers computational costs and improves performance metrics including accuracy and interpretability compared to other approaches developed in the literature.
Inappropriate management in some fields such as credit allocation has imposed too many losses to ... more Inappropriate management in some fields such as credit allocation has imposed too many losses to financial institutions and even has forced some of them to go bankrupt. Moreover, large volume data sets collected by credit departments has necessitated utilizing highly accurate models with less complexities. Credit scoring models with classification and forecasting customers into two groups good and bad can dramatically reduce risks of granting credits to customers.
International Journal of Operational Research, 2011
290 Int. J. Operational Research, Vol. 10, No. 3, 2011 ... Supply chain coordination for minimisa... more 290 Int. J. Operational Research, Vol. 10, No. 3, 2011 ... Supply chain coordination for minimisation of total cost with credit period approach ... Ali Arkan, Taghi Rezvan and Seyed Reza Hejazi* ... Department of Industrial and Systems Engineering, Isfahan University of Technology, ...
Transport Policy, 2013
ABSTRACT The aim of this paper is to propose a new hybrid method of urban road(s) selection and c... more ABSTRACT The aim of this paper is to propose a new hybrid method of urban road(s) selection and construction by using a combination of simulation and weighted goal programming (WGP) with different environmental and economical criteria. First, different scenarios were developed based on current and proved future urban land use and on feasibility. These scenarios then were simulated by applying EMME3 software for a scheduled year. The outputs for each scenario were used as input in weighted goal programming. By using the significance of goals which determined by opinion of experts, the pair-wise comparison procedure has been done. The results of WGP determine the scenario with the highest possible utility. This integrated methodology has been applied in the city of Isfahan (Iran). The selected scenario by the proposed methodology, improves the conditions of all six criteria in comparison with current traffic network. This methodology could be applicable for large-scale transportation networks.
Socio-Economic Planning Sciences, 2013
ABSTRACT This paper presents the location-allocation problem of parking facilities in Mobarakeh S... more ABSTRACT This paper presents the location-allocation problem of parking facilities in Mobarakeh Steel Company. The aim is to find the optimal location for the parking facilities and allocate travels between departments to each parking facility. To optimize the cost and facing the transportation demands of all departments, a mathematical model is designed and solved by a commercial software package. Also, the number of vehicles allocated to each parking facility is determined. A hybrid meta-heuristic algorithm combining a genetic algorithm with parallel simulated annealing is developed which can be used even in more complicated structure of the problem. The results show that this hybrid algorithm is highly efficient in solving this kind of problems.
International Journal of Computer Integrated Manufacturing, 2014
ABSTRACT This article considers the two-machine fl ow-shop scheduling problem with the objective o... more ABSTRACT This article considers the two-machine fl ow-shop scheduling problem with the objective of minimising the number of tardy jobs in which jobs have release dates. Since the problem under consideration is an NP-hard problem, a branch-and-bound (B&B) algorithm is viable to solve the problem exactly. A heuristic algorithm as an upper bound, some lower bounds and several ef fi cient dominance properties are used to speed up the elimination process of the B&B algorithm. For the evaluation of the performance of the proposed algorithm, computational experiments are performed on test problems and results are displayed. The experimental results show that the proposed B&B algorithm can solve problems with up to 28 jobs in timely manner, and the average percentage gap of the heuristic solutions is about 10%.