2012
8
1
1
0
1

An electromagnetismlike metaheuristic for openshop problems with no buffer
http://jiei.azad.ac.ir/article_676417.html
1
This paper considers openshop scheduling with no intermediate buffer to minimize total tardiness. This problem occurs in many production settings, in the plastic molding, chemical, and food processing industries. The paper mathematically formulates the problem by a mixed integer linear program. The problem can be optimally solved by the model. The paper also develops a novel metaheuristic based on an electromagnetism algorithm to solve the largesized problems. The paper conducts two computational experiments. The first includes smallsized instances by which the mathematical model and general performance of the proposed metaheuristic are evaluated. The second evaluates the metaheuristic for its performance to solve some largesized instances. The results show that the model and algorithm are effective to deal with the problem.
0

0
0


Bahman
Naderi
1Department of Industrial Engineering, Faculty of Engineering, University of
Kharazmi, Karaj, Iran
Iran


Esmaeil
Najafi
Department of Industrial Engineering, Science & Research Branch, Islamic Azad University, Tehran, Iran
Iran


Mehdi
Yazdani
Department of Industrial Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran
Iran
Scheduling
Open shop with no buffer
Mixed integer linear programming
Electromagnetism algorithm
1

A new binary model for university examination timetabling: a case study
http://jiei.azad.ac.ir/article_676418.html
1
Examination timetabling problem (ETP) is one of the most important issues in universities. An improper timetable may result in students' dissatisfaction as it may not let them study enough between two sequential exams. In addition, the many exams to be scheduled, the large number of students who have taken different courses, the limited number of rooms, and some constraints such as no conflict in a single student's exams make it very difficult to schedule experimentally. A mathematical programming model is required to formulate such a sophisticated problem. In this paper, a new binary model is developed for ETP. The novelty of the paper can be discussed in two directions. The first one is that a course can be offered more than once in a semester. If a course is requested by a few students, then it is enough to be offered once. If the number of students requesting a course is more than the maximum number of students who are allowed to attend a single class, then the course is multioffered. The second novelty is that sharing a room for two simultaneous exams is allowed. Also, the model considers some hard and soft constraints, and the objective function is set in such a way that soft constraints are satisfied as much as possible. Finally, the model is applied in a sample department and is solved by GAMS
0

0
0


Alireza
Rashidi Komijan
Department of Industrial Engineering, Firoozkooh Branch, Islamic Azad
University, Firoozkooh, Iran
Iran


Mehrdad
Nouri Koupaei
Department of Management, Firoozkooh Branch, Islamic Azad University, Firoozkooh, Iran
Iran
mhrdd_nouri@yahoo.com
Binary programming
Mathematical Modeling
Examination timetabling problem
1

Retracted: Using genetic algorithm approach to solve a multiproduct EPQ model with defective items, rework, and constrained space
http://jiei.azad.ac.ir/article_676419.html
1
The Economic Production Quantity (EPQ) model is often used in the manufacturing sector to assist firms in determining the optimal production lot size that minimizes overall productioninventory costs. There are some assumptions in the EPQ model that restrict this model for realworld applications. Some of these assumptions are (1) infinite space of warehouse, (2) all of the produced items are perfect, and (3) only one type of goods is produced. In this paper, we develop the EPQ model by assuming that each produced lot contains some imperfect items and scraps. In addition, we have more than one kind of products along with warehouse space limitations. Under these conditions, we formulate the problem as a nonlinear programming model and propose a genetic algorithm to solve it. At the end, we present a numerical example to illustrate the applications of the proposed methodology and identify the optimal value of the parameters of the genetic algorithm.
0

0
0


Kiamars
Fathi Hafshejani
Department of Industrial Management, Islamic Azad University, South
Tehran Branch, P.O. Box: 11365/4435, Tehran, Iran
Iran


Changiz
Valmohammadi
Department of Industrial Management, Islamic Azad University, South
Tehran Branch, P.O. Box: 11365/4435, Tehran, Iran
Iran


Alireza
Khakpoor
Department of Management/Accounting, Islamic Azad University, Qazvin Branch, P.O. Box: 34185–1416, Qazvin, Iran
Iran
EPQ
Multiproduct
Perfect
Imperfect and scrap items
Constrained space
Genetic Algorithm
1

A threestage assembly flow shop scheduling problem with blocking and sequencedependent set up times
http://jiei.azad.ac.ir/article_676420.html
1
This paper considers a threestage assembly flowshop scheduling problem with sequencedependent setup < /div> 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, largesized problem in reasonable computational time using traditional approaches or optimization tools is extremely difficult. Thus, this paper proposes a metaheuristic 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.
0

0
0


Aref
MalekiDarounkolaei
Department of Management and Accounting, South Tehran Branch, Islamic
Azad University, Tehran, Iran
Iran


Mahmoud
Modiri
Department of Management and Accounting, South Tehran Branch, Islamic
Azad University, Tehran, Iran
Iran


Reza
TavakkoliMoghaddam
Department of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran
Iran
tavakoli@ut.ac.ir


Iman
Seyyedi
Department of Industrial Engineering, Payame Noor University, Tehran, Iran
Iran
Assembly flowshop scheduling
Sequencedependent setup times
Blocking times
Weighted mean completion time
makespan
Simulated Annealing
1

Minimizing the total tardiness and makespan in an open shop scheduling problem with sequencedependent setup times
http://jiei.azad.ac.ir/article_676421.html
1
We consider an open shop scheduling problem with setup and processing times separately such that not only the setup times are dependent on the machines, but also they are dependent on the sequence of jobs that should be processed on a machine. A novel biobjective mathematical programming is designed in order to minimize the total tardiness and the makespan. Among several multiobjective decision making (MODM) methods, an interactive one, called the TH method is applied for solving smallsized instances optimally and obtaining Paretooptimal solutions by the Lingo software. To achieve Paretooptimal sets for medium to largesized problems, an improved nondominated sorting genetic algorithm II (NSGAII) is presented that consists of a heuristic method for obtaining a good initial population. In addition, by using the design of experiments (DOE), the efficiency of the proposed improved NSGAII is compared with the efficiency of a wellknown multiobjective genetic algorithm, namely SPEAII. Finally, the performance of the improved NSGAII is examined in a comparison with the performance of the traditional NSGAII.
0

0
0


Samaneh
NooriDarvish
Department of Industrial Engineering, Allame Mohades Noori University, PC: 46415451, Noor, Iran
Iran


Reza
TavakkoliMoghaddam
Department of Industrial Engineering, College of Engineering, University of
Tehran, PC: 1439957131, Tehran, Iran
Iran
tavakoli@ut.ac.ir
Open shop scheduling
Total tardiness
makespan
Sequencedependent setup times
NSGAII
SPEAII
1

Solving an onedimensional cutting stock problem by simulated annealing and tabu search
http://jiei.azad.ac.ir/article_676422.html
1
A cutting stock problem is one of the main and classical problems in operations research that is modeled as Lp < /div> problem. Because of its NPhard nature, finding an optimal solution in reasonable time is extremely difficult and at least noneconomical. In this paper, two metaheuristic algorithms, namely simulated annealing (SA) and tabu search (TS), are proposed and developed for this type of the complex and largesized problem. To evaluate the efficiency of these proposed approaches, several problems are solved using SA and TS, and then the related results are compared. The results show that the proposed SA gives good results in terms of objective function values rather than TS.
0

0
0


Meghdad
HMA Jahromi
Department of Industrial Engineering, Khomein Branch, Islamic Azad
University, Khomein, Iran
Iran


Reza
TavakkoliMoghaddam
Department of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran
Iran
tavakoli@ut.ac.ir


Ahmad
Makui
Department of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran
Iran


Abbas
Shamsi
Department of Industrial Engineering, Khomein Branch, Islamic Azad
University, Khomein, Iran
Iran
Onedimensional cutting stock problem
mathematical model
Simulated Annealing
Tabu search
1

An empirical study of innovationperformance linkage in the paper industry
http://jiei.azad.ac.ir/article_676423.html
1
To enter new markets and remain competitive in the existing markets, companies need to shift their focus from traditional means and ways to some innovative approaches. Though the paper industry in India has improved remarkably on its technological and environmental issues, yet it shows a low rate of innovation. The present paper attempts to review the industry in the perspective of technological innovations and investigates empirically the role of innovations in performance improvement and pollution control. Multivariate analysis of variance and discriminant function analysis are applied for data processing. The findings reveal that the mean scores on the factors, such as sales, quality, and flexibility, are higher for the good innovators than those for the poor innovators. Conversely, the factors which are likely to be reduced as a result of innovations, such as time, cost, emissions, and disposal of waste, have shown higher means for the poor innovators.
0

0
0


Parveen
Farooquie
Department of Mechanical Engineering, Aligarh Muslim University (AMU),
Aligarh, India
Iran


Abdul
Gani
Department of Mechanical Engineering, Aligarh Muslim University (AMU),
Aligarh, India
Iran


Arsalanullah
K Zuberi
Department of Mechanical Engineering, Aligarh Muslim University (AMU),
Aligarh, India
Iran


Imran
Hashmi
Department of Mechanical Engineering, Aligarh Muslim University (AMU),
Aligarh, India
Iran
Discriminant function analysis
Paper industry
performance
Multivariate analysis of variance
Technological innovation
1

The investigation of supply chain's reliability measure: a case study
http://jiei.azad.ac.ir/article_676424.html
1
In this paper, using supply chain operational reference, the reliability evaluation of available relationships in supply chain is investigated. For this purpose, in the first step, the chain under investigation is divided into several stages including first and second suppliers, initial and final customers, and the producing company. Based on the formed relationships between these stages, the supply chain system is then broken down into different subsystem parts. The formed relationships between the stages are based on the transportation of the orders between stages. Paying attention to the system elements' location, which can be in one of the five forms of series namely parallel, series/ parallel, parallel/series, or their combinations, we determine the structure of relationships in the divided subsystems. According to reliability evaluation scales on the three levels of supply chain, the reliability of each chain is then calculated. Finally, using the formulas of calculating the reliability in combined systems, the reliability of each system and ultimately the whole system is investigated.
0

0
0


Houshang
Taghizadeh
Department of Management, Tabriz Branch, Islamic Azad University, Tabriz,
Iran
Iran


Ehsan
Hafezi
Industrial Engineering  System Management and Productivity at the NonGovernmental and Private Higher Education Institution of ALGHADIR, Tabriz, Iran
Iran
Supply Chain
reliability
Supply chain operational reference
1

A simple approach to the twodimensional guillotine cutting stock problem
http://jiei.azad.ac.ir/article_676425.html
1
Cutting stock problems are within knapsack optimization problems and are considered as a nondeterministic polynomialtime (NP)hard problem. In this paper, twodimensional cutting stock problems were presented in which items and stocks were rectangular and cuttings were guillotine. First, a new, practical, rapid, and heuristic method was proposed for such problems. Then, the software implementation and architecture specifications were explained in order to solve guillotine cutting stock problems. This software was implemented by C++ language in a way that, while running the program, the operation report of all the functions was recorded and, at the end, the user had access to all the information related to cutting which included order, dimension and number of cutting pieces, dimension and number of waste pieces, and waste percentage. Finally, the proposed method was evaluated using examples and methods available in the literature. The results showed that the calculation speed of the proposed method was better than that of the other methods and, in some cases, it was much faster. Moreover, it was observed that increasing the size of problems did not cause a considerable increase in calculation time. In another section of the paper, the matter of selecting the appropriate size of sheets was investigated; this subject has been less considered by far. In the solved example, it was observed that incorrect selection from among the available options increased the amount of waste by more than four times. Therefore, it can be concluded that correct selection of stocks for a set of received orders plays a significant role in reducing waste.
0

0
0


MirBahador
Aryanezhad
Department of Industrial Engineering, Iran University of Science and
Technology, Tehran 1684613114, Iran
Iran


Nima
Fakhim Hashemi
Department of Industrial Engineering, Iran University of Science and
Technology, Tehran 1684613114, Iran
Iran


Ahmad
Makui
Department of Industrial Engineering, Iran University of Science and
Technology, Tehran 1684613114, Iran
Iran


Hasan
Javanshir
Department of Industrial Engineering, South Tehran Branch, Islamic Azad University, Tehran, 1151863411, Iran
Iran
Cutting stock problem
Trim loss
Twodimensional cutting
Guillotine cutting
1

Forecasting time and place of earthquakes using a SemiMarkov model (with case study in Tehran province)
http://jiei.azad.ac.ir/article_676426.html
1
The paper examines the application of semiMarkov models to the phenomenon of earthquakes in Tehran province. Generally, earthquakes are not independent of each other, and time and place of earthquakes are related to previous earthquakes; moreover, the time between earthquakes affects the pattern of their occurrence; thus, this occurrence can be likened to semiMarkov models. In our work, we divided the province of Tehran into six regions and grouped the earthquakes regarding their magnitude into three classes. Using a semiMarkov model, it proceeds to predict the likelihood of the time and place of occurrence of earthquakes in the province.
0

0
0


Ramin
Sadeghian
Islamic Azad University, South Tehran Branch, Industrial Engineering Faculty,
Tehran, Iran
Iran
SemiMarkov model
Earthquake occurrence
forecasting
Transition matrix
1

Supply chain network design problem for a new market opportunity in an agile manufacturing system
http://jiei.azad.ac.ir/article_676427.html
1
The characteristics of today's competitive environment, such as the speed with which products are designed, manufactured, and distributed, and the need for higher responsiveness and lower operational cost, are forcing companies to search for innovative ways to do business. The concept of agile manufacturing has been proposed in response to these challenges for companies. This paper copes with the strategic and tactical level decisions in agile supply chain network design. An efficient mixedinteger linear programming model that is able to consider the key characteristics of agile supply chain such as direct shipments, outsourcing, different transportation modes, discount, alliance (process and information integration) between opened facilities, and maximum waiting time of customers for deliveries is developed. In addition, in the proposed model, the capacity of facilities is determined as decision variables, which are often assumed to be fixed. Computational results illustrate that the proposed model can be applied as a power tool in agile supply chain network design as well as in the integration of strategic decisions with tactical decisions.
0

0
0


Reza
Babazadeh
Department of Industrial Engineering, College of Engineering, University of
Tehran, Tehran, Iran
Iran


Jafar
Razmi
Department of Industrial Engineering, College of Engineering, University of
Tehran, Tehran, Iran
Iran


Reza
Ghodsi
Department of Industrial Engineering, College of Engineering, University of
Tehran, Tehran, Iran
Iran
supply chain management
Agile supply chain network design
outsourcing
Responsiveness
1

Constrained consumable resource allocation in alternative stochastic networks via multiobjective decision making
http://jiei.azad.ac.ir/article_676428.html
1
Many real projects complete through the realization of one and only one path of various possible network paths. Here, these networks are called alternative stochastic networks (ASNs). It is supposed that the nodes of considered network are probabilistic with exclusiveor receiver and exclusiveor emitter. First, an analytical approach is proposed to simplify the structure of the network. This approach transforms the network into a simpler equivalent one. This paper discusses the constrained consumable resource allocation problem in an ASN. Many recent researchers apply heuristic and simulation methods to solve the constrained resource allocation in these problems. In this paper, we propose an analytical approach based on multiobjective modeling. The objective functions of this model are the cumulative distribution function of the completion time of ASN paths. These functions must be maximized within the desired network completion time. Lexicographic method is used to solve the proposed multiobjective model. The proposed method is illustrated by an example.
0

0
0


Seyed
Saeid Hashemin
Department of Industrial Engineering, Ardabil Branch, Islamic Azad
University, Ardabil, 5615731567, Iran
Iran


Seyed Mohammad
Taghi Fatemi Ghomi
Department of Industrial Engineering, Amirkabir University of Technology, Tehran, 1598846611, Iran
Iran
stochastic network
Resource allocation
Multiobjective
decision making
Lexicographic Method
Gaussian quadrature formula
Conditional simulation
1

An L1norm method for generating all of efficient solutions of multiobjective integer linear programming problem
http://jiei.azad.ac.ir/article_676429.html
1
This paper extends the proposed method by Jahanshahloo et al. (2004) (a method for generating all the efficient solutions of a 0–1 multiobjective linear programming problem, AsiaPacific Journal of Operational Research). This paper considers the recession direction for a multiobjective integer linear programming (MOILP) problem and presents necessary and sufficient conditions to have unbounded feasible region and infinite optimal values for objective functions of MOILP problems. If the number of efficient solution is finite, the proposed method finds all of them without generating all feasible solutions of MOILP or concluding that there is no efficient solution. In any iteration of the proposed algorithm, a single objective integer linear programming problem, constrained problem, is solved. We will show that the optimal solutions of these single objective integer linear programming problems are efficient solutions of an MOILP problem. The algorithm can also give subsets of efficient solutions that can be useful for designing interactive procedures for large, reallife problems. The applicability of the proposed method is illustrated by using some numerical examples.
0

0
0


Ghasem
Tohidi
1Assistant professor Department of Mathematics, Islamic Azad University,
Central Tehran Branch, Tehran, Iran
Iran


Shabnam
Razavyan
Assistant professor Department of Mathematics, Islamic Azad University, South Tehran Branch, Tehran, Iran
Iran
Multiobjective integer linear programming
Single objective integer linear programming
Recession direction
Efficient solution
L1Norm
1

Mathematical solution of multilevel fractional programming problem with fuzzy goal programming approach
http://jiei.azad.ac.ir/article_676430.html
1
In this paper, we show a procedure for solving multilevel fractional programming problems in a large hierarchical decentralized organization using fuzzy goal programming approach. In the proposed method, the tolerance membership functions for the fuzzily described numerator and denominator part of the objective functions of all levels as well as the control vectors of the higher level decision makers are respectively defined by determining individual optimal solutions of each of the level decision makers. A possible relaxation of the higher level decision is considered for avoiding decision deadlock due to the conflicting nature of objective functions. Then, fuzzy goal programming approach is used for achieving the highest degree of each of the membership goal by minimizing negative deviational variables. We also provide sensitivity analysis with variation of tolerance values on decision vectors to show how the solution is sensitive to the change of tolerance values with the help of a numerical example.
0

0
0


Kailash
Lachhwani
Department of Mathematics, Government Engineering College, Bikaner
334004, India
Iran


Mahaveer
Prasad Poonia
Department of Mechanical Engineering, Government Engineering College, Bikaner, 334004, India
Iran
Multilevel fractional programming
Fuzzy Goal Programming
Membership function
Tolerance values
1

Modeling the operational risk in Iranian commercial banks: case study of a private bank
http://jiei.azad.ac.ir/article_676432.html
1
The Basel Committee on Banking Supervision from the Bank for International Settlement classifies banking risks into three main categories including credit risk, market risk, and operational risk. The focus of this study is on the operational risk measurement in Iranian banks. Therefore, issues arising when trying to implement operational risk models in Iran are discussed, and then, some solutions are recommended. Moreover, all steps of operational risk measurement based on Loss Distribution Approach with Iran's specific modifications are presented. We employed the approach of this study to model the operational risk of an Iranian private bank. The results are quite reasonable, comparing the scale of bank and other risk categories.
0

0
0


Omid
Momen
Karafarin Bank, Tehran, Iran
Iran


Alimohammad
Kimiagari
2Amirkabir University of Technology, Tehran, Iran
Iran
kimiagar@aut.ac.ir


Eaman
Noorbakhsh
Karafarin Bank, Tehran, Iran
Iran
Operational Risk
COPULA
Loss distribution approach
Bank
1

Building a maintenance policy through a multicriterion decisionmaking model
http://jiei.azad.ac.ir/article_676433.html
1
A major competitive advantage of production and service systems is establishing a proper maintenance policy. Therefore, maintenance managers should make maintenance decisions that best fit their systems. Multicriterion decisionmaking methods can take into account a number of aspects associated with the competitiveness factors of a system. This paper presents a multicriterion decisionaided maintenance model with three criteria that have more influence on decision making: reliability, maintenance cost, and maintenance downtime. The Bayesian approach has been applied to confront maintenance failure data shortage. Therefore, the model seeks to make the best compromise between these three criteria and establish replacement intervals using Preference Ranking Organization Method for Enrichment Evaluation (PROMETHEE II), integrating the Bayesian approach with regard to the preference of the decision maker to the problem. Finally, using a numerical application, the model has been illustrated, and for a visual realization and an illustrative sensitivity analysis, PROMETHEE GAIA (the visual interactive module) has been used. Use of PROMETHEE II and PROMETHEE GAIA has been made with Decision Lab software. A sensitivity analysis has been made to verify the robustness of certain parameters of the model.
0

0
0


Elahe
Faghihinia
Department of Industrial Engineering, Islamic Azad University of Najafabad,
Isfahan 8514143131, Iran
Iran


Naser
Mollaverdi
Department of Industrial Engineering, Isfahan University of Technology, Isfahan, 8415683111, Iran
Iran
Preventive maintenance
Agedependent PM policy
PROMETHEE II
bayesian approach
PROMETHEE GAIA
1

A sellerbuyer supply chain model with exponential distribution lead time
http://jiei.azad.ac.ir/article_676434.html
1
Supply chain is an accepted way of remaining in the competition in today's rapidly changing market. This paper presents a coordinated sellerbuyer supply chain model in two stages, which is called Joint Economic Lot Sizing (JELS) in literature. The delivery activities in the supply chain consist of a single raw material. We assume that the delivery lead time is stochastic and follows an exponential distribution. Also, the shortage during the lead time is permitted and completely backordered for the buyer. With these assumptions, the annual cost function of JELS is minimized. At the end, a numerical example is presented to show that the integrated approach considerably improves the costs in comparison with the independent decisions by seller and buyer.
0

0
0


Mehrab
Bahri
Department of Industrial Engineering, Science and Research Branch, Islamic Azad University, Tehran, 14778, Iran
Iran


Mohammad
Jafar Tarokh
Department of Industrial Engineering, K.N. Toosi University of Technology,
Tehran 1439955471, Iran
Iran
Integrated inventory model
Stochastic lead time
Supply chain coordination
Cost
Optimization
1

Risk determinants of small and mediumsized manufacturing enterprises (SMEs)  an exploratory study in New Zealand
http://jiei.azad.ac.ir/article_676435.html
1
The smooth running of small and mediumsized manufacturing enterprises (SMEs) presents a significant challenge irrespective of the technological and human resources they may have at their disposal. SMEs continuously encounter daily internal and external undesirable events and unwanted setbacks to their operations that detract from their business performance. These are referred to as ‘disturbances’ in our research study. Among the disturbances, some are likely to create risks to the enterprises in terms of loss of production, manufacturing capability, human resource, market share, and, of course, economic losses. These are finally referred to as ‘risk determinant’ on the basis of their correlation with some risk indicators, which are linked to operational, occupational, and economic risks. To deal with these risk determinants effectively, SMEs need a systematic method of approach to identify and treat their potential effects along with an appropriate set of tools. However, initially, a strategic approach is required to identify typical risk determinants and their linkage with potential business risks. In this connection, we conducted this study to explore the answer to the research question: what are the typical risk determinants encountered by SMEs? We carried out an empirical investigation with a multimethod research approach (a combination of a questionnairebased mail survey involving 212 SMEs and five indepth case studies) in New Zealand. This paper presents a set of typical internal and external risk determinants, which need special attention to be dealt with to minimize operational risks of an SME
0

0
0


Ariful
Islam
Department of Industrial and Production Engineering, Shahjalal University of
Science and Technology, Sylhet 3114, Bangladesh
Iran


Des
Tedford
Department of Mechanical Engineering, The University of Auckland, Auckland, 1142, New Zealand
Iran
SMEs
Disturbance
Risk
Risk determinants
Strategic risk management
1

Solving the vehicle routing problem by a hybrid metaheuristic algorithm
http://jiei.azad.ac.ir/article_676436.html
1
The vehicle routing problem (VRP) is one of the most important combinational optimization problems that has nowadays received much attention because of its real application in industrial and service problems. The VRP involves routing a fleet of vehicles, each of them visiting a set of nodes such that every node is visited by exactly one vehicle only once. So, the objective is to minimize the total distance traveled by all the vehicles. This paper presents a hybrid twophase algorithm called sweep algorithm (SW) + ant colony system (ACS) for the classical VRP. At the first stage, the VRP is solved by the SW, and at the second stage, the ACS and 3opt local search are used for improving the solutions. Extensive computational tests on standard instances from the literature confirm the effectiveness of the presented approach.
0

0
0


Majid
Yousefikhoshbakht
Young Researchers Club, Hamedan Branch, Islamic Azad University,
Hamedan, Iran
Iran


Esmaile
Khorram
Faculty of Mathematics and Computer Science, Amirkabir University of Technology, Hafez Avenue, Tehran, Iran
Iran
Ant colony system
NPhard Problems
Sweep Algorithm
Vehicle Routing Problem
1

Multiobjective design of fuzzy logic controller in supply chain
http://jiei.azad.ac.ir/article_676437.html
1
Unlike commonly used methods, in this paper, we have introduced a new approach for designing fuzzy controllers. In this approach, we have simultaneously optimized both objective functions of a supply chain over a twodimensional space. Then, we have obtained a spectrum of optimized points, each of which represents a set of optimal parameters which can be chosen by the manager according to the importance of objective functions. Our used supply chain model is a member of inventory and orderbased production control system family, a generalization of the periodic review which is termed ‘OrderUpTo policy.’ An auto rule maker, based on nondominated sorting genetic algorithmII, has been applied to the experimental initial fuzzy rules. According to performance measurement, our results indicate the efficiency of the proposed approach.
0

0
0


Mahdi
Ghane
Mechatronics Department, K.N.Toosi University of Technology, Tehran, 19697 64499, Iran
Iran


Mohammad Jafar Tarokh
Jafar Tarokh
Industrial Engineering Department, K.N.Toosi University of Technology,
Tehran 19697 64499, Iran
Iran
Supply Chain
fuzzy logic controller
MultiObjective Optimization
1

Locomotive assignment problem with train precedence using genetic algorithm
http://jiei.azad.ac.ir/article_676438.html
1
This paper aims to study the locomotive assignment problem which is very important for railway companies, in view of high cost of operating locomotives. This problem is to determine the minimum cost assignment of homogeneous locomotives located in some central depots to a set of prescheduled trains in order to provide sufficient power to pull the trains from their origins to their destinations. These trains have different degrees of priority for servicing, and the high class of trains should be serviced earlier than others. This problem is modeled using vehicle routing and scheduling problem where trains representing the customers are supposed to be serviced in prespecified hard/soft fuzzy time windows. A twophase approach is used which, in the first phase, the multidepot locomotive assignment is converted to a set of single depot problems, and after that, each single depot problem is solved heuristically by a hybrid genetic algorithm. In the genetic algorithm, various heuristics and efficient operators are used in the evolutionary search. The suggested algorithm is applied to solve the medium sized numerical example to check capabilities of the model and algorithm. Moreover, some of the results are compared with those solutions produced by branchandbound technique to determine validity and quality of the model. Results show that suggested approach is rather effective in respect of quality and time.
0

0
0


Siamak
Noori
Department of Industrial Engineering, Iran University of Science and
Technology, Narmak, Tehran 1684613114, Iran
Iran


Seyed Farid
Ghannadpour
Department of Industrial Engineering, Iran University of Science and Technology, Narmak, Tehran, 1684613114, Iran
Iran
Locomotive assignment problem
Vehicle routing and scheduling
Fuzzy time windows
Genetic Algorithm
1

A populationbased algorithm for the railroad blocking problem
http://jiei.azad.ac.ir/article_676439.html
1
Railroad blocking problem (RBP) is one of the problems that need an important decision in freight railroads. The objective of solving this problem is to minimize the costs of delivering all commodities by deciding which interterminal blocks to build and by specifying the assignment of commodities to these blocks, while observing limits on the number and cumulative volume of the blocks assembled at each terminal. RBP is an NPhard combinatorial optimization problem with billions of decision variables. To solve the reallife RBP, developing a metaheuristic algorithm is necessary. In this paper, for the first time, a new genetic algorithmbased solution method, which is a populationbased algorithm, is proposed to solve the RBP. To evaluate the efficiency and the quality of solutions of the proposed algorithm, several simulated test problems are used. The quality and computational time of the generated solutions for the test problems with the proposed genetic algorithm are compared with the solutions of the CPLEX software. The results show high efficiency and effectiveness of the proposed algorithm.
0

0
0


Masoud
Yaghini
School of Railway Engineering, Iran University of Science and Technology,
Tehran 1684613114, Iran
Iran


Masoud
Seyedabadi
School of Railway Engineering, Iran University of Science and Technology, Tehran, 1684613114, Iran
Iran


Mohamad M
Khoshraftar
School of Railway Engineering, Iran University of Science and Technology, Tehran, 1684613114, Iran
Iran
Railroad blocking problem
Genetic Algorithm
Budget design problem
1

Resource leveling scheduling by an ant colonybased model
http://jiei.azad.ac.ir/article_676440.html
1
In project scheduling, many problems can arise when resource fluctuations are beyond acceptable limits. To overcome this, mathematical techniques have been developed for leveling resources. However, these produce a hard and inflexible approach in scheduling projects. The authors propose a simple resource leveling approach that can be used in scheduling projects with multimode execution activities. In the mentioned approach, an ant algorithm determines the execution mode of each activity so that resource leveling index and project time become optimum. In the model, some visibility functions (defined in accordance with problem characteristics) are utilized, and the best, which return the best result, is selected for the model.
0

0
0


Mohsen
Garmsiri
MBA Program, Payame Noor University, Tehran, Iran
Iran


Mohammad Reza
Abassi
MBA Program, Payame Noor University, Tehran, Iran
Iran
Ant colony optimization
Resource leveling
Visibility function
1

Effective heuristics and metaheuristics for the quadratic assignment problem with tuned parameters and analytical comparisons
http://jiei.azad.ac.ir/article_676441.html
1
Quadratic assignment problem (QAP) is a wellknown problem in the facility location and layout. It belongs to the NPcomplete class. There are many heuristic and metaheuristic methods, which are presented for QAP in the literature. In this paper, we applied 2opt, greedy 2opt, 3opt, greedy 3opt, and VNZ as heuristic methods and tabu search (TS), simulated annealing, and particle swarm optimization as metaheuristic methods for the QAP. This research is dedicated to compare the relative percentage deviation of these solution qualities from the best known solution which is introduced in QAPLIB. Furthermore, a tuning method is applied for metaheuristic parameters. Results indicate that TS is the best in 31% of QAPs, and the IFLS method, which is in the literature, is the best in 58 % of QAPs; these two methods are the same in 11% of test problems. Also, TS has a better computational time among heuristic and metaheuristic methods.
0

0
0


Mahdi
Bashiri
Department of Industrial Engineering, Shahed University, Tehran 3319118651,
Iran
Iran


Hossein
Karimi
Department of Industrial Engineering, Shahed University, Tehran, 3319118651, Iran
Iran
quadratic assignment problem
Heuristics
Metaheuristics
Tuning method
1

An investigation of model selection criteria for technical analysis of moving average
http://jiei.azad.ac.ir/article_676442.html
1
Moving averages are one of the most popular and easytouse tools available to a technical analyst, and they also form the building blocks for many other technical indicators and overlays. Building a moving average (MA) model needs determining four factors of (1) approach of issuing signals, (2) technique of calculating MA, (3) length of MA, and (4) band. After a literature review of technical analysis (TA) from the perspective of MA and some discussions about MA as a TA, this paper is structured to highlight the effects that each of the first three factors has on performance of MA as a TA. The results that based on some experiments with real data support the fact that deciding about the first and second factors is not much critical, and more attention should be paid to other factors.
0

0
0


Milad
Jasemi
Department of Industrial Engineering, Islamic Azad University, Masjed
Soleyman Branch, Masjed Soleyman, 61649, Iran
Iran


Ali M
Kimiagari
Department of Industrial Engineering, Amirkabir University of Technology, Tehran, 15914, Iran
Iran
moving average
Technical Analysis
Trend forecasting
Investment decision
Portfolio Selection
1

A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic travel times considering the driver's satisfaction
http://jiei.azad.ac.ir/article_676443.html
1
A vehicle routing problem is a significant problem that has attracted great attention from researchers in recent years. The main objectives of the vehicle routing problem are to minimize the traveled distance, total traveling time, number of vehicles and cost function of transportation. Reducing these variables leads to decreasing the total cost and increasing the driver's satisfaction level. On the other hand, this satisfaction, which will decrease by increasing the service time, is considered as an important logistic problem for a company. The stochastic time dominated by a probability variable leads to variation of the service time, while it is ignored in classical routing problems. This paper investigates the problem of the increasing service time by using the stochastic time for each tour such that the total traveling time of the vehicles is limited to a specific limit based on a defined probability. Since exact solutions of the vehicle routing problem that belong to the category of NPhard problems are not practical in a large scale, a hybrid algorithm based on simulated annealing with genetic operators was proposed to obtain an efficient solution with reasonable computational cost and time. Finally, for some small cases, the related results of the proposed algorithm were compared with results obtained by the Lingo 8 software. The obtained results indicate the efficiency of the proposed hybrid simulated annealing algorithm.
0

0
0


Reza
TavakkoliMoghaddam
Department of Industrial Engineering, College of Engineering, University of
Tehran, Tehran, Iran
Iran
tavakoli@ut.ac.ir


Mehdi
Alinaghian
Department of Industrial and Systems Engineering, Isfahan University of Technology, Isfahan, Iran
Iran


Alireza
SalamatBakhsh
Department of Industrial Engineering, Tehran South Branch, Islamic Azad University Tehran, Iran
Iran


Narges
Norouzi
Department of Industrial Engineering, College of Engineering, University of
Tehran, Tehran, Iran
Iran
Vehicle Routing Problem
Stochastic travel times
Driver's satisfaction
Simulated Annealing
1

A hybrid algorithm optimization approach for machine loading problem in flexible manufacturing system
http://jiei.azad.ac.ir/article_676444.html
1
The production planning problem of flexible manufacturing system (FMS) concerns with decisions that have to be made before an FMS begins to produce parts according to a given production plan during an upcoming planning horizon. The main aspect of production planning deals with machine loading problem in which selection of a subset of jobs to be manufactured and assignment of their operations to the relevant machines are made. Such problems are not only combinatorial optimization problems, but also happen to be nondeterministic polynomialtimehard, making it difficult to obtain satisfactory solutions using traditional optimization techniques. In this paper, an attempt has been made to address the machine loading problem with objectives of minimization of system unbalance and maximization of throughput simultaneously while satisfying the system constraints related to available machining time and tool slot designing and using a metahybrid heuristic technique based on genetic algorithm and particle swarm optimization. The results reported in this paper demonstrate the model efficiency and examine the performance of the system with respect to measures such as throughput and system utilization.
0

0
0


Vijay M
Kumar
Department of Mechanical Engineering, JSS Academy of Technical
Education, Bangalore, 560 060, India
Iran


ANN
Murthy
JSS Academy of Technical Education, Bangalore, 560 060, India
Iran


K
Chandrashekara
Sri Jayachamarajendra College of Engineering, Mysore, 570 006, India
Iran
Flexible manufacturing system
Production Planning
Loading
Hybrid algorithm optimization
1

Analysis of M/G/ 1 queueing model with state dependent arrival and vacation
http://jiei.azad.ac.ir/article_676445.html
1
This investigation deals with single server queueing system wherein the arrival of the units follow Poisson process with varying arrival rates in different states and the service time of the units is arbitrary (general) distributed. The server may take a vacation of a fixed duration or may continue to be available in the system for next service. Using the probability argument, we construct the set of steady state equations by introducing the supplementary variable corresponding to elapsed service time. Then, we obtain the probability generating function of the units present in the system. Various performance indices, such as expected number of units in the queue and in the system, average waiting time, etc., are obtained explicitly. Some special cases are also deduced by setting the appropriate parameter values. The numerical illustrations are provided to carry out the sensitivity analysis in order to explore the effect of different parameters on the system performance measures.
0

0
0


Charan
Jeet Singh
Department of Mathematics Guru Nanak Dev University, Amritsar, Punjab,
143005, India
Iran


Madhu
Jain
Department of Mathematics, Indian Institute of Technology, Roorkee, Roorkee, Uttarakhand, 247667, India
Iran


Binay
Kumar
Department of Mathematics, M.L.U. DAV College, Phagwara, Punjab, 144402, India
Iran
State dependent
Queue
Arbitrary service time
Vacation
Supplementary variable
Average Queue Length
1

Performance enhancement for crystallization unit of a sugar plant using genetic algorithm technique
http://jiei.azad.ac.ir/article_676446.html
1
This paper deals with the performance enhancement for crystallization unit of a sugar plant using genetic algorithm. The crystallization unit of a sugar industry has three main subsystems arranged in series. Considering exponential distribution for the probable failures and repairs, the mathematical formulation of the problem is done using probabilistic approach, and differential equations are developed on the basis of Markov birthdeath process. These equations are then solved using normalizing conditions so as to determine the steadystate availability of the crystallization unit. The performance of each subsystem of crystallization unit in a sugar plant has also been optimized using genetic algorithm. Thus, the findings of the present paper will be highly useful to the plant management for the timely execution of proper maintenance decisions and, hence, to enhance the system performance.
0

0
0


P C
Tewari
Department of Mechanical Engineering, National Institute of Technology, Kurukshetra, Haryana, 136119, India
Iran


Rajiv
Khanduja
Department of Mechanical Engineering, Seth Jai Parkash Mukand Lal
Institute of Engineering and Technology (JMIT), Radaur, Yamuna Nagar,
Haryana135133, India
Iran


Mahesh
Gupta
Department of Mechanical Engineering, National Institute of Technology, Kurukshetra, Haryana, 136119, India
Iran
Performance Enhancement
Crystallization unit
Genetic Algorithm