Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : Tensor: Pure and Applied Mathematics Journal

Penerapan Jaringan Saraf Tiruan Learning Vector Quantization Untuk Pemetaan Wilayah Berpenduduk Miskin di Provinsi Maluku Dorteus Lodewyik Rahakbauw; Venn Yan Ishak Ilwaru
Tensor: Pure and Applied Mathematics Journal Vol 1 No 1 (2020): Tensor : Pure And Applied Mathematics Journal
Publisher : Department of Mathematics, Faculty of Mathematics and Natural Sciences, Pattimura University, Ambon, Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30598/tensorvol1iss1pp25-30

Abstract

Badan Pusat Statistik (BPS) stated that the number of poor people in Indonesia reached 28.01 million people based on data as of March 2016. This figure is around 10.86 percent of the national population. Province of Maluku as the third poor contributor of all provinces in Indonesia reached 27.74 percent. Note that, there are 8 of total 11 districts/cities in Maluku which are determined as underdeveloped regions (Kementerian PDT, 2015), Maluku Barat Daya (MBD) is one of them. Based on data from BPS, in 2014 the percentage of poor people in district of MBD reached 28.33 percent being the second highest district in Maluku after Maluku Tenggara Barat (MTB). It is quite difficult make the poverty level of MBD lower, due to a large number of villages in MBD have some economic access isolations because of geographical conditions. Various programs and policies in social and health have been done to solve this poverty problem, but still could not overcome this problem yet. In this paper we have grouped the districts/cities of Maluku based on poverty factors using Learning Vector Quantization (LVQ) method. The results of this research showed that there are 5 poverty clusters in Maluku. Those are: Cluster 1 consists of Maluku Tenggara Barat, Maluku Utara dan Buru; cluster 2 consists of Maluku Tengah; cluster 3 consists of Kep. Aru, Seram Bagian Barat dan Seram Bagian Timur, cluster 4 consists of Maluku Barat Daya dan Buru Selatan; and cluster 5 consists of Ambon and Tual. Each cluster describes the poverty level with respect to its Partition matrix respectively. The results that we obtained also show that cluster 4 has the highest poverty level.
Optimization of Assignment Problems using Hungarian Method at PT. Sicepat Express Ambon Branch (Location: Java City Kec. Ambon Bay) Ardial Meik; Venn Yan Ishak Ilwaru; Monalisa E. Rijoly; Berny Pebo Tomasouw
Tensor: Pure and Applied Mathematics Journal Vol 3 No 1 (2022): Tensor: Pure and Applied Mathematics Journal
Publisher : Department of Mathematics, Faculty of Mathematics and Natural Sciences, Pattimura University, Ambon, Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30598/tensorvol3iss1pp23-32

Abstract

One of the special cases of problems in linear programming that is often faced by a company in allocating its employees according to their abilities is the assignment problem. The assignment problem can be solved using the Hungarian Method. In applying the Hungarian method, the number of employees assigned must be equal to the number of jobs to be completed. In this study, the Hugarian method was used to optimize the delivery time of goods from PT. SiCepat Express Ambon Branch – Java City. To solve the assignment problem at PT. SiCepat Express Ambon Branch – Java City, the required data includes employee names, destination locations, and delivery times. Before using the Hungarian method, the total delivery time of 7 employees at 10 destinations is 955 minutes. However, after using the Hungarian method, the total delivery time of 7 employees at 10 destination locations was 440 minutes. It can be seen that there are 515 minutes of time effisiency. We also Solved this assignment problem uses the QM For Windows Version 5.2 software and go the same amount of time, which is 440 minutes.