در هنگام جستجو کلمه در قسمت عنوان میتوانید کلمات مورد جستجو را با کاراکتر (-) جدا کنید.
کاربرد نوع شرط:
- جایگاه : پژوهشی
- مجله: Journal of Optimization in Industrial Engineering
- نوع مقاله: Journal Article
- کلمات کلیدی: Healthcare system,Ant lion optimizer,Districting problem,Grey Wolf Optimizer
- چکیده:
- چکیده انگلیسی: In this paper, the problem of population districting in the health system of South Khorasan province has been investigated in the form of an optimization problem. Now that the districting problem is considered as a strategic matter, it is vital to obtain efficient solutions in order to implement in the system. Therefore in this study two meta-heuristic algorithms, Ant Lion Optimizer (ALO) and Grey Wolf Optimizer (GWO), have been applied to solve the problem in the dimensions of the real world. The objective function of the problem is to maximize the population balance in each district. Problem constraints include unique assignment as well as non-existent allocation of abnormalities. Abnormal allocation means compactness, lack of contiguous, and absence of holes in the districts. According to the obtained results, GWO has a higher level of performance than the ALO. The results of this problem can be applied as a useful scientific tool for districting in other organizations and fields of application.
- انتشار مقاله: 16-02-1396
- نویسندگان: Hiwa Farughi,Sobhan Mostafayi,Jamal Arkat
- مشاهده
- جایگاه : پژوهشی
- مجله: Journal of Industrial and Systems Engineering
- نوع مقاله: Journal Article
- کلمات کلیدی: Supply Chain Management,Cell formation problem,location allocation problem,alternative process routing
- چکیده:
- چکیده انگلیسی: Nowadays, in highly competitive global markets and constant pressure to reduce total costs, enterprises consider group technology and Supply Chain Management (SCM) accordingly and usually separately as the key elements for intra and inter facilities improvement. Simultaneous consideration of the elements of these two disciplines in an integrated design can result in higher efficiency and effectiveness. A three-echelon supply chain that has several markets, production sites, and suppliers is designed again in this paper as a Cellular Manufacturing System (CMS). Every product can be manufactured in the CMS through alternative process routings, in which machines are likely to fail. A linear integer programming model is presented here that seeks to minimize the intercellular movement, procurement, production, and machine breakdown costs. We present a number of illustrative examples to demonstrate the effectiveness of the integrated design. The proposed examples reveal that although the procurement and logistics costs increase slightly in the integrated design, the total cost is dropped considerably.
- انتشار مقاله: 19-03-1396
- نویسندگان: Majid Soolaki,Jamal Arkat
- مشاهده
- جایگاه : پژوهشی
- مجله: Journal of Industrial and Systems Engineering
- نوع مقاله: Journal Article
- کلمات کلیدی: Cross-docking,Simulated annealing algorithm,Truck scheduling,Release time
- چکیده:
- چکیده انگلیسی: In a supply chain, cross-docking is one of the most innovative systems for ameliorating the operational performance at distribution centers. Cross-docking is a logistics strategy in which freight is unloaded from inbound trucks and (almost) directly loaded into outbound trucks, with little or no storage in between, thus no inventory remains at the distribution center. In this study, we consider the scheduling problem of inbound and outbound trucks with multiple dock doors, aiming at the minimization of the makespan. The considered scheduling problem determines where and when the trucks must be processed; also due to the interchangeability specification of products, product assignment is done simultaneously as well. Inbound trucks enter the system according to their release times, however, there is no mandatory time constraint for outbound truck presence at a designated stack door; they should just observe their relative docking sequences. Moreover, a loading sequence is determined for each of the outbound trucks. In this research, a mathematical model is derived to find the optimal solution. Since the problem under study is NP-hard, a simulated annealing algorithm is adapted to find the (near-) optimal solution, as the mathematical model will not be applicable to solve large-scale real-world cases. Numerical examples have been done in order to specify the efficiency of the metaheuristic algorithm in comparison with the results obtained from solving the mathematical model.
- انتشار مقاله: 18-11-1394
- نویسندگان: Jamal Arkat,Parak Qods,Fardin Ahmadizar
- مشاهده
- جایگاه : پژوهشی
- مجله: International Journal of Engineering, Transactions A: Basics
- نوع مقاله: Journal Article
- کلمات کلیدی: cellular manufacturing system,Reactive Scheduling,Resistance to change,Arrival of New Jobs
- چکیده:
- چکیده انگلیسی: Most production environments face random, unexpected events such as machine failure, uncertain processing times, the arrival of new jobs, and cancellation of jobs. For the reduction of the undesirable side effects of an unexpected disruption, the initial schedule needs to be reformed partially or entirely. In this paper, a mathematical model is presented to address the integrated cell formation and cellular rescheduling problems in a cellular manufacturing system. As a reactive model, the model is developed to handle the arrival of a new job as a disturbance to the system. Based on the principle of resistance to change, the reactive model seeks a new solution with the minimum difference from the initial solution. This is realized through a simultaneous minimization of the total completion time and the number of displaced machines. For the investigation of the performance of the proposed model, some numerical examples are solved using the GAMS software. The results demonstrate the ability of the reactive model to obtain solutions resistant to unexpected changes
- انتشار مقاله: 14-04-1399
- نویسندگان: Jamal Arkat,Vahid Rahimi,Hiwa Farughi
- مشاهده
- جایگاه : پژوهشی
- مجله: International Journal of Engineering, Transactions A: Basics
- نوع مقاله: Journal Article
- کلمات کلیدی:
- چکیده:
- چکیده انگلیسی: This paper investigates the network location problem for single-server facilities that are subject to congestion. In each network edge, customers are uniformly distributed along the edge and their requests for service are assumed to be generated according to a Poisson process. A number of facilities are to be selected from a number of candidate sites and a single server is located at each facility with exponentially distributed service times. Using queueing analysis, we develop a mixd integer mathematical model to minimize the total travel and the average waiting times for customers. In order to evaluate the validity of the proposed model, a numerical example is solved and analyzed using GAMS software. In addition, since the proposed problem is NP-hard, two metaheuristic algorithms including a genetic algorithm and a simulated annealing algorithm are developed and applied for large-size problems.
- انتشار مقاله: 11-10-1348
- نویسندگان: Reza Jafari,Jamal Arkat
- مشاهده
- جایگاه : پژوهشی
- مجله: International Journal of Engineering, Transactions A: Basics
- نوع مقاله: Journal Article
- کلمات کلیدی:
- چکیده:
- چکیده انگلیسی: This paper investigates the network location problem for single-server facilities that are subject to congestion. In each network edge, customers are uniformly distributed along the edge and their requests for service are assumed to be generated according to a Poisson process. A number of facilities are to be selected from a number of candidate sites and a single server is located at each facility with exponentially distributed service times. Using queueing analysis, we develop a mixd integer mathematical model to minimize the total travel and the average waiting times for customers. In order to evaluate the validity of the proposed model, a numerical example is solved and analyzed using GAMS software. In addition, since the proposed problem is NP-hard, two metaheuristic algorithms including a genetic algorithm and a simulated annealing algorithm are developed and applied for large-size problems.
- انتشار مقاله: 11-10-1348
- نویسندگان: Reza Jafari,Jamal Arkat
- مشاهده
- جایگاه : پژوهشی
- مجله: Advances in Industrial Engineering
- نوع مقاله: Journal Article
- کلمات کلیدی: Cross-docking,Door assignment,Simulated annealing algorithm,Truck scheduling
- چکیده:
- چکیده انگلیسی: In a supply chain, cross-docking is one of the most innovative systems for ameliorating the operational performance at distribution centers. Cross-docking is a logistics strategy in which freight is unloaded from inbound trucks and (almost) directly loaded into outbound trucks, with little or no storage in between, thus no inventory remains at the distribution center. In this paper, we consider the scheduling problem of inbound and outbound trucks with multiple dock doors, which the aim is to minimize the makespan. In this research, a mathematical model is derived to find the optimal solution. Also a Simulated Annealing algorithm is adapted to find near optimal solution, as the mathematical model will not be applicable for large scale problems. Numerical examples are presented in order to specify the efficiency of the proposed algorithm in comparison with mathematical model.
- انتشار مقاله: 05-02-1395
- نویسندگان: Jamal Arkat,Parak Qods,Fardin Ahmadizar
- مشاهده