物流分析工具包。Facility location: Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated facility location
Vehicle routing: VRP, VRP with time windows, traveling salesman problem (TSP)
Networks: Shortest path, min cost network flow, minimum spanning tree problems
Geocoding: U.S. city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting
Layout: Steepest descent pairwise interchange (SDPI) heuristic for QAP
Material handling: Equipment selection
General purpose: Linear programming using the revised simplex method, mixed-integer linear programming (MILP) branch and bound procedure
Data: U.S. cities with populations of at least 10,000, U.S. highway network (Oak Ridge National Highway Network), U.S. 3- and 5-digit ZIP codes
- XCS for Dynamic Environments
+ Continuous versions of XCS
+ Test problem: real multiplexer
+ Experiments: XCS is explored in dynamic environments with different magnitudes of change to the underlying concepts.
+Reference papers:
H.H. Dam, H.A. Abbass, C.J. Lokan, Evolutionary Online Data Mining – an Investigation in a Dynamic Environment. 2005, accepted for a book chapter in Springer Series on Studies in Computational Intelligence
H.H. Dam, H.A. Abbass, C.J. Lokan, Be Real! XCS with Continuous-Valued Inputs. IWLCS 2005, (International Workshop on Learning Classifier Systems). Washington DC, June 2005.