Garuda - Garba Rujukan Digital

SOLUSI PERMASALAHAN PHUBBING REMAJA AKIBAT KECANDUAN SMARTPHONE MELALUI PENERAPAN NILAI SIPAKATAU, SIPAKAINGE, SIPAKALEBBI DENGAN ANALISIS MODEL MATEMATIKA DI KOTA MAKASSAR Thaha, Irwan; Oeitama, Whannie Youngger; Badawia, Annisa Nur; Topayung, Monalisa; Nasrul, Muhammad
Proximal: Jurnal Penelitian Matematika dan Pendidikan Matematika Vol. 8 No. 1 (2025): Sains Matematika dan Pendidikan Matematika
Publisher : Universitas Cokroaminoto Palopo

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30605/proximal.v8i1.4739

Phubbing is a social problem caused by various factors, one of which is smartphone addiction. This research aims to build a SEAR mathematical model of phubbing problems among adolescents due to smartphone addiction, analyse and simulate the model to predict the number of phubbing cases in Makassar City, and find parameter solutions to this problem. The population in this study consists of adolescents aged 10-14 years in Makassar City, with a sample size of 399 people. The research stages carried out were: building a SEAR model of the phubbing problem, determining the equilibrium point, analysing the stability of the equilibrium point, determining the value of the basic reproduction number , carrying out model simulations using Maple, and interpreting the simulation results. In this paper, it is obtained a SEAR mathematical model for the problem of phubbing; two equilibrium points, namely the phubbing-free and the phubbing equilibrium point; stability of the phubbing-free and phubbing equilibrium point; and the basic reproduction number 3.459 which shows that phubbing cases occur in adolescents with a percentage increase of 1.3% every year. Based on the model simulation, the results obtained show that the parameter solutions in the form of applying the 3S values can reduce the rate of phubbing due to smartphone addiction among adolescents in Makassar City.

Optimasi Rute Pendistribusian Barang Menggunakan Kombinasi Algoritma Branch and Bound dan Cheapest Insertion Heuristic Oeitama, Whennie Youngger; Oeitama, Whannie Youngger; Sitandi, Flora Frisilia; Mas'ud, Syamsuddin
Square : Journal of Mathematics and Mathematics Education Vol. 6 No. 2 (2024)
Publisher : UIN Walisongo Semarang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21580/square.2024.6.2.22992

The problem that often occurs in the process of distributing goods is that the distribution route is not optimal which results in higher costs and longer travel times. This can be solved by finding the shortest path that can be passed or widely recognized as the Traveling Salesman Problem (TSP). This study aims to determine the optimal distribution route for goods using a combination of the Branch and Bound and Cheapest Insertion Heuristic algorithms. The data used are in the form of location names and distances between locations that have been collected by Putra BJ Bangun in his research entitled Solving the Traveling Salesman Problem (TSP) with the Branch and Bound Method (Application of the Palembang Post Office Goods Transportation Problem). The results of the research indicate that the optimal route for the distribution of goods at the Palembang City Post Office, using a combination of both algorithms, is: KPRK Palembang → KPC Kapt A. Rivai → KPC Pakjo → KPC Talang Ratu → KPC Sukarami → KPC Alang Lebar → KPC Sekip → KPC Cinde → KPRK Palembang, spanning a total of 24.3 km. This route can be an alternative for salesmen to visit several KPCs and return to KPRK, with more efficient costs and time because it is the shortest route. In addition, this combination of algorithms is more efficient and simpler in terms of processing steps and computing time compared to using the Branch and Bound algorithm.Keywords: Traveling Salesman Problem (TSP), Branch and Bound, Cheapest Insertion Heuristic, Algorithm Combination, Optimal.

SOLUSI PERMASALAHAN PHUBBING REMAJA AKIBAT KECANDUAN SMARTPHONE MELALUI PENERAPAN NILAI SIPAKATAU, SIPAKAINGE, SIPAKALEBBI DENGAN ANALISIS MODEL MATEMATIKA DI KOTA MAKASSAR Thaha, Irwan; Oeitama, Whannie Youngger; Badawia, Annisa Nur; Topayung, Monalisa; Nasrul, Muhammad
Proximal: Jurnal Penelitian Matematika dan Pendidikan Matematika Vol. 8 No. 1 (2025): Integrasi Matematika, Teknologi, dan Budaya dalam Pendidikan dan Aplikasi Terap
Publisher : Universitas Cokroaminoto Palopo

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30605/proximal.v8i1.4739

Phubbing is a social problem caused by various factors, one of which is smartphone addiction. This research aims to build a SEAR mathematical model of phubbing problems among adolescents due to smartphone addiction, analyse and simulate the model to predict the number of phubbing cases in Makassar City, and find parameter solutions to this problem. The population in this study consists of adolescents aged 10-14 years in Makassar City, with a sample size of 399 people. The research stages carried out were: building a SEAR model of the phubbing problem, determining the equilibrium point, analysing the stability of the equilibrium point, determining the value of the basic reproduction number , carrying out model simulations using Maple, and interpreting the simulation results. In this paper, it is obtained a SEAR mathematical model for the problem of phubbing; two equilibrium points, namely the phubbing-free and the phubbing equilibrium point; stability of the phubbing-free and phubbing equilibrium point; and the basic reproduction number 3.459 which shows that phubbing cases occur in adolescents with a percentage increase of 1.3% every year. Based on the model simulation, the results obtained show that the parameter solutions in the form of applying the 3S values can reduce the rate of phubbing due to smartphone addiction among adolescents in Makassar City.

Optimasi Rute Pendistribusian Barang Menggunakan Kombinasi Algoritma Branch and Bound dan Cheapest Insertion Heuristic Oeitama, Whennie Youngger; Oeitama, Whannie Youngger; Sitandi, Flora Frisilia; Mas'ud, Syamsuddin
Square : Journal of Mathematics and Mathematics Education Vol. 6 No. 2 (2024)
Publisher : UIN Walisongo Semarang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21580/square.2024.6.2.22992

The problem that often occurs in the process of distributing goods is that the distribution route is not optimal which results in higher costs and longer travel times. This can be solved by finding the shortest path that can be passed or widely recognized as the Traveling Salesman Problem (TSP). This study aims to determine the optimal distribution route for goods using a combination of the Branch and Bound and Cheapest Insertion Heuristic algorithms. The data used are in the form of location names and distances between locations that have been collected by Putra BJ Bangun in his research entitled Solving the Traveling Salesman Problem (TSP) with the Branch and Bound Method (Application of the Palembang Post Office Goods Transportation Problem). The results of the research indicate that the optimal route for the distribution of goods at the Palembang City Post Office, using a combination of both algorithms, is: KPRK Palembang → KPC Kapt A. Rivai → KPC Pakjo → KPC Talang Ratu → KPC Sukarami → KPC Alang Lebar → KPC Sekip → KPC Cinde → KPRK Palembang, spanning a total of 24.3 km. This route can be an alternative for salesmen to visit several KPCs and return to KPRK, with more efficient costs and time because it is the shortest route. In addition, this combination of algorithms is more efficient and simpler in terms of processing steps and computing time compared to using the Branch and Bound algorithm.Keywords: Traveling Salesman Problem (TSP), Branch and Bound, Cheapest Insertion Heuristic, Algorithm Combination, Optimal.

Title

Found 4 Documents
Search

Abstract

Abstract

Abstract

Abstract

Title Search

Found 4 Documents Search

Abstract

Abstract

Abstract

Abstract

Title

Found 4 Documents
Search