In the planning of aggregate production, company stakeholders need a long time due to the many production variables that must be considered so that the production value can meet consumer demand with minimal production costs. The case study is the company that produces more than a type of product so there are several variables must be considered and computational time is required. Genetic Algorithm is applied as they have the advantage of searching in a solution space but are often trapped in locally optimal solutions. In this study, the authors proposed a new mathematical model in the form of a fitness function aimed at assessing the quality of the solution. To overcome this local optimum problem, the authors refined it by combining the Genetic Algorithm and Simulated Annealing so called hybrid approach. The function of Simulated Annealing is to improve every solution produced by Genetic Algorithm. The proposed hybrid method is proven to produce better solutions.

In doing travel to some destinantions, tourist certainly want to be able to visit many destinations with the optimal scheduling so that necessary in finding the best route and not wasting lots of time travel. Several studies have addressed the problem but does not consider other factor which is very important that is the operating hours of each destination or hereinafter referred as the time window. Genetic algorithm proved able to resolve this travelling salesman problem with time window constraints. Based on test results obtained solutions with the fitness value of 0,9856 at the time of generation of 800 and the other test result obtained solution with the fitness value of 0,9621 at the time of the combination CR=0,7 MR=0,3.

<p class="Text"><strong><span lang="EN-US">The route of the travel tour packages offered by travel agents is not considered optimum, so the level of satisfaction the tourist is not maximal. Selection of the route of the travel packages included in the traveling salesman problem (TSP). The problem that occurs is uncertain tourists visiting destinations at the best destinations timing hereinafter be referred to as the fuzzy time window problem. Therefore, the authors apply the genetic algorithm to solve the problem. Based on test results obtained optimum solution with the fitness value of 1.3291, a population size of 100, the number of generations of 1000, a combination of CR=0,4 and MR=0.6.</span></strong></p>

Production planning is a plan aimed at controlling the quantity of products produced. Production planning is very important to be carried out by the company so that the production will always be controlled. It is very difficult to plan production with a variety of product variations because each product certainly has a different demand value from its customers. This has become a complex problem so an algorithm is needed to overcome these problems. Simulated Annealing can produce optimal solutions more effectively and efficiently. Production costs generated by applying Simulated Annealing are Rp. 6,902,406,000, - for all types of products, which is better than existing condition.

Aggregate planning is a crucial stage in the production process because it supports other processes. Careless production planning may cause production costs to spike sharply that hurts the company financially. This study explores the novel usage of particle swarm optimization (PSO) to discover a set of solutions among the objective of a multi-optimization problem in aggregate production planning. The study uses a small home textile industry with complex production processes of school uniforms as a case study. The results show that the production cost difference between actual data and the proposed method is IDR330,670,000. Thus, PSO can solve the multi-site aggregate planning by reducing the company production cost.

<p><em>In the field of textile industry, the distribution process is an important factor that can affect the cost of production. For that we need optimization on the distribution process to be more efficient. This problem is a model in the Multi Trave</em><em>l</em><em>ling Salesman Problem (M-TSP). Much research has been done to complete the M-TSP model. Among several methods that have been applied by other researchers, genetic algorithms are a workable method for solving this model problem. In this article the authors chose the genetic algorithm is expected to produce an optimal value with an efficient time. Based on the results of testing and analysis, obtained the optimal population amount of 120. For the optimal generation amount is 800. The test results related to the number of population and the number of generations are used as input to test the combination of CR and MR, obtained the optimal combination of CR = 0 , 4 and MR = 0.6 with a fitness value of 2.9964.</em></p><p><em><strong>Keywords</strong></em><em>: Textile Industry, Multi Travelling Salesman Problem (M-TSP), Genetic Algorithm</em></p><p><em>Pada bidang industri tekstil, proses distribusi merupakan satu faktor penting yang dapat berpengaruh terhadap biaya produksi. Untuk itu diperlukan optimasi pada proses distribusi agar menjadi lebih efisien. Masalah seperti ini merupakam model dalam Multi Travelling Salesman Problem (M-TSP). Banyak penelitian telah dilakukan untuk menyelesaikan model M-TSP. Diantara beberapa metode yang telah diterapkan oleh peneiti lain, algoritma genetika adalah metode yang bisa diterapkan untuk penyelesaian permasalahan model ini. Dalam artikel ini penulis memilih algoritma genetika diharapkan dapat menghasilkan nilai yang optimal dengan waktu yang efisien. Berdasarkan hasil pengujian dan analisis, didapatkan jumlah populasi yang optimal sebesar 120. Untuk jumlah generasi yang optimal adalah sebesar 800. Hasil pengujian terkait jumlah populasi dan jumlah generasi tersebut dijadikan masukan untuk melakukan pengujian kombinasi  CR dan MR, didapatkan kombinasi yang optimal yakni CR=0,4 dan MR=0,6 dengan nilai fitness sebesar 2,9964.</em></p><p><em><strong>Kata kunci</strong></em><em>: </em><em>Industri Tekstil, Distribusi, Multi Travelling Salesman Problem (M-TSP), Algoritma Genetika</em></p>

According to health reports of Malang city, many people are exposed to sexually transmitted diseases and most sufferers are not aware of the symptoms. Malang city being known as a city of education so that every year the population number increases, it is at risk of increasing the spread of sexually transmitted diseases virus. This problem is important to be solved to treat earlier sufferers sexually transmitted diseases virus in order to reduce the burden of patient spending. In this research, authors conduct data mining methods to classifying sexually transmitted diseases. From the experiment result shows that K-NN is the best method for solve this problem with 90% accuracy.

Abstract—Recently computer networks are increasingly complex. It needs to be a supporting device for network management such as a router. Router is a device that plays an important role in the routing process. In a router stored information in the form of routing paths, where the information includes data and which routers will be passed. In certain cases, a router can have more than one gateway. This is because the router needs to send data packets to several networks that have different segments. Such cases can be handled by using the appropriate routing path selection rules. The routing problem can be regarded as a traveling salesman problem (TSP), where a mechanism is needed to determine the shortest route to be traversed. The author implements the Simulated Annealing Algorithm because it can produce an optimal solution with light computing, so that the routing process can be more effective and efficient. Index Terms—Computer Network, Routing, Simulated Annealing, Travelling Salesman Problem Abstrak–-Jaringan komputer saat ini semakin kompleks. Perlu adanya suatu perangkat pendukung untuk manajemen jaringan seperti router. Router merupakan perangkat yang berperan penting dalam proses routing. Pada sebuah router tersimpan informasi berupa jalur routing, dimana informasi tersebut mencakup data dan router mana saja yang akan dilewati. Pada kasus tertentu, router dapat memiliki lebih dari satu gateway. Hal ini disebabkan karena router perlu mengirimkan paket data ke beberapa jaringan yang memiliki segmen berbeda. Kasus tersebut dapat ditangani dengan menggunakan aturan pemilihan jalur routing yang tepat. Permasalahan routing dapat dikatakan sebagai suatu permasalahan travelling salesman problem (TSP), dimana diperlukan suatu mekanisme dalam menentukan rute terpendek untuk dilalui. Penulis mengimplementasikan Algoritma Simulated Annealing karena dapat menghasilkan solusi yang optimal dengan komputasi ringan, sehingga proses routing dapat lebih efektif dan efisien. Kata Kunci—Jaringan Komputer, Penentuan Rute, Travelling Salesman Problem, Algoritma Simulated Annealing