Article Per Year (5 Year)
p-Index From 2020 - 2025
0.23
P-Index
This Author published in this journals
All Journal Jurnal Telematika Indonesian Journal of Physics (IJP)
Jusak Sali Kosasih
Indonesian Center for Theoretical and Mathematical Physics, Institut Teknologi Bandung
Astronomy Computer Science & IT Earth & Planetary Sciences Electrical & Electronics Engineering Energy Engineering

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

Found 2 Documents
Search

 1 
PERANCANGAN ALGORITMA SIMULATED ANNEALING UNTUK RUTE KENDARAAN YANG MEMPERTIMBANGKAN BACKHAUL,RUTE MAJEMUK, DAN TIME WINDOW Cahyadi, Ferdian; Ong, Johan Oscar; Kosasih, Jusak Sali
Jurnal Telematika Vol. 7 No. 1 (2011)
Publisher : Yayasan Petra Harapan Bangsa

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.61769/telematika.v7i1.53

Abstract

Vehicle Routing Problem (VRP) menjadi hal yang sangat penting dalam masalah  pendistribusian barang, karena perusahaan ingin mencapai hasil yang seefektif dan seefisien mungkin agar biaya yang dikeluarkan dapat diperkecil. Dalam VRP, perlu diperhatikan juga jumlah kendaraan yang digunakan dan waktu bongkar muat (loading/unloading) di tempat pelanggan, hal itu yang menjadi pembatas dalam VRP.Tujuan dari jurnal ini adalah untuk menyelesaikan masalah rute kendaraan yang  mempertimbangkan backhaul, rute majemuk (multiple trips), dan time window atau yang dikenal dengan model/varian VRPBMTTW, dan akan menghitung jumlah kendaraan, total duration time (TDT), dan range of duration time (RDT). Untuk memecahkan masalah ini digunakan teknik Simulated Annealing (SA) yang merupakan suatu pendekatan algoritma yang efisien untuk memecahkan masalah optimasi kombinatorial yang sulit. Solusi awal ditingkatkan berulang-kali dengan membuat perubahan kecil hingga ditemukan solusi yang lebih baik. Vehicle Routing Problem (VRP) become very important in the problem of distribution of goods, because the company wants to achieve results effectively and efficiently as possible so the costcan be reduced. In VRP, the number of vehicles used and the time of loading and unloading at the customer site, need to be considered too, it is a constraint in the VRP. The purpose of this journal is to solve the vehicle routing problem considering backhaul, multiple trips, and the time window, known as the model/variant VRPBMTTW, and will count the number of vehicles, the total duration time (TDT), and range of duration time (RDT). To solve this problem used technique Simulated Annealing (SA) which is an efficient algorithm approach to solve difficult combinatorial optimization problems. Initial solution repeatedly improved by making small changes to find a better solution. Keywords— Vehicle Routing Problem, Backhaul, Multiple Trip, Time Window, Simulated Annealing
Faddeev-Popov Ghost and BRST Symmetry in Yang-Mills Theory Yanuwar, Edyharto; Kosasih, Jusak Sali
Indonesian Journal of Physics Vol 31 No 1 (2020): Vol 31 No 1 (2020)
Publisher : Institut Teknologi Bandung

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (202.859 KB) | DOI: 10.5614/itb.ijp.2020.31.1.5

Abstract

Ghost fields arise from the quantization of the gauge field with constraints (gauge fixing) through the path integral method. By substituting a form of identity, an effective propagator will be obtained from the gauge field with constraints and this is called the Faddeev-Popov method. The Grassmann odd properties of the ghost field cause the gauge transformation parameter to be Grassmann odd, so a BRST transformation is defined. Ghost field emergence with Grassmann odd properties can also be obtained through the least action principle with gauge transformation, and thus the relations between the BRST transformation parameters and the ghost field is obtained.
Co-Authors Cahyadi, Ferdian Johan Oscar Ong Yanuwar, Edyharto