Claim Missing Document
Check
Articles

Found 3 Documents
Search
Journal : JTAM (Jurnal Teori dan Aplikasi Matematika)

Simulated Annealing Algorithm for Determining Travelling Salesman Problem Solution and Its Comparison with Branch and Bound Method Bib Paruhum Silalahi; Farahdila Sahara; Farida Hanum; Hidayatul Mayyani
JTAM (Jurnal Teori dan Aplikasi Matematika) Vol 6, No 3 (2022): July
Publisher : Universitas Muhammadiyah Mataram

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.31764/jtam.v6i3.8481

Abstract

Travelling Salesman Problem (TSP) is a problem where a person must visit some places, starting from one city and then moving on to the next city with the conditions that the places visited can only be passed precisely once and then back to the starting city. TSP is an NP-hard, an important problem in operations research. TSP problems can be solved by an exact method or an approximation method, namely the metaheuristic method. This research aims to solve the TSP problem with an approximation method called the Simulated Annealing (SA), and then compare the results of this approximation method with the exact Branch and Bound method. The results indicated that the SA method could accomplish TSP problems. However, like other metaheuristic methods, SA only accomplishes it using an approach to get good results. Still, it cannot be determined that SA has the most optimal results, but the time needed by the SA method is faster than the Branch and Bound method. In case I, the percentage difference between the distance generated using the SA method with the B-and-B method is 0%, in case II it is 7% and in case III it is 8%.  
Asymptotic Distribution of an Estimator for Variance Function of a Compound Periodic Poisson Process with Power Function Trend Muhammad Wiranadi Utama; I Wayan Mangku; Bib Paruhum Silalahi
JTAM (Jurnal Teori dan Aplikasi Matematika) Vol 6, No 4 (2022): October
Publisher : Universitas Muhammadiyah Mataram

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.31764/jtam.v6i4.10213

Abstract

In this paper, an asymptotic distribution of the estimator for the variance function of a compound periodic Poisson process with power function trend is discussed. The periodic component of this intensity function is not assumed to have a certain parametric form, except it is a periodic function with known period. The slope of power function trend is assumed to be positive, but its value is unknown. The objectives of this research are to modify the existing variance function estimator and to determine its asymptotic distribution. This research begins by modifying the formulation of the variance function estimator. After the variance function is obtained, the research is continued by determining the asymptotic distribution of the variance function estimator of the compound periodic Poisson process with a power function trend. The first result is modification of existing estimator so that its asymptotic distribution can be determined. The main result is asymptotic normality of the estimator of variance function of a compound periodic Poisson process with power function trend.
Pattern Generation for Three Dimensional Cutting Stock Problem Mutia Atika; Bib Paruhum Silalahi; Fahren Bukhari
JTAM (Jurnal Teori dan Aplikasi Matematika) Vol 6, No 4 (2022): October
Publisher : Universitas Muhammadiyah Mataram

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.31764/jtam.v6i4.9933

Abstract

We consider the problem of three-dimensional cutting of a large block that is to be cut into some small block pieces, each with a specific size and request. Pattern generation is an algorithm that has been used to determine cutting patterns in one-dimensional and two-dimensional problems. The purpose of this study is to modify the pattern generation algorithm so that it can be used in three-dimensional problems, and can determine the cutting pattern with the minimum possible cutting residue. The large block will be cut based on the length, width, and height. The rest of the cuts will be cut back if possible to minimize the rest. For three-dimensional problems, we consider the variant in which orthogonal rotation is allowed. By allowing the remainder of the initial cut to be rotated, the dimensions will have six permutations. The result of the calculation using the pattern generation algorithm for three-dimensional problems is that all possible cutting patterns are obtained but there are repetitive patterns because they suggest the same number of cuts.