2021-04-12T07:11:43Z
http://jiei.azad.ac.ir/?_action=export&rf=summon&issue=110214
Journal of Industrial Engineering, International
1735-5702
1735-5702
2007
3
4
An optimization technique for vendor selection with quantity discounts using Genetic Algorithm
N
Arunkumar
L
Karunamoorthy
N
Uma Makeshwaraa
Vendor selection decisions are complicated by the fact that various conflicting multi-objective factors must be considered in the decision making process. The problem of vendor selection becomes still more compli-cated with the inclusion of incremental discount pricing schedule. Such hard combinatorial problems when solved using meta heuristics produce near optimal solutions. This paper proposes a multi-component multiple vendor selection model with vendors offering quantity discounts. This problem is then evaluated using Ge-netic Algorithm with a case study approach. Combinatorial approach is used to group the vendors for selec-tion and Genetic Algorithm to allocate the optimal order quantities for each vendor.
Vendor selection
Multi-objective
Combinatorial
Genetic Algorithm
Quantity discounts
2007
04
01
1
13
http://jiei.azad.ac.ir/article_511084_1d566d96e561f19c8868f87d3e36a153.pdf
Journal of Industrial Engineering, International
1735-5702
1735-5702
2007
3
4
Evaluating quantitative stock selection strategies in Tehran Stock Exchange
A.M
Kimiagari
S
Amini
There are different strategies for selecting stocks, and different investors use different strategies according to their risk tolerance or their expected rate of return. In this study, the profitability of a broad range of stock se-lection strategies in Tehran Stock Exchange over the period 1370-1383, has been examined, and it has been investigated whether the successful strategies in other countries are also successful in Iran or not. Although a lot of comprehensive studies have been done in the developed and in a considerable number of emerging mar-kets, and successful strategies have been well documented in those countries, such studies have never been done in Tehran Stock Exchange. The sample is all the companies in Tehran Stock Exchange in the aforemen-tioned period. Also, in order to evaluate different strategies, various portfolios have been formed for each year according to each strategy. Then, computing the return of winner portfolios, those strategies generating the maximum return in excess of market return, are presented. The evaluation of the performance of the strate-gies has been done regarding various diagnostics criteria like risk and return. The results show that value strategy is the most successful strategy in Iran and generates significant excess return, in contrast to growth, size, price momentum and fundamental strategies. In other words, the most successful strategy in Iran is the multivariate strategy which selects the stocks with high E/P, B/P, C/P, S/P and D/E. Moreover, as apposed to the developed markets and a considerable number of emerging markets, size and momentum strategies are not profitable ones in Tehran Stock Exchange and can not distinguish between profitable and unprofitable stocks.
Value strategy
Growth strategy
Momentum strategy
Size strategy
Stock Selection
Tehran Stock Exchange
2007
04
01
14
23
http://jiei.azad.ac.ir/article_511085_7dd3248ab020aa3b3ba7906030517919.pdf
Journal of Industrial Engineering, International
1735-5702
1735-5702
2007
3
4
Two optimal algorithms for finding bi-directional shortest path design problem in a block layout
M
Hamzeei
R
Zanjirani Farahani
In this paper, Shortest Path Design Problem (SPDP) in which the path is incident to all cells is considered. The bi-directional path is one of the known types of configuration of networks for Automated Guided Vehi-cles (AGV).To solve this problem, two algorithms are developed. For each algorithm an Integer Linear Pro-gramming (ILP) is determined. The objective functions of both algorithms are to find the shortest path. The path must be connected and incident to all cells at least in one edge or node. A simple Branch-and-Cut ap-proach is used to solve the ILP models. Computational results show that the models easily can solve the prob-lem with less than 45 cells using a commercial ILP solver.
AGV
Block layout
Bi-directional path
Integer Linear Programming, Branch-and-Cut
2007
04
01
24
34
http://jiei.azad.ac.ir/article_511086_1c0c22cee34ea1bf1a7c828c63b44756.pdf
Journal of Industrial Engineering, International
1735-5702
1735-5702
2007
3
4
Advanced operations research techniques for multi-constraint QoS routing in internet
HK
Arunkumar
S
Sivakumar
Internet Traffic has grown exponentially over last few years due to provision of multiple class services through Internet backbone. With the explosive use of Internet, contemporary Internet routers are susceptible to overloads and their services deteriorate drastically and often cause denial of services. In this paper, an analysis is made how forecasting technique, routing algorithm and Genetic algorithm can be simultaneously applied for solving a multi-constrained routing problem in Quality of service (QoS) traffic in Internet. Also, a model is suggested for solving the above-mentioned problem. Simulation results show that the throughput of the given network is enhanced by implementing the model. It can also be seen that the average delay of packets flowing through the network comes down when the proposed model is employed for the network.
Qos
Multi-constrained routing
Congestion control
Genetic Algorithm
2007
04
01
35
43
http://jiei.azad.ac.ir/article_511087_ab654b28071c5507a47d202d81473596.pdf
Journal of Industrial Engineering, International
1735-5702
1735-5702
2007
3
4
Multi-start simulated annealing for dynamic plant layout problem
B
Ashtiani
M.B
Aryanezhad
B
Farhang Moghaddam
In today’s dynamic market, organizations must be adaptive to market fluctuations. In addition, studies show that material-handling cost makes up between 20 and 50 percent of the total operating cost. Therefore, this paper considers the problem of arranging and rearranging, when there are changes in product mix and demand, manufacturing facilities such that the sum of material handling and rearrangement costs is minimized. This problem is called the dynamic plant layout problem (DPLP). In this paper, the authors develop a multi-start simulated annealing for DPLP. To compare the performance of meta-heuristics, data sets taken from literature are used in the comparison.
Dynamic layout
Simulated Annealing
Cooling schedule
Multi-start simulated annealing
2007
04
01
44
50
http://jiei.azad.ac.ir/article_511088_76029bd6e730c1253cbf133006f858bd.pdf
Journal of Industrial Engineering, International
1735-5702
1735-5702
2007
3
4
The trim loss concentration in one-dimensional cutting stock problem (1D-CSP) by defining a virtual cost
H
Javanshir
M
Shadalooee
Nowadays, One-Dimensional Cutting Stock Problem (1D-CSP) is used in many industrial processes and re-cently has been considered as one of the most important research topic. In this paper, a metaheuristic algo-rithm based on the Simulated Annealing (SA) method is represented to minimize the trim loss and also to fo-cus the trim loss on the minimum number of large objects. In this method, the 1D-CSP is taken into account as Item-oriented and the authors have tried to minimize the trim loss concentration by using the simulated an-nealing algorithm and also defining a virtual cost for the trim loss of each stock. The solved sample problems show the ability of this algorithm to solve the 1D-CSP in many cases.
One-dimensional cutting stock problem
Simulated Annealing
Trim loss concentration
Item-oriented
FDD algorithm
Virtual cost
2007
04
01
51
58
http://jiei.azad.ac.ir/article_511089_882ea1f9ddf88e2be439479d9c01bcd2.pdf
Journal of Industrial Engineering, International
1735-5702
1735-5702
2007
3
4
On the multivariate variation control chart
R
Noorossana
S.M
Seyedaliakbar
Multivariate control charts such as Hotelling`s T^ 2 and X^ 2 are commonly used for monitoring several related quality characteristics. These control charts use correlation structure that exists between quality characteristics in an attempt to improve monitoring. The purpose of this article is to discuss some issues related to the G chart proposed by Levinson et al. [9] for detecting shifts in the process variance-covariance matrix. They use a G statistic which is distributed as a chi-square with p(p+1) / 2 degrees of freedom where p denotes the number of variables under study. The authors show through simulation that the chi-square distribution only holds for certain cases. The results could be important to practitioners who use G chart for monitoring purposes.
Statistical Process Control
T2 chart
χ2 chart
G chart
Goodness of fit test
2007
04
01
59
66
http://jiei.azad.ac.ir/article_511090_0248eb7e5a485cf0ac12b2b430a7e382.pdf
Journal of Industrial Engineering, International
1735-5702
1735-5702
2007
3
4
A new approach to determine efficient DMUs in DEA models using inverse optimization
GH.R
Amin
This paper proposes a new approach for determining efficient DMUs in DEA models using inverse optimi-zation and without solving any LPs. It is shown that how a two-phase algorithm can be applied to detect effi-cient DMUs. It is important to compare computational performance of solving the simultaneous linear equa-tions with that of the LP, when computational issues and complexity analysis are at focus.
Data Envelopment Analysis (DEA)
Decision Making Units (DMUs)
Inverse optimization
Ellipsoid algorithm
2007
04
01
67
70
http://jiei.azad.ac.ir/article_511091_1592a115eec215451e2c7bdd2fe274ab.pdf