Quadratic Assignment Problem (QAP) has been a very popular problem to be solved among researchers due to its practical applications. Several variants of QAP have been proposed by researchers in the past in order to re...
Quadratic Assignment Problem (QAP) has been a very popular problem to be solved among researchers due to its practical applications. Several variants of QAP have been proposed by researchers in the past in order to reflect the real situations of QAP. One of the real problems of QAP is related with facilities which are required to be assigned to certain locations due to its function. In solving this problem, a fixed assignment has to be made thus allowing for the complexity of the problem to be reduced. Hence, this study introduces Quadratic Assignment Problem with Fixed Assignment (QAPFA) with the objective to minimize the assignment cost between the facility and location. This assignment takes into account the flow and distance between facility and location. QAPFA represents the real-world situation of the problem especially in dealing with specific requirement of some facilities to specific locations. Dataset of QAPFA is introduced and is solved using branch and bound approach. As for validation, the results of QAPFA are compared with QAP in terms of objective function and running time. The computational results show that the solution quality of QAPFA is lower when compared with the QAP, while the running time for QAPFA is lower than the QAP. Since the complexity of the problem is reduced by fixing the assignment, thus there is possibility that QAPFA has lower quality than QAP due to the fixed assignment. Nevertheless, in terms of running time QAPFA is better than QAP. It can be concluded that this problem reflect the real problem and practical to be used.
This paper presents a real case study pertaining to an issue related to waste collection in the northern part of Malaysia by using a constructive heuristic algorithm known as the Nearest Greedy (NG) technique. This te...
This paper presents a real case study pertaining to an issue related to waste collection in the northern part of Malaysia by using a constructive heuristic algorithm known as the Nearest Greedy (NG) technique. This technique has been widely used to devise initial solutions for issues concerning vehicle routing. Basically, the waste collection cycle involves the following steps: i) each vehicle starts from a depot, ii) visits a number of customers to collect waste, iii) unloads waste at the disposal site, and lastly, iv) returns to the depot. Moreover, the sample data set used in this paper consisted of six areas, where each area involved up to 103 customers. In this paper, the NG technique was employed to construct an initial route for each area. The solution proposed from the technique was compared with the present vehicle routes implemented by a waste collection company within the city. The comparison results portrayed that NG offered better vehicle routes with a 11.07% reduction of the total distance traveled, in comparison to the present vehicle routes.
The objective of this study is to develop learning media by using the computer Based Instruction (CBI) model for GOST algorithm cryptographic material (Gosudarstvennyi Standard). Besides, the study serves to present l...
The objective of this study is to develop learning media by using the computer Based Instruction (CBI) model for GOST algorithm cryptographic material (Gosudarstvennyi Standard). Besides, the study serves to present learning using computer media, especially in the Informatics Engineering study program. The method used in this study uses the Research and Development (R & D) method. The results of this development research are learning media products in the form of tutorial CDs with the contents of the material: GOST Cryptographic Theory, Encryption Process and Decryption process using alphabet text data. Based on the results of the application and testing of the program, it can be concluded that this application is easy to use. Learning the Gost algorithm in the encoding method utilizing the computer Based Instructions (CBI) method helps to understand the material and facilitate the learning process.
暂无评论