[ May 21, 2009 ] Release of MAOS mini Series m01.00.02

STD_PRB_3Opt_REAX+SEAX (for TSP): the strategy used in "Multiagent optimization system for solving the traveling salesman problem (TSP)".

[ Sep 08, 2008 ] Release of MAOS mini Series m01.00.01

Implement the supports for Boolean Satisfiability Problem (SAT) and Kauffman's N-K Landscape Model (NKB) in Binary Space

[ Sep 04, 2008 ]

[MANUAL] A basic document for Solving Script List & Predefined Script List.

[ Sep 01, 2008 ]

[MANUAL] A basic document for Knowledge Components.

[ Aug 26, 2008 ]

[MANUAL] A basic document for Script Format.

[ Aug 25, 2008 ] Add search components for NOP and TSP

(1) implement.NOP.behavior.combine.SocialCognitiveSearcher: the major search component of Social Cognitive Optimization (SCO). A solver example is "SC_Direct".

(2) implement.TSP.behavior.combine.DPXSearcher: the Distance Preserving Crossover (DPX) proposed by Freisleben & Merz. A solver example is "STD_PRB_3Opt_DPX".

(3) implement.TSP.behavior.complex.InverOverSearcher: the Inver-over Operator proposed by Guo & Michalewicz. A solver example is "STD_PRB_InverOver".

[MANUAL] A basic Document for Numerical Optimization (NOP) Instances.

[ Aug 24, 2008 ] Add a search component for NOP

implement.NOP.behavior.complex.EMComplexSearcher: the major search component of Electromagnetism-like Mechanism Heuristic (EM). A solver example is "EM_SIT".

[MANUAL] A basic Document for User & Developer.

[ Aug 21, 2008 ] First release of MAOS mini Series m01.00.00

Including MAOS Kernel V1, internal representations and search components for Numerical Optimization (NOP), Quadratic Knapsack Problem (QKP), Graph Coloring Problem (GCP), and Traveling Salesman Problem (TSP). Some solver (behavioral toolbox) examples are listed as follows.

(1) STD_NLDUX (for QKP): the strategy used in "A mini-swarm for the quadratic knapsack problem", including a macro repairing & improving strategy, called LS_QKP_REFINER, and implement.common.behavior.combine.UniformXRecombinator (Uniform Crossover).

(2) DE.G.F0.5.Planet (for NOP): the Differential Evolution algorithm, including implement.NOP.behavior.complex.DEComplexSearcher (the search operator)

(3) DS_GGBX_STD_QT (for GCP): the strategy used in "Graph coloring by multiagent fusion search", including SS_DS_LS@SpecialSSModules (DSatur-based construction search strategy), MLS_MFS_Imp@KernelMLSModules & LS_NODE_QT@SpecialLSNModules (Quasi-Tabu local search strategy), and implement.GCP.behavior.combine.GGBX.GGBXSearch (Generalized Group-based Recombination).

(4) STD_PRB_3Opt_REAX (for TSP): including implement.TSP.behavior.greedy.Basic3OPT (3-OPT local search strategy with alpha-type nearest neighborhood candidate set & don't look bits), and implement.TSP.behavior.combine.eax.RandEAXRecombinator (Edge Assembly Crossover (EAX) with diffusion control), etc. The component "RandEAXRecombinator" has been used in "How autonomy oriented computing (AOC) tackles a computationally hard optimization problem".