http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Iskandar MUDA,R. Sivaraman,Sulieman Ibraheem Shelash Al-Hawary,Untung Rahardja,Rusul S. Bader,Deni Kadarsyah,Karrar Shareef Mohsen,Abdullah Hasan Jabbar,Purnima Chaudhary 대한산업공학회 2022 Industrial Engineeering & Management Systems Vol.21 No.3
In this research, the location of hubs in computer networks is investigated using the whale optimization algorithm. The problem of locating hubs in computer networks is an optimization problem and requires the definition of a suitable fit function. Therefore, the total data transfer time and the cost of creating hubs is used as a fit function. Capacitive hubs increase network availability because hubs have more response capacity than the number of node requests connected to the hubs. In hub location issues, the study seeks to connect the nodes to the nearest hub and create a computer network with the least cost of connecting the nodes to the hubs. The present study attempts to reduce disruptions in computer networks as a research innovation. Therefore, by using the whale optimization algorithm and solving the model with its help, the effective factors that affect computer network disruptions and examining the effect of each are identified. Given the results, the model’s reaction in terms of time and cost led to an increase in temporal and cost parameters.
Tua Halomoan Harahap,Ngakan Ketut Acwin Dwijendra,Sulieman Ibraheem Shelash Al-Hawary,A. Heri Iswanto,Noor Mohammed Ahmed,Yousra Mahdi Hasan,Saad Ghazi Talib,Purnima Chaudhary,Yasser Fakri Mustafa 대한산업공학회 2022 Industrial Engineeering & Management Systems Vol.21 No.3
The traveling salesman problem is one of the most well-known hybrid optimization problems. It is one of the (NP-complete) problems that its various applications have theoretically and operationally attracted the attention of re-searchers. Given that the existing optimization methods to solve such problems include many variables and constraints and reduce their practical efficiency in solving problems with larger dimensions, we have seen the use of algorithms in recent decades. In this research, after determining a linear programming model for the asylum seeker problem with asymmetric distances and solving it in Lingo software, I used two ant cloning algorithms and a forbidden search algorithm to solve the problem in large dimensions. By adjusting the parameters of the two algorithms using the Taguchi method to prove the efficiency of the two algorithms, we compared their results by solving the linear programming model in small-dimensional problems. Then, to compare the results and execution time of the two algorithms, we solved the problem in medium and large dimensions.