-
دسترسی آزاد مقاله
1 - بکارگیری الگوریتم‌های ازدحام ذرات و جستجوی ممنوعه در انتخاب بهینه سبد دارایی
مریم کاظمی عقیله حیدری محمد لشکریدر سال‌های اخیر استفاده از روش‌های ابتکاری و الگوریتم‌های تکاملی برای حل مسائل سبد دارایی بسیار مورد توجه قرار گرفته است. در این پژوهش با استفاده از الگوریتم‌های بهینه‌سازی ازدحام ذرات و جستجوی ممنوعه مدل اندازه‌گیری ریسک دو طرفه، را بهینه می‌کنیم. لازم به ذکر است این م چکیده کاملدر سال‌های اخیر استفاده از روش‌های ابتکاری و الگوریتم‌های تکاملی برای حل مسائل سبد دارایی بسیار مورد توجه قرار گرفته است. در این پژوهش با استفاده از الگوریتم‌های بهینه‌سازی ازدحام ذرات و جستجوی ممنوعه مدل اندازه‌گیری ریسک دو طرفه، را بهینه می‌کنیم. لازم به ذکر است این مدل یک مسئله مقید می‌باشد که با استفاده از روش‌های جریمه به یک مسئله نامقید تبدیل می‌شود. در آخر اطلاعات مربوط به ارزش تاریخی سهام در فاصله سال‌های 2004 تا 2009 به عنوان ورودی‌های مدل در نظر گرفته می‌شود و نتایج دو روش روی آنها مورد بررسی قرار می­گیرد. پرونده مقاله -
دسترسی آزاد مقاله
2 - Multi-Objective Tabu Search Algorithm to Minimize Weight and Improve Formability of Al3105-St14 Bi-Layer Sheet
M Ehsanifar H Momeni N Hamta A. R NezamabadiNowadays, with extending applications of bi-layer metallic sheets in different industrial sectors, accurate specification of each layer is very prominent to achieve desired properties. In order to predict behavior of sheets under different forming modes and determining چکیده کاملNowadays, with extending applications of bi-layer metallic sheets in different industrial sectors, accurate specification of each layer is very prominent to achieve desired properties. In order to predict behavior of sheets under different forming modes and determining rupture limit and necking, the concept of Forming Limit Diagram (FLD) is used. Optimization problem with objective functions and important parameters aims to find optimal thickness for each of Al3105-St14 bi-layer metallic sheet contributors. Optimized point is achieved where formability of the sheet approaches to maximum extent and its weight to minimum extent. In this paper, multi-objective Tabu search algorithm is employed to optimize the considered problem. Finally, derived Pareto front using Tabu search algorithm is presented and results are compared with the solutions obtained from genetic algorithm. Comparison revealed that Tabu search algorithm provides better results than genetic algorithm in terms of Mean Ideal Distance, Spacing, non-uniformity of Pareto front and CPU time. پرونده مقاله -
دسترسی آزاد مقاله
3 - Meta-heuristic methods to solve the problem of subway station facilities in urban management
Mehdi Fazli somayyeh faraji amooginWe consider several location inventory optimization models for the supply chain configuration of subway facilities. It includes several distribution centers and several retailers. Customer demand and redelivery time are considered random. The goal is to find the optimal چکیده کاملWe consider several location inventory optimization models for the supply chain configuration of subway facilities. It includes several distribution centers and several retailers. Customer demand and redelivery time are considered random. The goal is to find the optimal locations for facilities and their inventory policy simultaneously. For this purpose, a two-phase approach based on queuing theory and stochastic optimization was developed. Today, meta-heuristic methods are often used to solve optimization problems such as facility design. in this study; The design of different units, stores, and rooms of a real large-scale subway was organized using three meta-heuristic methods: Migratory Bird Optimization (MBO), Taboo Search (TS), and Simulated Simulation (SA). The results were compared with the existing subway design. As a result, the meta-heuristic methods of MBO and SA have provided the best results that improve the efficiency of the existing subway design to an acceptable level. پرونده مقاله -
دسترسی آزاد مقاله
4 - مروری بر کاربرد روش فراابتکاری جستجوی ممنوعه در حل مسائل مکانیابی
علیرضا بیطرفدر این مقاله مروری، جزئیات کاربرد روش فراابتکاری جستجوی ممنوعه، در حل مسائل مکانیابی بررسی می‌شود. به این منظور، در ابتدا مفهوم مکانیابی و انواع مختلف مسایل مکانیابی معرفی شده و سپس جزئیات روش جستجوی ممنوعه، بطور تفصیلی شرح داده شده است. منظور از مکانیابی، یافتن مکان‌ها چکیده کاملدر این مقاله مروری، جزئیات کاربرد روش فراابتکاری جستجوی ممنوعه، در حل مسائل مکانیابی بررسی می‌شود. به این منظور، در ابتدا مفهوم مکانیابی و انواع مختلف مسایل مکانیابی معرفی شده و سپس جزئیات روش جستجوی ممنوعه، بطور تفصیلی شرح داده شده است. منظور از مکانیابی، یافتن مکان‌های جدید مناسب برای برپا کردن مراکز خدماتی است. امروزه به دلیل افزایش رقابت بین شرکت‌ها، مکانیابی علمی از اهمیت ویژه‌‌ای برخوردار شده است. روش‌های علمی مختلفی برای حل مسائل مکانیابی وجود دارد. در دهه‌های اخیر روش‌های فراابتکاری مختلفی برای حل مسائل مکانیابی معرفی شده‌‌اند. روش‌های فراابتکاری، برای حل مسائلی با داده‌ها و ابعاد زیاد، بدون نیاز به دانستن مسئله، با استفاده از ایده‌های ابتکاری، سرعت حل را افزایش می‌دهند. یکی از روش‌های فراابتکاری، الگوریتم جستجوی ممنوعه است که مبتنی بر جستجوی محلی است و در حل مسائل مکانیابی، نتایج مطلوبی به دست می‌دهد. این الگوریتم، مولفه‌ها و اجزای مختلفی دارد که در این مقاله، بطور مشروح معرفی شده‌‌اند. همچنین اصلاحات و افزوده‌هایی که برای بهبود الگوریتم، توسط محققین به آن اضافه شده است، نیز معرفی شده‌‌اند پرونده مقاله -
دسترسی آزاد مقاله
5 - Solving a Multi-Item Supply Chain Network Problem by Three Meta-heuristic Algorithms
Amir Fatehi Kivi Esmaeil Mehdizadeh Reza Tavakkoli-Moghaddam Seyed Esmaeil NajafiThe supply chain network design not only assists organizations production process (e.g.,plan, control and execute a product’s flow) but also ensure what is the growing need for companies in a longterm. This paper develops a three-echelon supply chain network probl چکیده کاملThe supply chain network design not only assists organizations production process (e.g.,plan, control and execute a product’s flow) but also ensure what is the growing need for companies in a longterm. This paper develops a three-echelon supply chain network problem including multiple plants, multiple distributors, and multiple retailers with amulti-mode demand satisfaction policy inside of production planning and maintenance. The problem is formulated as a mixed-integer linear programming model. Because of its NP-hardness, three meta-heuristic algorithms(i.e., tabu search, harmony search and genetic algorithm) are used to solve the given problem. Also, theTaguchi method is used to choose the best levels of the parameters of the proposedmeta-heuristic algorithms. The results show that HS has abetter solution quality than two other algorithms. پرونده مقاله -
دسترسی آزاد مقاله
6 - Optimal fault-location in smart grids with bfa and ts algorithms with the approach of reducing losses and network costs
Mahmoud Zadehbagheri Mohammadjavad KianiThe smart grid is actually the result of the integration of the structures of the power system and its communication structures, and this is the key point in the implementation of smart grid projects. This means that the integration of electricity production and distrib چکیده کاملThe smart grid is actually the result of the integration of the structures of the power system and its communication structures, and this is the key point in the implementation of smart grid projects. This means that the integration of electricity production and distribution reduces the costs of implementing a smart network, and in this regard, the preparation of the telecommunication platform is one of the most necessary requirements for moving in the direction of smartening the network. The ability to locate the fault and restore the power supply in time is one of the important indicators of a strong smart grid. Especially when a large number of DGs are connected to the system, the network structure and working mode will change, and the demands on the traditional fault location method will increase. In this article, due to the difficulty of using the traditional fault location method in distribution networks with DG, two smart algorithms, TS and BFA, have been used for fault location in this type of networks. So that the location of dynamic distributed generation sources such as wind turbines is done first, then their effect on providing the load profile in the presence of distribution network faults is discussed. The results of the simulation confirm the correctness and correctness of the performance of the proposed method, so that the case studies conducted can open the way for engineers to evaluate new fault. پرونده مقاله -
دسترسی آزاد مقاله
7 - Developing a Permutation Method Using Tabu Search Algorithm: A Case Study of Ranking Some Countries of West Asia and North Africa Based on Important Development Criteria
Javad Rezaeian Keyvan Shokoufi Shahab PoursafaryThe recent years have witnessed an increasing attention to the methods of multiple attribute decision making in solving the problems of the real world due to their shorter time of calculation and easy application. One of these methods is the ‘permutation method&rs چکیده کاملThe recent years have witnessed an increasing attention to the methods of multiple attribute decision making in solving the problems of the real world due to their shorter time of calculation and easy application. One of these methods is the ‘permutation method’ which has a strong logic in connection with ranking issues, but when the number of alternatives increases, solving problems through this method becomes NP-hard. So, meta-heuristic algorithm based on Tabu search is used to find optimum or near optimum solutions at a reasonable computational time for large size problems. This research is an attempt to apply the ‘permutation method’ to rank some countries of the West Asia and the North Africa based on the development criteria. Knowing the situation of each country as compared with other countries, particularly the respective neighbouring countries, is one of the most important standards for the assessment of performance and planning for the future activities. پرونده مقاله -
دسترسی آزاد مقاله
8 - کاربرد منطق فازی و الگوریتم جست‌وجوی ممنوعه (TS) در زمینه حل مسئله هاب به‌منظور مکانیابی بازارهای روز
غلامعلی خمر زهرا سیدی فاطمه وظیفه جوانتخاب نقاط مستعد به‌منظور ایجاد بازارهای روز محله، به‌عنوان واحدی خدماتی، یکی از وظایف خطیر برنامه‌ریزان شهری در زمینه علوم مکانیابی هست، که از سویی با تسهیل دسترسی‌های شهری و از سوی دیگر با کنترل ترافیک شهری ارتباط دارد. هدف پژوهش حاضر مکانیابی بازارهای روز محله در چکیده کاملانتخاب نقاط مستعد به‌منظور ایجاد بازارهای روز محله، به‌عنوان واحدی خدماتی، یکی از وظایف خطیر برنامه‌ریزان شهری در زمینه علوم مکانیابی هست، که از سویی با تسهیل دسترسی‌های شهری و از سوی دیگر با کنترل ترافیک شهری ارتباط دارد. هدف پژوهش حاضر مکانیابی بازارهای روز محله در شهر زابل در راستای توزیع مناسب بازارهای روز به‌منظور تسهیل دسترسی و بهبود تقاضای سفر درون‌شهری می‌باشد. روش تحقیق پژوهش حاضر توصیفی – تحلیلی است. در این تحقیق در مرحله نخست کار، اقدام به شناسایی و بررسی عوامل مثبت و منفی مؤثر بر مکانیابی پرداخته شد. سپس از طی کردن مراحل جمع‌آوری داده‌ها، تهیه لایه اطلاعاتی، طبقه‌بندی و ارزش‌گذاری درونی لایه‌ها و وزن‌دهی و همپوشانی لایه‌های اطلاعاتی با استفاده از افزونه الحاقی منطق فازی در محیط GIS شده و به اولویت‌بندی زمین‌های شهر زابل برای ایجاد بازارهای روز محله پرداخته شد و در نهایت 6 نقطه مساعد به‌منظور مکانیابی بازارهای روز شناسایی شد. در ادامه با توجه به ویژگی‌های مربوط به هرکدام از نقاط انتخابی و محاسبه میزان دسترسی هرکدام از محله های چهل‌گانه شهر زابل نسبت به این نقاط از الگوریتم جست‌وجوی ممنوعه در زمینه حل مسئله مکان یابی هاب استفاده نمودیم. در نتیجه نرم‌افزار با تکرار 100 و با وزن نهایی 531 و در بازه زمانی 11 ثانیه بهترین جواب ممکن را ارائه کرد. یافته های الگوریتم حاکی از آن است که به ترتیب نقاط 1،2، 4 و 5 مناسب‌ترین نقاط به‌منظور مکانیابی بازارهای روز می‌باشد. نقاط 3 و 6 نسبت به نقاط انتخابی نرم‌افزار، به علت محدودیت‌هایی مانند شکل پراکنش محلات شهر، تراکم کم تر جمعیت و دسترسی‌های محدودتر در مجموعه انتخابی قرار نگرفت. پرونده مقاله -
دسترسی آزاد مقاله
9 - meta-heuristic algorithms to solve the problem of terminal facilities on a real scale
مهدی فضلی فرزین مدرس خیابانی بهروز دانشیانa b s t r a c tOur main goal in this article is to arrange terminal facilities, place different departments, stores and units in predefined areas in such a way as to minimize the cost of moving customers and transportation staff. Especially in large-scale terminals with چکیده کاملa b s t r a c tOur main goal in this article is to arrange terminal facilities, place different departments, stores and units in predefined areas in such a way as to minimize the cost of moving customers and transportation staff. Especially in large-scale terminals with several different transport segments, it is important for terminal performance to be close to interactive units. Today, meta-heuristic methods are often used to solve optimization problems such as facility design. in this study; The design of the various units, stores, and rooms of a large-scale real terminal was organized using three meta-heuristic algorithms: Migratory Bird Optimization (MBO), Taboo Search (TS), and Simulated Simulation (SA). The results were compared with the existing terminal design. As a result, MBO and SA metaheuristic algorithms have provided the best results, which improve the efficiency of the existing terminal design to an acceptable level. پرونده مقاله -
دسترسی آزاد مقاله
10 - An Improved Modified Tabu Search Algorithm to Solve the Vehicle Routing Problem with Simultaneous Pickup and Delivery
Majid Yousefikhoshbakht Farzad Didehvar Farhad RahmatiThe vehicle routing problem with simultaneous pickup and delivery (VRPSPD) is a well-known combinatorial optimization problem which addresses provided service to a set of customers using a homogeneous fleet of capacitated vehicles. The objective is to minimize the dista چکیده کاملThe vehicle routing problem with simultaneous pickup and delivery (VRPSPD) is a well-known combinatorial optimization problem which addresses provided service to a set of customers using a homogeneous fleet of capacitated vehicles. The objective is to minimize the distance traveled. The VRPSPD is an NP-hard combinatorial optimization problem. Therefore, practical large-scale instances of VRPSPD cannot be solved by exact solution methodologies within acceptable computational time. Our interest was therefore focused on meta-heuristic solution approaches. For this reason, a modified tabu search (PA) is proposed for solving the VRPSPD in this paper. tComputational results on several standard instances of VRPSPD show the efficiency of the PA compared with other meta-heuristic algorithms. پرونده مقاله -
دسترسی آزاد مقاله
11 - A novel heuristic algorithm for capacitated vehicle routing problem
Sena Kır Harun Res¸it Yazgan Emre TüncelThe vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new چکیده کاملThe vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic algorithm based on the tabu search and adaptive large neighborhood search (ALNS) with several specifically designed operators and features to solve the capacitated vehicle routing problem (CVRP). The effectiveness of the proposed algorithm was illustrated on the benchmark problems. The algorithm provides a better performance on large-scaled instances and gained advantage in terms of CPU time. In addition, we solved a real-life CVRP using the proposed algorithm and found the encouraging results by comparison with the current situation that the company is in. پرونده مقاله -
دسترسی آزاد مقاله
12 - A heuristic approach for multi-stage sequence-dependent group scheduling problems
N SalmasiWe present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) چکیده کاملWe present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initial solution generators are developed to aid in the application of the tabu search-based algorithms. A lower bounding technique based on relaxing the mathematical model for the original SDGS problem is applied to estimate the quality of the heuristic algorithms. To find the best heuristic algorithm, random test problems, ranging in size from small, medium, to large are created and solved by the heuristic algorithms. A detailed statistical experiment, based on nested split-plot design, is performed to find the best heuristic algorithm and the best initial solution gen-erator. The results of the experiment show that the tabu search-based algorithms can provide high quality so-lutions for the problems with an average percentage error of only 1.00%. پرونده مقاله -
دسترسی آزاد مقاله
13 - A new memetic algorithm for mitigating tandem automated guided vehicle system partitioning problem
Parinaz PourrahimianAutomated Guided Vehicle System (AGVS) provides the flexibility and automation demanded by Flexible Manufacturing System (FMS). However, with the growing concern on responsible management of resource use, it is crucial to manage these vehicles in an efficient way in ord چکیده کاملAutomated Guided Vehicle System (AGVS) provides the flexibility and automation demanded by Flexible Manufacturing System (FMS). However, with the growing concern on responsible management of resource use, it is crucial to manage these vehicles in an efficient way in order reduces travel time and controls conflicts and congestions. This paper presents the development process of a new Memetic Algorithm (MA) for optimizing partitioning problem of tandem AGVS. MAs employ a Genetic Algorithm (GA), as a global search, and apply a local search to bring the solutions to a local optimum point. A new Tabu Search (TS) has been developed and combined with a GA to refine the newly generated individuals by GA. The aim of the proposed algorithm is to minimize the maximum workload of the system. After all, the performance of the proposed algorithm is evaluated using Matlab. This study also compared the objective function of the proposed MA with GA. The results showed that the TS, as a local search, significantly improves the objective function of the GA for different system sizes with large and small numbers of zone by 1.26 in average. پرونده مقاله -
دسترسی آزاد مقاله
14 - Solving an one-dimensional cutting stock problem by simulated annealing and tabu search
Meghdad HMA Jahromi Reza Tavakkoli-Moghaddam Ahmad Makui Abbas ShamsiA cutting stock problem is one of the main and classical problems in operations research that is modeled as Lp < /div> problem. Because of its NP-hard nature, finding an optimal solution in reasonable time is extremely difficult and at least non-economical. In thi چکیده کامل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 NP-hard nature, finding an optimal solution in reasonable time is extremely difficult and at least non-economical. In this paper, two meta-heuristic algorithms, namely simulated annealing (SA) and tabu search (TS), are proposed and developed for this type of the complex and large-sized 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. پرونده مقاله -
دسترسی آزاد مقاله
15 - Solving the competitive facility location problem considering the reactions of competitor with a hybrid algorithm including Tabu Search and exact method
Jafar Bagherinejad Azar NiknamIn this paper, a leader–follower competitive facility location problem considering the reactions of the competitors is studied. A model for locating new facilities and determining levels of quality for the facilities of the leader firm is proposed. Moreover, chang چکیده کاملIn this paper, a leader–follower competitive facility location problem considering the reactions of the competitors is studied. A model for locating new facilities and determining levels of quality for the facilities of the leader firm is proposed. Moreover, changes in the location and quality of existing facilities in a competitive market where a competitor offers the same goods or services are taken into account. The competitor could react by opening new facilities, closing existing ones, and adjusting the quality levels of its existing facilities. The market share, captured by each facility, depends on its distance to customer and its quality that is calculated based on the probabilistic Huff’s model. Each firm aims to maximize its profit subject to constraints on quality levels and budget of setting up new facilities. This problem is formulated as a bi-level mixed integer non-linear model. The model is solved using a combination of Tabu Search with an exact method. The performance of the proposed algorithm is compared with an upper bound that is achieved by applying Karush–Kuhn–Tucker conditions. Computational results show that our algorithm finds near the upper bound solutions in a reasonable time. پرونده مقاله -
دسترسی آزاد مقاله
16 - Solving the tandem AGV network design problem using tabu search: Cases of maximum workload and workload balance with fixed and non-fixed number of loops
E Miandoabchi R Zanjirani FarahaniA tandem AGV configuration connects all cells of a manufacturing area by means of non-overlapping, sin-gle-vehicle closed loops. Each loop has at least one additional P/D station, provided as an interface between adjacent loops. This study describes the development of t چکیده کاملA tandem AGV configuration connects all cells of a manufacturing area by means of non-overlapping, sin-gle-vehicle closed loops. Each loop has at least one additional P/D station, provided as an interface between adjacent loops. This study describes the development of three tabu search algorithms for the design of tandem AGV systems. The first algorithm was developed based on the basic definition of a tandem network. The sec-ond and third algorithms, consider no preset number of loops and try to evenly distribute workload among loops by using workload balance as their objective functions. They generate different design scenarios for the tandem network, which can be evaluated and selected using a multi-attribute objective function. The first al-gorithm and the partitioning algorithm presented by Bozer and Srinivasan are compared for randomly gener-ated problems. Results show that for large-scale problems, the partitioning algorithm often leads to infeasible configurations with crossed loops in spite of its shorter running time. However, the newly developed algo-rithm avoids infeasible configurations and often yields better objective function values. پرونده مقاله
سکوی نشر دانش
سند یا سکوی نشر دانش ،سامانه ای جهت مدیریت حوزه علمی و پژوهشی نشریات دانشگاه آزاد می باشد
پیوندهای سایت
مراکز مرتبط
پشتیبانی
صفحات رسمی
حقوق این وب‌سایت متعلق به سامانه مدیریت نشریات دانشگاه آزاد اسلامی است.
حق نشر © 1403-1400