Claim Missing Document
Check
Articles

Found 6 Documents
Search

Optimisasi Multi Depot Vehicle Routing Problem (MDVRP) dengan Variabel Travel Time Menggunakan Algoritma Particle Swarm Optimization Gamayanti, Nurlita; Alkaff, Abdullah; Mangatas, Randi
JAVA Journal of Electrical and Electronics Engineering Vol 13, No 1 (2015)
Publisher : JAVA Journal of Electrical and Electronics Engineering

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (865.967 KB)

Abstract

Multi Depot  Vehicle Routing Problem  (MDVRP) merupakan permasalahan optimasi yang memiliki peranan penting dalam manajemen sistem distribusi dengan tujuan meminimalkan  waktu  yang diperlukan, dimana penentuan  waktu  berkaitan dengan jarak dari rute yang ditempuh oleh armada distribusi. Penelitian ini memberikan sebuah formulasi dari kasus  Multi Depot  Vehicle  Routing  Problem  (MDVRP) yang diselesaikan dengan metode algoritma  Particle Swarm Optimization  (PSO).  Terdapat dua tahapan untuk menyelesaikan MDVRP yaitu  clustering  dan  assignment. Dalam  clustering  digunakan metode  simplified parallel assignment, sedangkan untuk  assignment digunakan metode  particle swarm optimization.  PSO merupakan salah satu teknik komputasi.  Algoritma  Particle Swarm Optimization  dapat menghasilkan waktu tempuh yang minimum
Optimisasi Dynamic Economic Dispatch Menggunakan Algoritma Artificial Bee Colony Gamayanti, Nurlita; Alkaff, Abdullah; Karim, Amien
JAVA Journal of Electrical and Electronics Engineering Vol 13, No 1 (2015)
Publisher : JAVA Journal of Electrical and Electronics Engineering

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (993.818 KB)

Abstract

Pembangkitan daya listrik yang optimal menjadi penting seiring dengan meningkatnya kebutuhan daya dan biaya bahan bakar. Dynamic economic dispatch diharapkan mendapatkan pembangkitan daya yang ekonomis dan tetap melayani kebutuhan daya secara andal pada sistem pembangkitan daya listrik. Beberapa karakteristik non-linier dan batasan praktis pada unit generator seperti  valve-point effect, batasan ramp-rate dan batasan operasi, serta rugi-rugi transmisi pada jaringan listrik dipertimbangkan dalam perhitungan. Penelitian ini menyajikan implementasi algoritma Artificial Bee Colony, algoritma meta-heuristik yang terinspirasi dari tingkah laku kawanan lebah untuk menyelesaikan permasalahan dynamic economic dispatch. Untuk menunjukkan kelayakan dan efektifitas dari hasil optimasi, dua sistem berbeda dengan 5 unit dan 15 unit pembangkit dilakukan pengujian dengan parameter algoritma yang berbeda. Hasil pengujian menunjukkan bahwa algoritma Artificial Bee Colony mampu memberikan solusi dispatch yang baik dengan waktu komputasi yang cepat
Rancang Bangun Perangkat Lunak Reliability-Centered Maintenance untuk Gardu Induk Putra, Farid Rafli; Gamayanti, Nurlita; Alkaff, Abdullah
Jurnal Teknik ITS Vol 1, No 1 (2012)
Publisher : Direktorat Riset dan Pengabdian Masyarakat (DRPM), ITS

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12962/j23373539.v1i1.89

Abstract

Kinerja gardu induk (substation) akan mengalami penurunan kondisi setelah beroperasi dalam jangka waktu tertentu sehingga berdampak pada kerugian operasional maupun non-operasional. Gardu Induk memiliki peranan penting dalam proses transmisi listrik dan proteksi sistem kelistrikan terhadap gangguan. Pada penelitian ini, dibangun perangkat lunak dengan pemrograman PHP dan MySQL yang berisikan informasi berupa database dan modelbase meliputi fungsi, kegagalan fungsi, bentuk kegagalan, efek kegagalan, konsekuensi kegagalan, data kerusakan dan teknis dari tiap peralatan serta komponen pada gardu induk untuk kegiatan perawatan dengan metode reliability-centered maintenance (RCM). Hasil pengujian menunjukkan bahwa metode RCM merekomendasikan sebanyak 75 proposed task untuk diterapkan pada gardu induk. Perangkat lunak yang dibuat dapat mempermudah pengguna dalam menentukan kegiatan perawatan gardu induk serta dapat diperbaharui dan diakses pada cakupan area tertentu.
Comparison of Gradient Estimation in Cooperative Multi-Agent Source Seeking Mochammad Sahal; Zulkifli Hidayat; Abdullah Alkaff
JAREE (Journal on Advanced Research in Electrical Engineering) Vol 1, No 2 (2017): October
Publisher : Department of Electrical Engineering ITS and FORTEI

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12962/j25796216.v1.i2.21

Abstract

Agent-based source seeking problem is addressed in this paper. This problem is relevant in, e.g., in hazardous gas leak in a chemical disaster.  In the cooperative search, agents develop a formation to effectively search the source by communicating one to another via a communication topology. The source, or the search target, is represented by a scalar field y which might describe a temperature level, hazardous concentration of substances or vapor. Every agent has the information on its own position and the value of y at any instance. The agents are identical modeled as single and double integrator. Consensus filter is used to control the agent formation and comparison three types of gradient estimation are employed to search the source.  Experiments show that the proposed schemes give good performance to solve cooperative search for source seeking problem Keywords: cooperative source seeking, source seeking, formation control, gradient estimation
Analysis and Dynamic Routing Implementation of Hierarcical Healthcare Referral System Khairurizal Alfathdyanto; Abdullah Alkaff; Nurlita Gamayanti
JAREE (Journal on Advanced Research in Electrical Engineering) Vol 1, No 1 (2017): April
Publisher : Department of Electrical Engineering ITS and FORTEI

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12962/j25796216.v1.i1.5

Abstract

Hierarchical Healthcare Referral System (HHRS) is implemented by National Insurance Providing Agency (BPJS) as part of the healthcare insurance policies. Patients who want to get health insurance in a hospital should get a referral from the community health center in which they are registered. Congestion of patients happens in certain hospital as there is no policy implemented to govern the referral system. In this paper, HHRS is modeled as a network of queuing system and is analyzed for its queue performances. Analysis of queuing network performances shows the influence patient preferences to buildup congestion of patients in hospitals. Referral is then controlled by means of dynamic routing with considering patient preferences. Estimation of arrival rate is done with hypercube queuing theory which concerns user preference. Simulation shows that patient preferences affect the arrival rate at each hospital, the application of dynamic routing can reduce the maximum utility and reduce the average waiting time, prioritization of patients improve dynamic routing performance on systems with a high workload.Keywords: dynamic routing; hierarchical healthcare referral system; patient priority; queueing networks;
Metaheuristics for The Solution of Dynamic Vehicle Routing Problem With Time Windows (DVRPTW) With Travel Time Variable Nurlita Gamayanti; Abdullah Alkaff; Ahmad Rusdiansyah
JAREE (Journal on Advanced Research in Electrical Engineering) Vol 1, No 1 (2017): April
Publisher : Department of Electrical Engineering ITS and FORTEI

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12962/j25796216.v1.i1.13

Abstract

This research is focusing on the development of metaheuristic algorithm to solve Dynamic Vehicle Routing Problem With Time Windows (DVRPTW) for the service provider of Inter-city Courier. The algorithm is divided into two stages which is static stage and dynamic stage. In the static stage, modified Ant Colony System is developed and in the dynamic stage, Insertion Heuristic is developed. In DVRPTW, vehicle’s routes are raised dynamically based on real time information, for example the reception of new order. To test the performances of the developed metaheuristic algorithm, the author compares the developed algorithm with the nearest neighbor algorithm and with the combination between the nearest neighbor and insertion heuristics algorithm. Experiment is done using Chen’s standard data test. The developed metaheuristic algorithm was applied on the network data of the roads in Surabaya, where the routes generated not only determine the order that the consumer must visit but also determine the routes that must be passed. After the experiment, the author conclude that the developed algorithm generates a better travel time total than the nearest neighbor and the combination between the nearest neighbor and insertion heuristics and can also generate route dynamically to respond to the new order well. Keywords: Inter-City Courier, Dynamic Vehicle Routing Problem dengan Time Window (DVRPTW), Ant Colony System, Insertion Heuristics