Article Per Year (5 Year)
p-Index From 2020 - 2025
0.659
P-Index
This Author published in this journals
All Journal Jurnal Ilmu Dasar JMPM: Jurnal Matematika dan Pendidikan Matematika Specta Journal of Technology Majalah Ilmiah Matematika dan Statistika (MIMS) Kesatria : Jurnal Penerapan Sistem Informasi (Komputer dan Manajemen)
Pancahayani, Sigit
Unknown Affiliation
Chemical Engineering, Chemistry & Bioengineering Civil Engineering, Building, Construction & Architecture Computer Science & IT Control & Systems Engineering Education Electrical & Electronics Engineering Environmental Science Mathematics

Published : 5 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 5 Documents
Search

 1 
Estimasi Kelajuan dan Volume Kendaraan Berdasarkan Model Makroskopik Arus Lalu Lintas Jalan Tol dengan Metode Extended Kalman Filter Prihatiningsih, Febriana; Pancahayani, Sigit; Subchan, Subchan
SPECTA Journal of Technology Vol 2 No 2 (2018): SPECTA Journal of Technology
Publisher : LPPM ITK

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35718/specta.v2i2.105

Abstract

In this thesis, the analysis of vehicles' determination of speed and volume in the traffic flow will be discussed by approach time. The analyzation of vehicles' speed and volume done by estimated on macroscopic term of traffic flow in the traffic jam with Extended Kalman Filter (EKF) method. The term of macroscopic views with measured the traffic variable by density the flow rate the flow rate of vehicle and also the vehicle speed's average. In the estimating process, forward difference scheme is implemented to the model and error are measured by Root Mean Square Error. The result showed that the estimation the average of the vehicle?s relative speed in a segment decreased when its volume of vehicle is increased and vice versa.
MODEL MATEMATIKA MENGENAI KESADARAN MASYARAKAT DALAM PERILAKU HIDUP BERSIH DAN SEHAT DI KOTA SAMARINDA Pancahayani, Sigit; Arti, Rissa Putri; Fitria, Irma; Subchan, Subchan
Majalah Ilmiah Matematika dan Statistika Vol 20 No 2 (2020): Majalah Ilmiah Matematika dan Statistika
Publisher : Jurusan Matematika FMIPA Universitas Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/mims.v20i2.19647

Abstract

Samarinda is one of the big city in Kalimantan since it is a capital city of East Kalimantan Province. Its population is about 988,943 in 2015, but only 28.62 percent of the whole households were applying clean and healthy living behavior. To encourage this behavior to the society, it needs some health promotions to be introduced to them. In order to know the pattern of clean and healthy behaving households with respect to time, so this research is aimed to perform a mathematical model of the implementation of clean and healthy living behavior which involves health promotion. Runge-Kutta is the used model to solve this model. The result informs that the rate of change of the households which implement a clean and healthy life, called as good people, increases for all sub-districts in Samarinda City. In contrast, households that do not know and do not behave clean and healthy life, called as bad people, are reduced because of the promotion. Keywords: clean and healthy living behavior, health promotion, modeling mathematics.
A C3 Magic Decomposition on Friendship Graph with Odd Order Nisa, Indah Chairun; Pancahayani, Sigit; Soemarsono, Annisa Rahmita
Jurnal ILMU DASAR Vol 23 No 1 (2022)
Publisher : Fakultas Matematika dan Ilmu Pengetahuan Alam Universitas Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/jid.v23i1.23266

Abstract

Let G = (V,E) is graph with a non-empty set V containing vertices and a set of edges E. Also note that if H = {H_i⊆G_i = 1,2,3,...,n} is a collection of subgraphs from G with H_i≅Hj,i ≠ j. If Hi ∩ Hj = ∅ and ⋃n(i-1)Hi = G, then graph G admits a decomposition H. Furthermore, if there are f(v) and g(e) which are vertices and edges labeling at G, the total weight of each subgraph H_i,i = 1,2,3,…,n has the same value, namely ∑_(v∈V(H_i))▒〖f(v)〗+∑_(e∈E(H_i))▒〖g(e)〗= w, then the graph G contains the magic H_i decomposition with w as the magic constant. This research shows that the friendship graph F_n with n = 2k + 1 for k∈N admits a magic -(a,d)-C_3 decomposition with a magic constant w of 29dk + 6a + 15d.
Penerapan Algoritma Genetika Untuk Mencari Optimasi Kasus TSP Pada 20 Gerai Indomart Rosanti, Yerika Puspa; Triana, Iwel; Pancahayani, Sigit
Kesatria : Jurnal Penerapan Sistem Informasi (Komputer dan Manajemen) Vol 5, No 3 (2024): Edisi Juli
Publisher : LPPM STIKOM Tunas Bangsa

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30645/kesatria.v5i3.423

Abstract

In the delivery of a package, goods, and conducting business, location is a crucial factor to manage. A common issue is the late arrival of packages because delivery couriers cannot find the fastest or most efficient route. This study aims to apply a genetic algorithm to optimize the traveling salesman problem (TSP) for the distribution of goods to 20 Indomaret outlets in the Dago area of Bandung City. TSP is a classic optimization problem that seeks to find the shortest route that visits each city once and returns to the origin city. The genetic algorithm, as a population-based search and optimization method, is used due to its capability to find near-optimal solutions for complex and large problems. This algorithm leverages natural selection mechanisms such as selection, crossover, and mutation to develop solutions from one generation to the next. Initial parameters were set with a population of 100 and a maximum of 500 generations to increase the variety of solutions without taking too much time. The fitness value was obtained by taking the negative of the total distance traveled, and after the iteration process, an optimal result with a fitness value of -0.10 was achieved. It only took 50 seconds to run 500 generations for selecting the distribution route of 20 Indomaret outlets.
Dekomposisi Super Ajaib Berbentuk Lintasan Dari Amalgamasi Graf Siklus Pancahayani, Sigit
JMPM: Jurnal Matematika dan Pendidikan Matematika Vol 2 No 2: September
Publisher : Prodi Pendidikan Matematika Universitas Pesantren Tinggi Darul Ulum Jombang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26594/jmpm.v2i2.905

Abstract

Misalkan  adalah graf sederhana, berhingga, dan terhubung yang diperoleh dengan melekatkan  buah graf siklus berukuran  pada sebuah titik tetap  sebagai terminalnya. Jika  adalah subgraf dari , maka  dikatakan memuat dekomposisi  super ajaib jika terdapat koleksi subgraf dari , yaitu  yang memenuhi untuk setiap berlaku jika  dan , fungsi bijeksi , dan sehingga setiap subgraf memiliki bobot yang sama sebesar , sebagai konstanta ajaib. Pada penelitian ini, digunakan multiset dengan konsep keseimbangan  untuk menunjukkan bahwa memuat dekomposisi  super ajaib.
Co-Authors Arti, Rissa Putri Fitria, Irma Nisa, Indah Chairun Prihatiningsih, Febriana Rosanti, Yerika Puspa Soemarsono, Annisa Rahmita Subchan, Subchan Triana, Iwel