Garuda - Garba Rujukan Digital

p-Index From 2021 - 2026

2.887

P-Index

This Author published in this journals

All Journal MATICS : Jurnal Ilmu Komputer dan Teknologi Informasi (Journal of Computer Science and Information Technology) Jurnal Informatika dan Teknik Elektro Terapan Scientific Journal of Informatics JOIV : International Journal on Informatics Visualization Journal of Information Technology and Computer Science INTEGER: Journal of Information Technology JPP IPTEK (Jurnal Pengabdian dan Penerapan IPTEK) SPIRIT Jusikom: Jurnal Sistem Informasi Ilmu Komputer JATI (Jurnal Mahasiswa Teknik Informatika) Journal Cerita: Creative Education of Research in Information Technology and Artificial Informatics Jurnal Pengabdian kepada Masyarakat Nusantara Nusantara Science and Technology Proceedings Journal of Computer, Electronic, and Telecommunication (COMPLETE) KERNEL: Jurnal Riset Inovasi Bidang Informatika dan Pendidikan Informatika

Agung Mustika Rizki, Agung Mustika

Brawijaya University

Author-ID : 610131

Agriculture, Biological Sciences & Forestry Chemical Engineering, Chemistry & Bioengineering Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Electrical & Electronics Engineering Engineering Law, Crime, Criminology & Criminal Justice Materials Science & Nanotechnology Medicine & Pharmacology Social Sciences Other

Published : 29 Documents Claim Missing Document

Claim Missing Document

Articles

Title

Implementation of Genetic Algorithm to Solve Travelling Salesman Problem with Time Window (TSP-TW) for Scheduling Tourist Destinations in Malang City Yuliastuti, Gusti Eka; Mahmudy, Wayan Firdaus; Rizki, Agung Mustika
Journal of Information Technology and Computer Science Vol. 2 No. 1: June 2017
Publisher : Faculty of Computer Science (FILKOM) Brawijaya University

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.

Determining Optimum Production Quantity on Multi-Product Home Textile Industry by Simulated Annealing Yuliastuti, Gusti Eka; Rizki, Agung Mustika; Mahmudy, Wayan Firdaus; Tama, Ishardita Pambudi
Journal of Information Technology and Computer Science Vol. 3 No. 2: November 2018
Publisher : Faculty of Computer Science (FILKOM) Brawijaya University

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.

Variable Neighborhoods Search for Multi-Site Production Planning Rizki, Agung Mustika; Yuliastuti, Gusti Eka; Mahmudy, Wayan Firdaus; Tama, Ishardita Pambudi
Journal of Information Technology and Computer Science Vol. 3 No. 2: November 2018
Publisher : Faculty of Computer Science (FILKOM) Brawijaya University

In the home textile industry, production planning needs to be done so that the production costs incurred by the company can be well controlled. Production planning is a problem that cannot be solved in a short time. Problems are more complex if the company has several production branches in other cities, with rules and standards that are certainly very different from one city to another. Based on this background, an algorithm is needed that can solve production planning problems for companies with many production branches in order to obtain optimal solutions. VNS is applied by the author and produces an optimal and efficient solution because the time needed is relatively short compared to the planning carried out previously by the company.

Co-Authors Achmad Junaidi Adityawan, Firza Prima Andreas Nugroho Sihananto Anggraini Puspita Sari Arishandy, Zalfa Ibtisamah ASHARI, FAISAL Citra Nurina Prabiantissa Dimara, Denis Lizard Sambawo Efendi, Ridwan Eka Prakarsa Mandyartha EKO WAHYUDI Eva Yulia Puspaningrum Fetty Tri Anggraeny Firza Prima Aditiawan Gusti Eka Yuliastuti Hafizh, Muhammad Abdullah Handika, I Putu Susila Henni Endah Wahanani Hermadiputri, Firdausa Yasmin Hidra Amnur IMANDAYANTI, NUR EZA Indradewa, Rhian indrawanti, annisaa sri Ishardita Pambudi Tama Kartini Kartini Libriawan, Raditya Dimas Lutfia, Qonita Made Hanindia Prami Swari Mandyarth, Eka Prakarsa Maulana, Naufal Duta Mina, Nora Moch Erreza, Moch Erreza Mohammad, Farrel Adel Muhammad Muharrom Al Haromainy Muhammad Rivai Nurlaili , Afina Lina Pratama, Muhammad Lutfi Putri, Shintyadhita Wirawan Rizky Amelia Saputra, Rendi Cahya Satwika, I Kadek Susila Setianto, Christian Wahyu Taufiqqurrahman, Husain Titin Sumarni Wardhani, Adil Sandy Wayan Firdaus Mahmudy Widoretno, Astrini Aning

Title Search

Found 3 Documents Search Journal : journal of information technology and computer science

Abstract

Abstract

Abstract

Title

Found 3 Documents
Search
Journal : journal of information technology and computer science