Article Per Year (5 Year)
p-Index From 2020 - 2025
0
P-Index
This Author published in this journals
All Journal TEKNOINFO
Djasli Djamarus, Djasli
Unknown Affiliation
Computer Science & IT Engineering

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

Found 2 Documents
Search

 1 
SIMULASI PENGGUNAAN LOGIKA FUZZI PADA PENGENDALIAN I-AMPU LAI-U LINTAS Djamarus, Djasli; Tjanggulung, Yuliana L
TEKNOINFO Vol 1, No 1 (2007): Voı. 1. No, 1 Januari 2007
Publisher : TEKNOINFO

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

One of the major we faced in a big city is a traffic jam problem. Usually it is happened around traffic junctions controlled by a traffic light system. In a conventional traffic light, the traffic is controlled by giving a constant number of seconds for each direction at any time for the traffics to pass the junction.Even though the aim of the traffic light is to avoid or at least to reduce the traffic jam, in fact in a very dense traffic, the conventional traffic light is fail to comply with this situation. This paper addresses the design, implementation and analysis of an intelligent traffic light controller based on fuzzy logic technology to overcome the traffic problem.Graphical software is developed to simulate the situation of the traffic light junction based on this technology. The software allows simulation at a junction while cars from each junction can go straight or turn right controlled by fuzzy or conventional controller. The simulation results show that performance of fuzzy logic controller is better than traditional controller.
PERBANDINGAN ALGORITME ANT COLONY OPTIMIZATION DENGAN ALGORITME GREEDY DALAM TRAVELING SALESMAN PROBLEM Djamarus, Djasli; Mediawan, Meiril
TEKNOINFO Vol 1, No 1 (2008): Vol. 1 No 1 Januari 2008
Publisher : TEKNOINFO

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Traveling Salesman Problem (TSP) is a classic NP (Non deterministic Polynomial) problem where a person has to make a tour to all known places exactly once, with a minimum cost. If there are N places to visit, there will be a number of (N-l)! routes to explore.Knowing the distance among all places, of course the shortest route can be determined. However, if there are so many places to visit, the number of route will increase very fast as the factorial function (much higher function compare to polynomial), of which the exploration to all routes in a deterministic approach will take a very long time.This limitation invites researchers to develop a new type of algorithm known as stochastic approach. Although there is no guarantee the best solution will be found, this type of algorithm propose an approximately solution in a much shorter time.In this work the Ant Colony Optimization (ACO), one of the stochastic algorithms, is apply to the TSP, the result is compare to the greedy algorithm in solving the same problem. 
Co-Authors Meiril Mediawan, Meiril Yuliana L Tjanggulung, Yuliana L