UPDATE 2 (17 Feb. 2022): Traveling Salesman Problem (TSP) solved by a “Hybrid Genetic Algorithm” I had developed in Assembly Language and LPA Prolog (2009).
The same video on my YouTube channel (terminated for unknown reasons, on the same day my Gmail was hacked, 19/8/2021): http://www.youtube.com/watch?v=HvE5Ue971Cs (“Video Unavailable because the account was terminated…”).
I used this algorithm’s DLL inside a large-scale Scheduling Application for Multiple Tasks, in LPA WIN-Prolog. Some screen-shots from the program’s main window are shown in the following animated GIF:
O.G.T.S.P. Algorithm sample screen-shots
Related articles by Zemanta
- Assembly Language for Visual Prolog Meta-programming (prologsource.wordpress.com)
- Prolog message queue (dbtune.org)
- TAKASHI’S WORKSPACE: A Prolog In Haskell (propella.blogspot.com)
- Introduction of the Microsoft Office PowerPoint 2007 (5min.com)
A.I. programming in Prolog and Assembler 
