cover
Contact Name
Irpan Adiputra pardosi
Contact Email
irpan@mikroskil.ac.id
Phone
+6282251583783
Journal Mail Official
sinkron@polgan.ac.id
Editorial Address
Jl. Veteran No. 194 Pasar VI Manunggal,
Location
Kota medan,
Sumatera utara
INDONESIA
Sinkron : Jurnal dan Penelitian Teknik Informatika
ISSN : 2541044X     EISSN : 25412019     DOI : 10.33395/sinkron.v8i3.12656
Core Subject : Science,
Scope of SinkrOns Scientific Discussion 1. Machine Learning 2. Cryptography 3. Steganography 4. Digital Image Processing 5. Networking 6. Security 7. Algorithm and Programming 8. Computer Vision 9. Troubleshooting 10. Internet and E-Commerce 11. Artificial Intelligence 12. Data Mining 13. Artificial Neural Network 14. Fuzzy Logic 15. Robotic
Articles 1,196 Documents
COMPARISON OF LASSO AND ADAPTIVE LASSO METHODS IN IDENTIFYING VARIABLES AFFECTING POPULATION EXPENDITURE Rahayu, Atika; Husein, Ismail
Sinkron : jurnal dan penelitian teknik informatika Vol. 7 No. 3 (2023): Article Research Volume 7 Issue 3, July 2023
Publisher : Politeknik Ganesha Medan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33395/sinkron.v8i3.12558

Abstract

Abstract: Since 2019, the difference in the increase in per capita expenditure of the population has continued to decline, and the most significant was only IDR 18,464 in 2021, indicating that the level of consumption of the population has not improved significantly, and the turnover of the community's economy is also not good. Multiple linear regression is more appropriate than other types of linear regression because it considers the influence of more than one independent variable on the dependent variable. However, problems may arise in the use of multiple linear regression, such as multicollinearity. To overcome this problem, other methods such as LASSO and adaptive LASSO should be used. Both methods have the ability to overcome multicollinearity between independent variables, thereby reducing the risk of misestimation. Nevertheless, the LASSO and Adaptive LASSO methods have differences in selecting important variables, so it is necessary to compare which method is better in terms of identifying influential variables. Based on the MSE and R-square comparison values, it is concluded that the Adaptive LASSO method model is the best model with a lower MSE value and a higher R-square value of 93%. The variable selection results of the Adaptive LASSO model are population size, number of households, average number of household members, constant price GDP, confirmed cases of COVID-19, human development index, percentage of the poor population, university student participation rate, and open unemployment rate.
Cocoa price prediction in North Sumatra using Singular Spectrum Analysis (SSA) Algorithm Fransiska, Sintia; Husein, Ismail
Sinkron : jurnal dan penelitian teknik informatika Vol. 7 No. 3 (2023): Article Research Volume 7 Issue 3, July 2023
Publisher : Politeknik Ganesha Medan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33395/sinkron.v8i3.12559

Abstract

The implementation of agricultural development is basically aimed at increasing the welfare of the people, especially farmers, providing a source of foreign exchange through exports, supplying food and industrial raw materials, alleviating poverty, providing employment and improving people's income. Cocoa is a leading commodity which is a source of income for farmers in North Sumatra. Price fluctuations sometimes make farmers suffer losses, so it is necessary to make a cocoa price prediction to anticipate future losses. This study aims to determine the prediction results of cocoa prices in North Sumatra in 2023 and the accuracy of the method used. The results of the study obtained the prediction of cocoa prices in North Sumatra Province in 2023 using the Singular Spectrum Analysis (SSA) method from January to December, respectively, Rp. 34876 in January, February prediction of Rp. 33967, March prediction of Rp. 33446, in April RP 33725, prediction in May of Rp. 33986, prediction in June of Rp 33916, in July Rp. 34196, predictionin August of Rp. 34841, prediction in September of Rp. 35228, in October of Rp. 3479, in November Rp 344517, the December prediction is Rp 34770 with a prediction accuracy level based on the standard MAPE value of 0.96%. The MAPE value obtained indicates that the SSA approach with Windows length 18 and 14 groups is very accurate for prediction cocoa price in North Sumatra Province because it is less than 10% and close to 0%.
Modelling of Subject Scheduling Systems Using Hybrid Artificial Bee Colony Algorithm Lingga, Sri Wahyuni; Sutarman; Darnius, Open
Sinkron : jurnal dan penelitian teknik informatika Vol. 7 No. 3 (2023): Article Research Volume 7 Issue 3, July 2023
Publisher : Politeknik Ganesha Medan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33395/sinkron.v7i3.12560

Abstract

A common schedule problem found in colleges is the positioning of courses in a certain space and time. This placement process often encounters barriers that must be met so that there is no imbalance in the school schedule. One of the problems that often arise is the placement of class capacity that does not match the course requirements. In this study, the researchers used the Artificial Bee Colony Hybrid Algorithm (HABC) to construct course schedules efficiently at the college. The objective of the research was to develop a course scheduling system using the HABC algorithm by combining the Engineering of Artificial Bee Colony (ABC) and genetic algoritms, especially on the crossover process to better address the schedule problems. The research procedure used is to design and implement a course scheduling system using the Hybrid ABC algorithm. The results of the research demonstrate that the Hybrid ABC algorithm is effective in generating optimal course schedule schedules, in line with time limits, room needs, and lecturer requirements and can automate course schedule processes, saving time and resources, while ensuring optimal schedules.
DEVELOPMENT OF INDEPENDENT TAEKWONDO TRAINING MACHINE LEARNING WITH 3D POSE MODEL MEDIAPIPE Santoso, Billy Cahyo; Santoso, Handri; Sandjaya, Julio
Sinkron : jurnal dan penelitian teknik informatika Vol. 7 No. 3 (2023): Article Research Volume 7 Issue 3, July 2023
Publisher : Politeknik Ganesha Medan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33395/sinkron.v8i3.12571

Abstract

Taekwondo is a martial art that focuses on punching and kicking movements while upholding the values of discipline, ethics, and good behavior. Discipline is built with routine training to make someone proficient in taekwondo martial arts. Training cannot be carried out flexibly because it must be accompanied by a sabouem to know the correct taekwondo movements. Machine learning can be used as a solution for taekwondo movement recognition by building a learning machine model that recognizes the correct taekwondo movement. The MediaPipe framework has the advantage of being able to recognize human posture with 33 points or landmarks. The research was carried out by conducting a literature study, where similar research was found but only based on the values of the x and y axes. So a problem arises where the majority of taekwondo movements require the z axis to know the correct taekwondo movements. The research was conducted to add z-axis values and change calculations, which were adjusted to reconstruct a training data object in the form of an image into a three-dimensional shape. From this study, it was found that machine learning using the x, y, and z axes is much better for its use, especially when detecting taekwondo movements from different viewpoints from the training data. This research can be developed by enlarging the image dataset and packaging the model into a mobile application so that it can be used for taekwondo training up to taekwondo movement assessment.
Optimization Model for Electric Vehicle Routing Problem with Two Charging Options Br Ginting, Emmita; Gultom, Parapat; Sutarman, Sutarman
Sinkron : jurnal dan penelitian teknik informatika Vol. 7 No. 3 (2023): Article Research Volume 7 Issue 3, July 2023
Publisher : Politeknik Ganesha Medan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33395/sinkron.v8i3.12577

Abstract

The use of electric vehicles recently is an alternative way to lower pollutants and the emissions of carbon dioxide resulting from the usage of motor vehicle fuel oil. The limited battery capacity of this electric vehicle is a problem for its users. Vehicle routing problem (VRP) is a problem of integer programming and combinatorial optimization that is frequently used in planning and decision-making processes. One application of this issue is to find the best path for delivering items from a corporation to customers. VRP problems are frequently utilized in order to reduce internal expenditure. Model optimization in this paper uses two rehcarging options, recharging and swapping battery. The purpose of this paper is to present a VRP optimization model for electric vehicle routing problems to find the best route option that minimizes the total of the fees for fixed vehicles, transit, charging, battery changing, and waiting.
Integer Linear Programming Model for Multicast Routing to Minimize Link Cost at Wavelengths Fitria, Rizka; Suwilo, Saib; Rosmaini, Elly
Sinkron : jurnal dan penelitian teknik informatika Vol. 7 No. 3 (2023): Article Research Volume 7 Issue 3, July 2023
Publisher : Politeknik Ganesha Medan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33395/sinkron.v8i3.12591

Abstract

Routing is a technique or process carried out in a packet or information delivery system from a source to a destination or a place that requests the information needed from a source. Routing is done in solving a problem and is well-known is unicast routing. Unicast routing can transmit information from a source to a single destination. However, this is ineffective for an infinite number of requests to be served because the unicast routing system only funnels one destination to one source. So that another route is needed that can handle this, this route is called a multicast route. Multicast routing that can serve multiple destinations with only one source so that a collection of destinations to get the same request in the same time and data. This research will discuss multicast routing to minimize link costs at wavelengths using a hierarchical structure. To help provide reduction or savings on the link by offering an integer linear programming model formulation to minimize link costs at wavelengths. An update from previous studies is to use a hierarchical structure with wavelength conversion taking into account the links that are traversed and the requests that will be served by the source to the destination. Using wavelength conversion so that there are no wavelength continuity problems, so that when sending information you get more path choices and you can save on sending information using a link that will be passed from the source to the intermediate node until it reaches the destination node, with this it will find a path more efficiently so that the goal of minimizing link cost at wavelengths on multicast routing is achieved
A Mathematical Model of Diet Menu Problem Based on Boolean Linear Programming Approach Harahap, Latifah Hanum; Nasution, Mahyuddin K. M.; Sawaluddin, Sawaluddin
Sinkron : jurnal dan penelitian teknik informatika Vol. 7 No. 3 (2023): Article Research Volume 7 Issue 3, July 2023
Publisher : Politeknik Ganesha Medan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33395/sinkron.v8i3.12592

Abstract

This study aims to model the diet menu problem based on a Boolean Linear Programming approach. A balanced diet is the key to a healthy lifestyle. A balanced diet is a diet that combines foodstuffs in the right amount of food components in one menu (dishes using certain recipes). When you have an unbalanced diet, your body will not get the right amount of nutrients. This is what causes the importance of managing the diet menu. Because of that, a diet menu problem model was formed based on the Boolean Linear Programming approach to cover a varied range of daily diet menu management and meet daily nutritional needs while minimizing costs. The stages of establishing the diet menu problem model are carried out by determining the notations, parameters, variables, objective functions, and some constraints related to the diet menu.
Capacitated Vehicle Routing Problem In Optimization Of Waste Truck Routes Using The Particle Swarm Optimization Algorithm Rambe, Siti Rahmi; Rakhmawati, Fibri
Sinkron : jurnal dan penelitian teknik informatika Vol. 7 No. 3 (2023): Article Research Volume 7 Issue 3, July 2023
Publisher : Politeknik Ganesha Medan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33395/sinkron.v8i3.12595

Abstract

In this research process, the aim is to determine the shortest route for transporting waste with the shortest or minimum total distance. In this case, what must be considered is the transportation of waste, regarding the distance between the location of the waste source to the landfills. The problem of waste transportation routes can be made in a mathematical method. The method used in waste transportation is the Capacitated Vehicle Routing Problem (CVRP) method. In solving the problem of transporting waste using the CVRP method, distance must be minimized or optimized using the Particle Swarm Optimization Algorithm. On the initial route of work area 1 there is the o-p-q-r-s-o route which has a total distance of 133.5 Km, in which there are several villages such as the Mambang Muda TPA - Belungihit Village - Aek Hitetoras Village - Brussel Plantation Village - Aek Tapa Village - Mambang Muda TPA. And after the latest garbage transportation route uses the PSO algorithm, the optimal distance is 132.5 Km with the o-s-q-r-p-o route where the village is Mambang Muda TPA - Aek Tapa Village - Aek Hitetoras Village - Brussels Plantation Village - Belungihit Village - Mambang Muda Landfill. In WK 2 there is an initial route o-p-q-r-s-o which has a total distance of 153.9 Km, in which the route has several TPA Mambang Muda villages - Marbau Village - Lobu Rampah Village - Simpang 4 Village - Pernantian Plantation Village - Mambang Muda TPA. And after the latest garbage transportation route uses the PSO algorithm, the optimal distance and route is 127.7 Km. In work area 3 with the initial route and distance of 150 and after using the PSO algorithm, the optimal route and distance is 137.1 Km. In work area 4 with a route and distance of 127.8 Km, the optimal route and distance using the PSO algorithm is 149.8 Km. Work area 4 has a route and initial distance of 157.8 Km and the optimal PSO route and distance is 149.8. The 5th working area has an initial distance of 180.3 and the PSO route is 134.3 Km. The working area of ​​the 5 initial routes is 152.4 Km and the PSO route is 152.4.
Mathematical Model for Vehicle Routing and Scheduling with Forward and Reverse Logistics Resti, Lady Ichwana; Mawengkang, Herman; Rosmaini, Elly
Sinkron : jurnal dan penelitian teknik informatika Vol. 7 No. 3 (2023): Article Research Volume 7 Issue 3, July 2023
Publisher : Politeknik Ganesha Medan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33395/sinkron.v8i3.12599

Abstract

Companies usually use cross-docking to reduce logistics costs. The product delivery process from suppliers to retailers and vice versa is facilitated by crossdocking facilities. One of important problem in crossdocking is vehicle routes. In this work we discuss about cross-docking problem for vehicle routes which is brought into the form of an integration model. We also present the strategy to handle the forward and reverse logistics. From this strategy we have a NP-hard mathematical model as the result.
Inventory Model for Order Quantity Optimization with Partial Backlogging on Greater Demand at The Beginning Aritonang, Reanty Teresa; Darnius, Open; Sutarman, Sutarman
Sinkron : jurnal dan penelitian teknik informatika Vol. 7 No. 3 (2023): Article Research Volume 7 Issue 3, July 2023
Publisher : Politeknik Ganesha Medan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33395/sinkron.v8i3.12600

Abstract

This article discusses the model of inventory with greater demand at the beginning which allows shortages. During the shortage period, it is assumed that there is a backlogged demand, and the remainder is considered lost sales. This research is completed by using the deterministic inventory model method, namely the EOQ model. The result of using the EOQ method is to determine the inventory lot size and length, with the goal of minimizing the total cost of inventory and generating maximum profits related to the inventory model. An numerical example is given to show the use of this model.

Page 64 of 120 | Total Record : 1196


Filter by Year

2016 2025


Filter By Issues
All Issue Vol. 9 No. 4 (2025): Articles Research October 2025 Vol. 9 No. 3 (2025): Article Research July 2025 Vol. 9 No. 2 (2025): Research Articles April 2025 Vol. 9 No. 1 (2025): Research Article, January 2025 Vol. 8 No. 4 (2024): Article Research Volume 8 Issue 4, October 2024 Vol. 8 No. 3 (2024): Research Artikel Volume 8 Issue 3, July 2024 Vol. 8 No. 2 (2024): Article Research Volume 8 Issue 2, April 2024 Vol. 8 No. 1 (2024): Articles Research Volume 8 Issue 1, January 2024 Vol. 7 No. 4 (2023): Article Research Volume 7 Issue 4, October 2023 Vol. 7 No. 3 (2023): Article Research Volume 7 Issue 3, July 2023 Vol. 7 No. 2 (2023): Research Article, Volume 7 Issue 2 April, 2023 Vol. 7 No. 1 (2023): Articles Research Volume 7 Issue 1, 2023 Vol. 6 No. 4 (2022): Article Research: Volume 6 Number 4, October 2022 Vol. 6 No. 3 (2022): Article Research Volume 6 Number 3, July 2022 Vol. 6 No. 2 (2022): Articles Research Volume 6 Issue 2, April 2022 Vol. 6 No. 1 (2021): Article Research Volume 6 Issue 1: January 2021 Vol. 5 No. 2 (2021): Article Research Volume 5 Number 2, April 2021 Vol. 5 No. 2B (2021): Article Research October 2021 Vol 4 No 2 (2020): SinkrOn Volume 4 Number 2, April 2020 Vol. 5 No. 1 (2020): Article Research, October 2020 Vol. 4 No. 1 (2019): SinkrOn Volume 4 Number 1, October 2019 Vol. 3 No. 2 (2019): SinkrOn Volume 3 Number 2, April 2019 Vol 3 No 2 (2019): SinkrOn Volume 3 Number 2, April 2019 Vol. 3 No. 1 (2018): SinkrOn Volume 3 Nomor 1, Periode Oktober 2018 Vol 3 No 1 (2018): SinkrOn Volume 3 Nomor 1, Periode Oktober 2018 Vol. 2 No. 2 (2018): SinkrOn Volume 2 Nomor 2 April 2018 Vol. 2 No. 1 (2017): SinkrOn Volume 2 Nomor 1 Oktober 2017 Vol. 1 No. 2 (2017): SinkrOn Volume 1 Nomor 2 April 2017 Vol. 1 No. 1 (2016): SinkrOn Oktober Volume 1 Edisi 1 Tahun 2016 More Issue