18
2008-4889
Iran University of Science & Technology
354
Logistic & Apply Chain
Using Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands
Zare Mehrjerdi
Yahia
^{
b
}
Nadizadeh
Ali
^{
b
}Yazd University
1
3
2016
27
1
1
19
07
11
2011
23
02
2015
Using Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands Abstract In this paper, the capacitated location routing problem with fuzzy demands (CLRP_FD) is considered. In CLRP_FD, facility location problem (FLP) and vehicle routing problem (VRP) are observed simultaneously. Indeed the vehicles and the depots have a predefined capacity to serve the customersthat have fuzzy demands. To model the CLRP_FD, a fuzzy chance constrained program is designed, based on fuzzy credibility theory. To solve the CLRP_FD, a greedy clustering method (GCM) including the stochastic simulation is proposed. Finally, to obtain the best value of the preference index of the model and analysis its influence on the final solutions of the problem, numerical experiments are carried out. Keywords: Capacitated location routing problem, Fuzzy demand, Credibility theory, Stochastic simulation, Ant colony system.
624
Logistic & Apply Chain
An Inventory Routing Problem for Perishable Products with Stochastic Demands and Direct Deliveries
Seyedhosseini
Seyed Mohammad
Mahdavi Mazdeh
Mohammad
Makui
Ahmad
Ghoreyshi
Seyed Mohammad
1
3
2016
27
1
21
30
30
12
2014
24
05
2016
In any supply chain, distribution planning of products is of great importance to managers. With effective and flexible distribution planning, mangers can increase the efficiency of time, place, and delivery utility of whole supply chain. In this paper, inventory routing problem (IRP) is applied to distribution planning of perishable products in a supply chain. The studied supply chain is composed of two levels a supplier and customers. Customers’ locations are geographically around the supplier location and their demands are uncertain and follow an independent probability distribution functions. The product has pre-determined fixed life and is to be distributed among customers via a fleet of homogenous vehicles. The supplier uses direct routes for delivering products to customers. The objective is to determine when to deliver to each customer, how much to deliver to them, and how to assign them to vehicle and routes. The mentioned problem is formulated and solved using a stochastic dynamic programming approach. Also, a numerical example is given to illustrate the applicability of proposed approach.
660
Operations Managment
The Challenges of the Performance Evaluation System and Effectiveness of Human Resources Management Practices (Case Study: Iran's Petrochemical Industry)
Teimouri
Hadi
^{
h
}
Jenab
Kouroush
^{
i
}
Khoury
Sam
^{
j
}
^{
h
}University of Isfahan
^{
i
}Embry-Riddle Aeronatical University
^{
j
}Athens State University
1
3
2016
27
1
31
42
27
08
2015
27
01
2016
The main objective of the present survey is to conduct a comparative analysis of the challenges of the performance evaluation system in two private and public sectors and their impact on effectiveness of human resources management practices. This survey was conducted using the field-descriptive method. The historical study method was used to collect theoretical subjects and the field study method was applied to answer the research questions and confirm or reject the research hypotheses. Statistical population of the research included all experts and managers at various levels in two private and public sectors of the petrochemical industry. Cluster-stratified sampling method in two phases was utilized. According to the results of the present survey, there is a significant difference among identified challenges in the performance evaluation system in two private and public sectors of the petrochemical industry. Results demonstrate that the effectiveness level of human resource management practices in the performance evaluation system is higher than the average level in the public sector, effectiveness level of human resource management practices in the performance evaluation system is lower than the average level in the private sector of the petrochemical industry, and there is a significant difference between the effectiveness level of human resource management practices in the performance evaluation system in two private and public sectors of petrochemical industry. Studying the impact of existing challenges in the performance evaluation system on effectiveness of human resource management practices shows existence of a significant and reversed relation among the existing challenges in the performance evaluation system and effectiveness of human resource management practices in this regard.
637
Operations Research
Pricing and Advertising Decisions in a Three-level Supply Chain with Nash, Stackelberg and Cooperative Games
Esmaeili
Parinaz
^{
k
}
Rasti-Barzoki
Morteza
^{
l
}
Hejazi
Reza
^{
m
}
^{
k
}Iran
^{
l
}Iran
^{
m
}Iran
1
3
2016
27
1
43
59
08
04
2015
06
02
2016
Pricing and advertising are two important marketing strategies in the supply chain management which lead to customer demand’s increase and therefore higher profit for members of supply chains. This paper considers advertising, and pricing decisions simultaneously for a three-level supply chain with one supplier, one manufacturer and one retailer. The amount of market demand is influenced by pricing and advertising. In this paper, three well-known approaches in the game theory including the Nash, Stackelberg and Cooperative games are exploited to study the effects of pricing and advertising decisions on the supply chain. Using these approaches, we identify optimal decisions in each case for the supplier, the manufacturer and the retailer. Also, we compare the outcomes decisions among the mentioned games. The results show that, the Cooperative and the Nash games have the highest and lowest advertising expenditure, respectively. The price level in the Nash game is more than the Stackelberg game for all three levels, and the retailer price in the Stackelberg and Cooperative games are equal. The system has the highest profit in the Cooperative game. Finally, the Nash bargaining model will be presented and explored to investigate the possibilities for profit sharing.
553
Optimization Techniques
A New Play-off Approach in League Championship Algorithm for Solving Large-Scale Support Vector Machine Problems
Khoshalhan
Farid
^{
n
}
Nedaie
ali
^{
n
}K.N.Toosi University of Technology
1
3
2016
27
1
61
68
25
09
2013
28
02
2016
There are many numerous methods for solving large-scale problems in which some of them are very flexible and efficient in both linear and non-linear cases. League championship algorithm is such algorithm which may be used in the mentioned problems. In the current paper, a new play-off approach will be adapted on league championship algorithm for solving large-scale problems. The proposed algorithm will be used for solving large-scale solving support vector machine model which is a quadratic optimization problem and cannot be solved in a non polynomial time using exact algorithms or optimally using traditional heuristic ones in large scale sizes. The efficiency of the new algorithm will be compared to traditional one in terms of the optimality and time measures. The superiority of the algorithm can be compared versus older version.
625
Production Planning & Control
Two meta-heuristic algorithms for parallel machines scheduling problem with past-sequence-dependent setup times and effects of deterioration and learning
Salehi Mir
Mir Saber
^{
p
}
Rezaeian
Javad
^{
}
^{
p
}Mazandaran University of Science and Technology
^{
}Mazandaran University of Science and Technology
1
3
2016
27
1
69
88
05
01
2015
04
05
2016
This paper considers identical parallel machines scheduling problem with past-sequence-dependent setup times, deteriorating jobs and learning effects, in which the actual processing time of a job on each machine is given as a function of the processing times of the jobs already processed and its scheduled position on the corresponding machine. In addition, the setup time of a job on each machine is proportional to the actual processing time of the already processed jobs on the corresponding machine, i.e., the setup time of a job is past- sequence-dependent (p-s-d). The objective is to determine jointly the jobs assigned to each machine and the order of jobs such that the total completion time (called TC) is minimized. Since that the problem is NP-hard, optimal solution for the instances of realistic size cannot be obtained within a reasonable amount of computational time using exact solution approaches. Hence, an efficient method based on ant colony optimization algorithm (ACO) is proposed to solve the given problem. The performance of the presented model and the proposed algorithm is verified by a number of numerical experiments. The related results show that ant colony optimization algorithm is effective and viable approache to generate optimal⁄near optimal solutions within a reasonable amount of computational time.