Labels

ACO (3) AdaBoost (2) Ant Colony Optimization (2) Backpropagation (2) binary constraint graph (1) blockchain (2) brute force (1) brute force algorithm (1) Class Scheduling (12) conditional independence (1) conference cheduling (1) conference scheduling (2) constraint satisfaction problem (3) cryptocurrency (3) csp (3) cyclic group (1) data mining (3) decision trees (12) derive equations (1) DHKE (6) Diffie Hellman Problem (1) Diffie-Hellman Key Exchange (2) Digital Signature Algorithm (1) Discrete Logarithm Problem (1) double and add algorithm (1) download source code (1) DSA (1) ecc (1) ECDH (1) ECDSA (1) Elgamal (1) Elgamal Digital Signature (1) Elliptic Curve (1) Elliptic Curve Diffie–Hellman key exchange (1) Elliptic Curve Cryptography (1) Elliptic Curve Digital Signature Algorithm (1) Encryption (1) euler phi function (1) extended euclidean algorithm (1) generalized discrete logarithm problem (1) generate rules (3) Genetic Algorithm (5) Genetic Algorithms (19) gradient descent (2) group (1) group generator (1) grow xml tree (1) Handle Underflow (1) hashing (1) hill climbing (7) hopfield network (2) independence (1) info gain (1) information gain (2) java (84) javafx (1) k-nearest neighbors (2) Laplace Smoothing (2) linear algebra (3) Linear Regression (2) logical operators (1) logistic regression (4) map coloring (1) message authenticity (1) message confidentiality (1) message integrity (1) multi-party Diffie-Hellman Key Exchange (1) Naive Bayes (6) nearest neighbor (1) nearest neighbors (1) Neural Networks (10) node splitting (1) Normal Equation (2) numpy (1) P2P (10) Peer to Peer (5) peer-to-peer (2) point addition (1) point doubling (1) pow (3) probability (2) proof of work (3) proof-of-work (1) public key cryptography (9) Public Key Cryptography + DHKE w/ Encryption + JAVA (1) Python (18) random restart hill climbing (2) robotics (1) rsa (1) RSA Digital Signature (1) Scala (1) Sentiment Classification (4) Sequential Minimal Optimization (2) sha-256 (1) simulated annealing (2) SMO (2) sqlite (21) stochastic gradient descent (2) Support Vector Machines (2) SVM (2) Traveling Salesman Problem (1) TSP (13) underflow handling (1) use rules (3) workshops scheduling (2)
Showing posts with label Ant Colony Optimization. Show all posts
Showing posts with label Ant Colony Optimization. Show all posts

Wednesday, July 22, 2020

TSP + Ant Colony Optimization (ACO) + SQLite DB + JAVA


 TSP + Ant Colony Optimization (ACO) + SQLite DB + JAVA
 

 prototypeprj.com = zaneacademy.com (version 2.0)

00:10 import into Eclipse the downloaded zip file for 
'TSP Ant Colony Optimization w/ JAVA Project' 

00:28 create a new project and copy code from imported project 
01:03 add and setup the sqlite jdbc jar file to the project 

01:38 create a new package that will contain all 
3 drivers for DB, File, & Hardcoded data 
02:03 quickly refactor the code 

05:45 test run the hardcoded data Driver 

06:54 code CreateDB01 class to create the database 
and create and populate the city table 

08:00 code the 'data from database' DBDriver class 

09:10 create and populate the sqlite database containing 
cities and their latitudes and longitudes 
09:17 test run the 'data from database' DBDriver 

09:36 create file containing cities and their latitudes and longitudes 

10:00 code the 'data from file' FileDriver class 

10:26 test run the 'data from file' FileDriver

-----------------------------------------------------------------------------------------------------------
-----------------------------------------------------------------------------------------------------------

Thursday, July 16, 2020

Ant Colony Optimization (ACO) + JAVA + Traveling Salesman Problem (TSP)


 Traveling Salesman Problem (TSP) By Ant Colony Optimization (ACO) - JAVA 8 Tutorial
 

00:20 stigmergy is where individual organisms interact with each other 
through modifications of their environment 
00:39 ants find shortest path from colony to food source using stigmergy 
01:40 aco attempt to exploit elements of ant stigmergy 
in order to solve similar problems like tsp 

01:55 quickly go over various parts of this tutorial 

02:44 demo prebuilt version of application 

03:32 code the app. 
03:50 code Driver, Ant, and Route classes 

04:56 ExecutorService is an Executor that provides methods to manage termination 
and methods that can produce a Future for tracking progress of one or more asynchronous tasks
05:20 ExecutorCompletionService uses a supplied Executor to execute tasks 

09:07 do intial test run of app. before adding remaining classes 

09:57 Add AntColonyOptimization, City, AtomicDouble 
10:50 code City class 

11:55 code Route class 

12:41 code AtomicDouble class 

13:35 define initial route between cities in Driver class 

13:57 handle distances and phermone levels functionality 
in AntColonyOptimization class 

16:10 finish coding Ant class 
17:52 code call() method in Ant class 

24:00 adjust phermone level functionality in Ant class 

28:00 transition probabilities functionality in Ant class 

32:00 finish coding Driver class 
33:37 ants processing functionality in Driver class 

36:34 test run completed application


--------------------------------------------------------------------------------------------------------------------
quickly download, import into Eclipse, and run zip file for 
'TSP Ant Colony Optimization w/ JAVA Project' 
---------------------------------------------------------------------------------------------------------------------


-----------------------------------------------------------------------------------------------------------
-----------------------------------------------------------------------------------------------------------