Rank: 263 based on 364 downloads (last 30 days) and 3 files submitted
photo

Dimas Aryo

E-mail
Company/University
Yogyakarta State University
Lat/Long
-7.796888, 110.36914

Personal Profile:

I graduated from Yogyakarta State University Indonesia in mathematics majoring. I working as software engineer at PT. Mitrais. I join in mining software team. My expertise is developing desktop, web, or mobile application using C#.NET, Ruby, Java, C++, Javascript, or Matlab.

Professional Interests:
Ruby & .NET Programmer

 

Watch this Author's files

 

Files Posted by Dimas View all
Updated   File Tags Downloads
(last 30 days)
Comments Rating
13 Apr 2012 Screenshot Dijkstra Algortihm with GUI Dijkstra algorithm is used for solving shortest path problem. Author: Dimas Aryo dijkstra, shortest path, gui, mathematics, simulation 30 0
11 Apr 2012 Dijkstra Algorithm Dijstra algorithm to solve shortest path problem. Author: Dimas Aryo dijkstra, shortest path, mathematics 117 5
  • 4.5
4.5 | 2 ratings
29 Jun 2011 Screenshot Ant Colony Optimization (ACO) Solve dynamic job shop scheduling problem with ant colony optimization (ACO). Author: Dimas Aryo aco, jssp, dynamic job shop sche..., ant colony optimizati..., shortest path, mathematics 217 11
  • 4.5
4.5 | 7 ratings
Comments and Ratings by Dimas
Updated File Comments Rating
11 Apr 2012 Ant Colony Optimization (ACO) Solve dynamic job shop scheduling problem with ant colony optimization (ACO). Author: Dimas Aryo

example command to using this code :

dinamicjssp('job01.xls','job02.xls',10)

Comments and Ratings on Dimas' Files View all
Updated File Comment by Comments Rating
25 Mar 2014 Ant Colony Optimization (ACO) Solve dynamic job shop scheduling problem with ant colony optimization (ACO). Author: Dimas Aryo Prakash, Rahul

What is he syntax to use dinamicjssp2 and dinamicjssp3 ??

20 Jan 2014 Ant Colony Optimization (ACO) Solve dynamic job shop scheduling problem with ant colony optimization (ACO). Author: Dimas Aryo YAN

16 Dec 2013 Dijkstra Algorithm Dijstra algorithm to solve shortest path problem. Author: Dimas Aryo Marwaha, Gautam

This code mostly works fine but fails for a few cases:
G = [0 1 1 1 1 0 0;
1 0 0 1 0 1 0;
1 0 0 1 0 1 1;
1 1 1 0 1 0 0;
1 0 0 1 0 0 1;
0 1 1 0 0 0 1;
0 0 1 0 1 1 0];

dijkstra(G,3,5) yields [5 3 3] or [3 3 5]. Any ideas why this happens?

16 Dec 2013 Ant Colony Optimization (ACO) Solve dynamic job shop scheduling problem with ant colony optimization (ACO). Author: Dimas Aryo Habib, Muhammad

failing to run this code...

09 Dec 2013 Dijkstra Algorithm Dijstra algorithm to solve shortest path problem. Author: Dimas Aryo George, Alex

any idea on how this works?

Contact us