Fabian Becker
@@ -1,2 +0,0 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?><!DOCTYPE helpset PUBLIC "-//Sun Microsystems Inc.//DTD JavaHelp HelpSet Version 2.0//EN" "http://java.sun.com/products/javahelp/helpset_2_0.dtd">
|
||||
<helpset version="2.0"><maps><mapref location="EvA2Help.jhm"/><homeID>html_index_html</homeID></maps><title>EvA2 Help</title><view><type>javax.help.TOCView</type><name>TOC</name><label>Table Of Contents</label><data>toc.xml</data></view><view><type>javax.help.SearchView</type><name>Search</name><label>Search</label><data>JavaHelpSearch</data></view></helpset>
|
||||
@@ -1,2 +0,0 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?><!DOCTYPE map PUBLIC "-//Sun Microsystems Inc.//DTD JavaHelp Map Version 2.0//EN" "http://java.sun.com/products/javahelp/map_2_0.dtd">
|
||||
<map version="2.0"><mapID target="html_index_html" url="html/index.html"/><mapID target="html_ide-basics_keyboard-shortcuts_about-shortcuts_html" url="html/ide-basics/keyboard-shortcuts/about-shortcuts.html"/><mapID target="html_ide-basics_keyboard-shortcuts_menu-shortcuts_html" url="html/ide-basics/keyboard-shortcuts/menu-shortcuts.html"/></map>
|
||||
@@ -1 +0,0 @@
|
||||
<01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01><01>
|
||||
@@ -1 +0,0 @@
|
||||
e<><65><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>j<><6A><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
||||
@@ -1 +0,0 @@
|
||||
<05><>`<05>2<EFBFBD><07><>@
|
||||
Binary file not shown.
@@ -1,2 +0,0 @@
|
||||
JavaSearch 1.0
|
||||
TMAP bs=2048 rt=0 fl=-1 id1=128 id2=1
|
||||
Binary file not shown.
@@ -1,69 +0,0 @@
|
||||
<!DOCTYPE html>
|
||||
<html>
|
||||
<head></head>
|
||||
<body>
|
||||
<h3>Menu Shortcuts</h3>
|
||||
<p>There are keyboard shortcuts available to activate the following menu commands and other general commands:</p>
|
||||
<ul>
|
||||
<li><a href="#options">Options menu</a></li>
|
||||
</ul>
|
||||
|
||||
|
||||
<h4><a name="options">Options menu</a></h4>
|
||||
<table border="1">
|
||||
<tr>
|
||||
<th>Keys</th>
|
||||
<th>Command</th>
|
||||
<th>Action</th>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>CTRL+P</td>
|
||||
<td>Preferences</td>
|
||||
<td>Opens the preferences dialog</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>CTRL+Q</td>
|
||||
<td>Quit</td>
|
||||
<td>Exits the application</td>
|
||||
</tr>
|
||||
</table>
|
||||
|
||||
<h4><a name="options">Windows menu</a></h4>
|
||||
<table border="1">
|
||||
<tr>
|
||||
<th>Keys</th>
|
||||
<th>Command</th>
|
||||
<th>Action</th>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>CTRL+M</td>
|
||||
<td>Cascade Windows</td>
|
||||
<td>Cascades the visible internal windows</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>CTRL+,</td>
|
||||
<td>Tile vertically</td>
|
||||
<td>Tile the visible internal windows vertically</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>CTRL+.</td>
|
||||
<td>Tile horizontally</td>
|
||||
<td>Tile the visible internal windows horizontally</td>
|
||||
</tr>
|
||||
</table>
|
||||
|
||||
<h4><a name="options">Help menu</a></h4>
|
||||
<table border="1">
|
||||
<tr>
|
||||
<th>Keys</th>
|
||||
<th>Command</th>
|
||||
<th>Action</th>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>F1</td>
|
||||
<td>Help</td>
|
||||
<td>Opens the help contents</td>
|
||||
</tr>
|
||||
</table>
|
||||
</body>
|
||||
</html>
|
||||
@@ -1,11 +0,0 @@
|
||||
<html>
|
||||
<head></head>
|
||||
<body>
|
||||
<h1>EvA2 Help</h1>
|
||||
<p>EvA2 (an Evolutionary Algorithms framework, revised version 2) is a comprehensive heuristic optimization framework with emphasis on Evolutionary Algorithms implemented in Java. It is a revised version of the JavaEvA optimization toolbox, which has been developed as a resumption of the former EvA software package.
|
||||
EvA2 integrates several derivation free optimization methods, preferably population based, such as Evolution Strategies (ES), Genetic Algorithms (GA), Differential Evolution (DE), Particle Swarm Optimization (PSO), as well as classical techniques such as multi-start Hill Climbing or Simulated Annealing. Besides typical single-objective problems, multi-modal and multi-objective problem are handled directly by the EvA2 framework. Via the Java mechanism of Remote Method Invocation (RMI), the algorithms of EvA2 can be distributed over network nodes based on a client-server architecture.</p>
|
||||
|
||||
<p>EvA2 aims at two groups of users. Firstly, the end user who does not know much about the theory of Evolutionary Algorithms, but wants to use Evolutionary Algorithms to solve an application problem. Secondly, the scientific user who wants to investigate the performance of different optimization algorithms or wants to compare the effect of alternative or specialized evolutionary or heuristic operators. The latter usually knows more about evolutionary algorithms or heuristic optimization and is able to extend EvA2 by adding specific optimization strategies or solution representations.</p>
|
||||
|
||||
<p>EvA2 is being used as teaching aid in lecture tutorials, as a developing platform in student research projects and applied to numerous optimisation problems within active research and ongoing industrial cooperations.</p>
|
||||
</body>
|
||||
@@ -1,2 +0,0 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?><!DOCTYPE toc PUBLIC "-//Sun Microsystems Inc.//DTD JavaHelp TOC Version 2.0//EN" "http://java.sun.com/products/javahelp/toc_2_0.dtd">
|
||||
<toc version="2.0"><tocitem target="html_index_html" text="Introduction"/><tocitem text="IDE Basics"><tocitem text="Getting Started"><tocitem text="User Interface"/></tocitem><tocitem text="Keyboard Shortcuts"><tocitem target="html_ide-basics_keyboard-shortcuts_about-shortcuts_html" text="About Shortcuts"/><tocitem target="html_ide-basics_keyboard-shortcuts_menu-shortcuts_html" text="Menu Shortcuts"/><tocitem text="Window Navigation Shortcuts"/></tocitem><tocitem text="Tutorials"><tocitem text="Monte-Carlo-Search"/><tocitem text="Hill-Climber"/><tocitem text="Simulated Annealing"/><tocitem text="Genetic Algorithms and Genetic Programming"/><tocitem text="Population Based Incremental Learning"/><tocitem text="Evolution Strategies"/><tocitem text="Model Assisted Evolution Strategies"/><tocitem text="Genetic Optimization"/></tocitem></tocitem><tocitem text="EvA2 Modules"><tocitem text="Getting Started"/><tocitem text="Implementing a new Module"/></tocitem></toc>
|
||||
@@ -1,16 +0,0 @@
|
||||
# Select a default module. Set empty or comment out to select from all available modules.
|
||||
#
|
||||
# possible values are the names of module objects as returned by their getName method (!).
|
||||
# DefaultModule = Evolution_Strategy
|
||||
DefaultModule = Genetic_Optimization
|
||||
|
||||
#################### Internals: Do not alter!
|
||||
|
||||
# base class for modules. Do not alter!
|
||||
ModulePackage = eva2.optimization.modules
|
||||
|
||||
# filter class for modules. Do not alter!
|
||||
ModuleFilterClass = eva2.optimization.modules.AbstractModuleAdapter
|
||||
|
||||
# Full EvA2 version number
|
||||
EvA2Version = 2.2.0-rc1
|
||||
@@ -1,3 +0,0 @@
|
||||
Manifest-Version: 1.0
|
||||
Main-Class: eva2.gui.Main
|
||||
|
||||
@@ -1,674 +0,0 @@
|
||||
GNU GENERAL PUBLIC LICENSE
|
||||
Version 3, 29 June 2007
|
||||
|
||||
Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
|
||||
Everyone is permitted to copy and distribute verbatim copies
|
||||
of this license document, but changing it is not allowed.
|
||||
|
||||
Preamble
|
||||
|
||||
The GNU General Public License is a free, copyleft license for
|
||||
software and other kinds of works.
|
||||
|
||||
The licenses for most software and other practical works are designed
|
||||
to take away your freedom to share and change the works. By contrast,
|
||||
the GNU General Public License is intended to guarantee your freedom to
|
||||
share and change all versions of a program--to make sure it remains free
|
||||
software for all its users. We, the Free Software Foundation, use the
|
||||
GNU General Public License for most of our software; it applies also to
|
||||
any other work released this way by its authors. You can apply it to
|
||||
your programs, too.
|
||||
|
||||
When we speak of free software, we are referring to freedom, not
|
||||
price. Our General Public Licenses are designed to make sure that you
|
||||
have the freedom to distribute copies of free software (and charge for
|
||||
them if you wish), that you receive source code or can get it if you
|
||||
want it, that you can change the software or use pieces of it in new
|
||||
free programs, and that you know you can do these things.
|
||||
|
||||
To protect your rights, we need to prevent others from denying you
|
||||
these rights or asking you to surrender the rights. Therefore, you have
|
||||
certain responsibilities if you distribute copies of the software, or if
|
||||
you modify it: responsibilities to respect the freedom of others.
|
||||
|
||||
For example, if you distribute copies of such a program, whether
|
||||
gratis or for a fee, you must pass on to the recipients the same
|
||||
freedoms that you received. You must make sure that they, too, receive
|
||||
or can get the source code. And you must show them these terms so they
|
||||
know their rights.
|
||||
|
||||
Developers that use the GNU GPL protect your rights with two steps:
|
||||
(1) assert copyright on the software, and (2) offer you this License
|
||||
giving you legal permission to copy, distribute and/or modify it.
|
||||
|
||||
For the developers' and authors' protection, the GPL clearly explains
|
||||
that there is no warranty for this free software. For both users' and
|
||||
authors' sake, the GPL requires that modified versions be marked as
|
||||
changed, so that their problems will not be attributed erroneously to
|
||||
authors of previous versions.
|
||||
|
||||
Some devices are designed to deny users access to install or run
|
||||
modified versions of the software inside them, although the manufacturer
|
||||
can do so. This is fundamentally incompatible with the aim of
|
||||
protecting users' freedom to change the software. The systematic
|
||||
pattern of such abuse occurs in the area of products for individuals to
|
||||
use, which is precisely where it is most unacceptable. Therefore, we
|
||||
have designed this version of the GPL to prohibit the practice for those
|
||||
products. If such problems arise substantially in other domains, we
|
||||
stand ready to extend this provision to those domains in future versions
|
||||
of the GPL, as needed to protect the freedom of users.
|
||||
|
||||
Finally, every program is threatened constantly by software patents.
|
||||
States should not allow patents to restrict development and use of
|
||||
software on general-purpose computers, but in those that do, we wish to
|
||||
avoid the special danger that patents applied to a free program could
|
||||
make it effectively proprietary. To prevent this, the GPL assures that
|
||||
patents cannot be used to render the program non-free.
|
||||
|
||||
The precise terms and conditions for copying, distribution and
|
||||
modification follow.
|
||||
|
||||
TERMS AND CONDITIONS
|
||||
|
||||
0. Definitions.
|
||||
|
||||
"This License" refers to version 3 of the GNU General Public License.
|
||||
|
||||
"Copyright" also means copyright-like laws that apply to other kinds of
|
||||
works, such as semiconductor masks.
|
||||
|
||||
"The Program" refers to any copyrightable work licensed under this
|
||||
License. Each licensee is addressed as "you". "Licensees" and
|
||||
"recipients" may be individuals or organizations.
|
||||
|
||||
To "modify" a work means to copy from or adapt all or part of the work
|
||||
in a fashion requiring copyright permission, other than the making of an
|
||||
exact copy. The resulting work is called a "modified version" of the
|
||||
earlier work or a work "based on" the earlier work.
|
||||
|
||||
A "covered work" means either the unmodified Program or a work based
|
||||
on the Program.
|
||||
|
||||
To "propagate" a work means to do anything with it that, without
|
||||
permission, would make you directly or secondarily liable for
|
||||
infringement under applicable copyright law, except executing it on a
|
||||
computer or modifying a private copy. Propagation includes copying,
|
||||
distribution (with or without modification), making available to the
|
||||
public, and in some countries other activities as well.
|
||||
|
||||
To "convey" a work means any kind of propagation that enables other
|
||||
parties to make or receive copies. Mere interaction with a user through
|
||||
a computer network, with no transfer of a copy, is not conveying.
|
||||
|
||||
An interactive user interface displays "Appropriate Legal Notices"
|
||||
to the extent that it includes a convenient and prominently visible
|
||||
feature that (1) displays an appropriate copyright notice, and (2)
|
||||
tells the user that there is no warranty for the work (except to the
|
||||
extent that warranties are provided), that licensees may convey the
|
||||
work under this License, and how to view a copy of this License. If
|
||||
the interface presents a list of user commands or options, such as a
|
||||
menu, a prominent item in the list meets this criterion.
|
||||
|
||||
1. Source Code.
|
||||
|
||||
The "source code" for a work means the preferred form of the work
|
||||
for making modifications to it. "Object code" means any non-source
|
||||
form of a work.
|
||||
|
||||
A "Standard Interface" means an interface that either is an official
|
||||
standard defined by a recognized standards body, or, in the case of
|
||||
interfaces specified for a particular programming language, one that
|
||||
is widely used among developers working in that language.
|
||||
|
||||
The "System Libraries" of an executable work include anything, other
|
||||
than the work as a whole, that (a) is included in the normal form of
|
||||
packaging a Major Component, but which is not part of that Major
|
||||
Component, and (b) serves only to enable use of the work with that
|
||||
Major Component, or to implement a Standard Interface for which an
|
||||
implementation is available to the public in source code form. A
|
||||
"Major Component", in this context, means a major essential component
|
||||
(kernel, window system, and so on) of the specific operating system
|
||||
(if any) on which the executable work runs, or a compiler used to
|
||||
produce the work, or an object code interpreter used to run it.
|
||||
|
||||
The "Corresponding Source" for a work in object code form means all
|
||||
the source code needed to generate, install, and (for an executable
|
||||
work) run the object code and to modify the work, including scripts to
|
||||
control those activities. However, it does not include the work's
|
||||
System Libraries, or general-purpose tools or generally available free
|
||||
programs which are used unmodified in performing those activities but
|
||||
which are not part of the work. For example, Corresponding Source
|
||||
includes interface definition files associated with source files for
|
||||
the work, and the source code for shared libraries and dynamically
|
||||
linked subprograms that the work is specifically designed to require,
|
||||
such as by intimate data communication or control flow between those
|
||||
subprograms and other parts of the work.
|
||||
|
||||
The Corresponding Source need not include anything that users
|
||||
can regenerate automatically from other parts of the Corresponding
|
||||
Source.
|
||||
|
||||
The Corresponding Source for a work in source code form is that
|
||||
same work.
|
||||
|
||||
2. Basic Permissions.
|
||||
|
||||
All rights granted under this License are granted for the term of
|
||||
copyright on the Program, and are irrevocable provided the stated
|
||||
conditions are met. This License explicitly affirms your unlimited
|
||||
permission to run the unmodified Program. The output from running a
|
||||
covered work is covered by this License only if the output, given its
|
||||
content, constitutes a covered work. This License acknowledges your
|
||||
rights of fair use or other equivalent, as provided by copyright law.
|
||||
|
||||
You may make, run and propagate covered works that you do not
|
||||
convey, without conditions so long as your license otherwise remains
|
||||
in force. You may convey covered works to others for the sole purpose
|
||||
of having them make modifications exclusively for you, or provide you
|
||||
with facilities for running those works, provided that you comply with
|
||||
the terms of this License in conveying all material for which you do
|
||||
not control copyright. Those thus making or running the covered works
|
||||
for you must do so exclusively on your behalf, under your direction
|
||||
and control, on terms that prohibit them from making any copies of
|
||||
your copyrighted material outside their relationship with you.
|
||||
|
||||
Conveying under any other circumstances is permitted solely under
|
||||
the conditions stated below. Sublicensing is not allowed; section 10
|
||||
makes it unnecessary.
|
||||
|
||||
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
|
||||
|
||||
No covered work shall be deemed part of an effective technological
|
||||
measure under any applicable law fulfilling obligations under article
|
||||
11 of the WIPO copyright treaty adopted on 20 December 1996, or
|
||||
similar laws prohibiting or restricting circumvention of such
|
||||
measures.
|
||||
|
||||
When you convey a covered work, you waive any legal power to forbid
|
||||
circumvention of technological measures to the extent such circumvention
|
||||
is effected by exercising rights under this License with respect to
|
||||
the covered work, and you disclaim any intention to limit operation or
|
||||
modification of the work as a means of enforcing, against the work's
|
||||
users, your or third parties' legal rights to forbid circumvention of
|
||||
technological measures.
|
||||
|
||||
4. Conveying Verbatim Copies.
|
||||
|
||||
You may convey verbatim copies of the Program's source code as you
|
||||
receive it, in any medium, provided that you conspicuously and
|
||||
appropriately publish on each copy an appropriate copyright notice;
|
||||
keep intact all notices stating that this License and any
|
||||
non-permissive terms added in accord with section 7 apply to the code;
|
||||
keep intact all notices of the absence of any warranty; and give all
|
||||
recipients a copy of this License along with the Program.
|
||||
|
||||
You may charge any price or no price for each copy that you convey,
|
||||
and you may offer support or warranty protection for a fee.
|
||||
|
||||
5. Conveying Modified Source Versions.
|
||||
|
||||
You may convey a work based on the Program, or the modifications to
|
||||
produce it from the Program, in the form of source code under the
|
||||
terms of section 4, provided that you also meet all of these conditions:
|
||||
|
||||
a) The work must carry prominent notices stating that you modified
|
||||
it, and giving a relevant date.
|
||||
|
||||
b) The work must carry prominent notices stating that it is
|
||||
released under this License and any conditions added under section
|
||||
7. This requirement modifies the requirement in section 4 to
|
||||
"keep intact all notices".
|
||||
|
||||
c) You must license the entire work, as a whole, under this
|
||||
License to anyone who comes into possession of a copy. This
|
||||
License will therefore apply, along with any applicable section 7
|
||||
additional terms, to the whole of the work, and all its parts,
|
||||
regardless of how they are packaged. This License gives no
|
||||
permission to license the work in any other way, but it does not
|
||||
invalidate such permission if you have separately received it.
|
||||
|
||||
d) If the work has interactive user interfaces, each must display
|
||||
Appropriate Legal Notices; however, if the Program has interactive
|
||||
interfaces that do not display Appropriate Legal Notices, your
|
||||
work need not make them do so.
|
||||
|
||||
A compilation of a covered work with other separate and independent
|
||||
works, which are not by their nature extensions of the covered work,
|
||||
and which are not combined with it such as to form a larger program,
|
||||
in or on a volume of a storage or distribution medium, is called an
|
||||
"aggregate" if the compilation and its resulting copyright are not
|
||||
used to limit the access or legal rights of the compilation's users
|
||||
beyond what the individual works permit. Inclusion of a covered work
|
||||
in an aggregate does not cause this License to apply to the other
|
||||
parts of the aggregate.
|
||||
|
||||
6. Conveying Non-Source Forms.
|
||||
|
||||
You may convey a covered work in object code form under the terms
|
||||
of sections 4 and 5, provided that you also convey the
|
||||
machine-readable Corresponding Source under the terms of this License,
|
||||
in one of these ways:
|
||||
|
||||
a) Convey the object code in, or embodied in, a physical product
|
||||
(including a physical distribution medium), accompanied by the
|
||||
Corresponding Source fixed on a durable physical medium
|
||||
customarily used for software interchange.
|
||||
|
||||
b) Convey the object code in, or embodied in, a physical product
|
||||
(including a physical distribution medium), accompanied by a
|
||||
written offer, valid for at least three years and valid for as
|
||||
long as you offer spare parts or customer support for that product
|
||||
model, to give anyone who possesses the object code either (1) a
|
||||
copy of the Corresponding Source for all the software in the
|
||||
product that is covered by this License, on a durable physical
|
||||
medium customarily used for software interchange, for a price no
|
||||
more than your reasonable cost of physically performing this
|
||||
conveying of source, or (2) access to copy the
|
||||
Corresponding Source from a network server at no charge.
|
||||
|
||||
c) Convey individual copies of the object code with a copy of the
|
||||
written offer to provide the Corresponding Source. This
|
||||
alternative is allowed only occasionally and noncommercially, and
|
||||
only if you received the object code with such an offer, in accord
|
||||
with subsection 6b.
|
||||
|
||||
d) Convey the object code by offering access from a designated
|
||||
place (gratis or for a charge), and offer equivalent access to the
|
||||
Corresponding Source in the same way through the same place at no
|
||||
further charge. You need not require recipients to copy the
|
||||
Corresponding Source along with the object code. If the place to
|
||||
copy the object code is a network server, the Corresponding Source
|
||||
may be on a different server (operated by you or a third party)
|
||||
that supports equivalent copying facilities, provided you maintain
|
||||
clear directions next to the object code saying where to find the
|
||||
Corresponding Source. Regardless of what server hosts the
|
||||
Corresponding Source, you remain obligated to ensure that it is
|
||||
available for as long as needed to satisfy these requirements.
|
||||
|
||||
e) Convey the object code using peer-to-peer transmission, provided
|
||||
you inform other peers where the object code and Corresponding
|
||||
Source of the work are being offered to the general public at no
|
||||
charge under subsection 6d.
|
||||
|
||||
A separable portion of the object code, whose source code is excluded
|
||||
from the Corresponding Source as a System Library, need not be
|
||||
included in conveying the object code work.
|
||||
|
||||
A "User Product" is either (1) a "consumer product", which means any
|
||||
tangible personal property which is normally used for personal, family,
|
||||
or household purposes, or (2) anything designed or sold for incorporation
|
||||
into a dwelling. In determining whether a product is a consumer product,
|
||||
doubtful cases shall be resolved in favor of coverage. For a particular
|
||||
product received by a particular user, "normally used" refers to a
|
||||
typical or common use of that class of product, regardless of the status
|
||||
of the particular user or of the way in which the particular user
|
||||
actually uses, or expects or is expected to use, the product. A product
|
||||
is a consumer product regardless of whether the product has substantial
|
||||
commercial, industrial or non-consumer uses, unless such uses represent
|
||||
the only significant mode of use of the product.
|
||||
|
||||
"Installation Information" for a User Product means any methods,
|
||||
procedures, authorization keys, or other information required to install
|
||||
and execute modified versions of a covered work in that User Product from
|
||||
a modified version of its Corresponding Source. The information must
|
||||
suffice to ensure that the continued functioning of the modified object
|
||||
code is in no case prevented or interfered with solely because
|
||||
modification has been made.
|
||||
|
||||
If you convey an object code work under this section in, or with, or
|
||||
specifically for use in, a User Product, and the conveying occurs as
|
||||
part of a transaction in which the right of possession and use of the
|
||||
User Product is transferred to the recipient in perpetuity or for a
|
||||
fixed term (regardless of how the transaction is characterized), the
|
||||
Corresponding Source conveyed under this section must be accompanied
|
||||
by the Installation Information. But this requirement does not apply
|
||||
if neither you nor any third party retains the ability to install
|
||||
modified object code on the User Product (for example, the work has
|
||||
been installed in ROM).
|
||||
|
||||
The requirement to provide Installation Information does not include a
|
||||
requirement to continue to provide support service, warranty, or updates
|
||||
for a work that has been modified or installed by the recipient, or for
|
||||
the User Product in which it has been modified or installed. Access to a
|
||||
network may be denied when the modification itself materially and
|
||||
adversely affects the operation of the network or violates the rules and
|
||||
protocols for communication across the network.
|
||||
|
||||
Corresponding Source conveyed, and Installation Information provided,
|
||||
in accord with this section must be in a format that is publicly
|
||||
documented (and with an implementation available to the public in
|
||||
source code form), and must require no special password or key for
|
||||
unpacking, reading or copying.
|
||||
|
||||
7. Additional Terms.
|
||||
|
||||
"Additional permissions" are terms that supplement the terms of this
|
||||
License by making exceptions from one or more of its conditions.
|
||||
Additional permissions that are applicable to the entire Program shall
|
||||
be treated as though they were included in this License, to the extent
|
||||
that they are valid under applicable law. If additional permissions
|
||||
apply only to part of the Program, that part may be used separately
|
||||
under those permissions, but the entire Program remains governed by
|
||||
this License without regard to the additional permissions.
|
||||
|
||||
When you convey a copy of a covered work, you may at your option
|
||||
remove any additional permissions from that copy, or from any part of
|
||||
it. (Additional permissions may be written to require their own
|
||||
removal in certain cases when you modify the work.) You may place
|
||||
additional permissions on material, added by you to a covered work,
|
||||
for which you have or can give appropriate copyright permission.
|
||||
|
||||
Notwithstanding any other provision of this License, for material you
|
||||
add to a covered work, you may (if authorized by the copyright holders of
|
||||
that material) supplement the terms of this License with terms:
|
||||
|
||||
a) Disclaiming warranty or limiting liability differently from the
|
||||
terms of sections 15 and 16 of this License; or
|
||||
|
||||
b) Requiring preservation of specified reasonable legal notices or
|
||||
author attributions in that material or in the Appropriate Legal
|
||||
Notices displayed by works containing it; or
|
||||
|
||||
c) Prohibiting misrepresentation of the origin of that material, or
|
||||
requiring that modified versions of such material be marked in
|
||||
reasonable ways as different from the original version; or
|
||||
|
||||
d) Limiting the use for publicity purposes of names of licensors or
|
||||
authors of the material; or
|
||||
|
||||
e) Declining to grant rights under trademark law for use of some
|
||||
trade names, trademarks, or service marks; or
|
||||
|
||||
f) Requiring indemnification of licensors and authors of that
|
||||
material by anyone who conveys the material (or modified versions of
|
||||
it) with contractual assumptions of liability to the recipient, for
|
||||
any liability that these contractual assumptions directly impose on
|
||||
those licensors and authors.
|
||||
|
||||
All other non-permissive additional terms are considered "further
|
||||
restrictions" within the meaning of section 10. If the Program as you
|
||||
received it, or any part of it, contains a notice stating that it is
|
||||
governed by this License along with a term that is a further
|
||||
restriction, you may remove that term. If a license document contains
|
||||
a further restriction but permits relicensing or conveying under this
|
||||
License, you may add to a covered work material governed by the terms
|
||||
of that license document, provided that the further restriction does
|
||||
not survive such relicensing or conveying.
|
||||
|
||||
If you add terms to a covered work in accord with this section, you
|
||||
must place, in the relevant source files, a statement of the
|
||||
additional terms that apply to those files, or a notice indicating
|
||||
where to find the applicable terms.
|
||||
|
||||
Additional terms, permissive or non-permissive, may be stated in the
|
||||
form of a separately written license, or stated as exceptions;
|
||||
the above requirements apply either way.
|
||||
|
||||
8. Termination.
|
||||
|
||||
You may not propagate or modify a covered work except as expressly
|
||||
provided under this License. Any attempt otherwise to propagate or
|
||||
modify it is void, and will automatically terminate your rights under
|
||||
this License (including any patent licenses granted under the third
|
||||
paragraph of section 11).
|
||||
|
||||
However, if you cease all violation of this License, then your
|
||||
license from a particular copyright holder is reinstated (a)
|
||||
provisionally, unless and until the copyright holder explicitly and
|
||||
finally terminates your license, and (b) permanently, if the copyright
|
||||
holder fails to notify you of the violation by some reasonable means
|
||||
prior to 60 days after the cessation.
|
||||
|
||||
Moreover, your license from a particular copyright holder is
|
||||
reinstated permanently if the copyright holder notifies you of the
|
||||
violation by some reasonable means, this is the first time you have
|
||||
received notice of violation of this License (for any work) from that
|
||||
copyright holder, and you cure the violation prior to 30 days after
|
||||
your receipt of the notice.
|
||||
|
||||
Termination of your rights under this section does not terminate the
|
||||
licenses of parties who have received copies or rights from you under
|
||||
this License. If your rights have been terminated and not permanently
|
||||
reinstated, you do not qualify to receive new licenses for the same
|
||||
material under section 10.
|
||||
|
||||
9. Acceptance Not Required for Having Copies.
|
||||
|
||||
You are not required to accept this License in order to receive or
|
||||
run a copy of the Program. Ancillary propagation of a covered work
|
||||
occurring solely as a consequence of using peer-to-peer transmission
|
||||
to receive a copy likewise does not require acceptance. However,
|
||||
nothing other than this License grants you permission to propagate or
|
||||
modify any covered work. These actions infringe copyright if you do
|
||||
not accept this License. Therefore, by modifying or propagating a
|
||||
covered work, you indicate your acceptance of this License to do so.
|
||||
|
||||
10. Automatic Licensing of Downstream Recipients.
|
||||
|
||||
Each time you convey a covered work, the recipient automatically
|
||||
receives a license from the original licensors, to run, modify and
|
||||
propagate that work, subject to this License. You are not responsible
|
||||
for enforcing compliance by third parties with this License.
|
||||
|
||||
An "entity transaction" is a transaction transferring control of an
|
||||
organization, or substantially all assets of one, or subdividing an
|
||||
organization, or merging organizations. If propagation of a covered
|
||||
work results from an entity transaction, each party to that
|
||||
transaction who receives a copy of the work also receives whatever
|
||||
licenses to the work the party's predecessor in interest had or could
|
||||
give under the previous paragraph, plus a right to possession of the
|
||||
Corresponding Source of the work from the predecessor in interest, if
|
||||
the predecessor has it or can get it with reasonable efforts.
|
||||
|
||||
You may not impose any further restrictions on the exercise of the
|
||||
rights granted or affirmed under this License. For example, you may
|
||||
not impose a license fee, royalty, or other charge for exercise of
|
||||
rights granted under this License, and you may not initiate litigation
|
||||
(including a cross-claim or counterclaim in a lawsuit) alleging that
|
||||
any patent claim is infringed by making, using, selling, offering for
|
||||
sale, or importing the Program or any portion of it.
|
||||
|
||||
11. Patents.
|
||||
|
||||
A "contributor" is a copyright holder who authorizes use under this
|
||||
License of the Program or a work on which the Program is based. The
|
||||
work thus licensed is called the contributor's "contributor version".
|
||||
|
||||
A contributor's "essential patent claims" are all patent claims
|
||||
owned or controlled by the contributor, whether already acquired or
|
||||
hereafter acquired, that would be infringed by some manner, permitted
|
||||
by this License, of making, using, or selling its contributor version,
|
||||
but do not include claims that would be infringed only as a
|
||||
consequence of further modification of the contributor version. For
|
||||
purposes of this definition, "control" includes the right to grant
|
||||
patent sublicenses in a manner consistent with the requirements of
|
||||
this License.
|
||||
|
||||
Each contributor grants you a non-exclusive, worldwide, royalty-free
|
||||
patent license under the contributor's essential patent claims, to
|
||||
make, use, sell, offer for sale, import and otherwise run, modify and
|
||||
propagate the contents of its contributor version.
|
||||
|
||||
In the following three paragraphs, a "patent license" is any express
|
||||
agreement or commitment, however denominated, not to enforce a patent
|
||||
(such as an express permission to practice a patent or covenant not to
|
||||
sue for patent infringement). To "grant" such a patent license to a
|
||||
party means to make such an agreement or commitment not to enforce a
|
||||
patent against the party.
|
||||
|
||||
If you convey a covered work, knowingly relying on a patent license,
|
||||
and the Corresponding Source of the work is not available for anyone
|
||||
to copy, free of charge and under the terms of this License, through a
|
||||
publicly available network server or other readily accessible means,
|
||||
then you must either (1) cause the Corresponding Source to be so
|
||||
available, or (2) arrange to deprive yourself of the benefit of the
|
||||
patent license for this particular work, or (3) arrange, in a manner
|
||||
consistent with the requirements of this License, to extend the patent
|
||||
license to downstream recipients. "Knowingly relying" means you have
|
||||
actual knowledge that, but for the patent license, your conveying the
|
||||
covered work in a country, or your recipient's use of the covered work
|
||||
in a country, would infringe one or more identifiable patents in that
|
||||
country that you have reason to believe are valid.
|
||||
|
||||
If, pursuant to or in connection with a single transaction or
|
||||
arrangement, you convey, or propagate by procuring conveyance of, a
|
||||
covered work, and grant a patent license to some of the parties
|
||||
receiving the covered work authorizing them to use, propagate, modify
|
||||
or convey a specific copy of the covered work, then the patent license
|
||||
you grant is automatically extended to all recipients of the covered
|
||||
work and works based on it.
|
||||
|
||||
A patent license is "discriminatory" if it does not include within
|
||||
the scope of its coverage, prohibits the exercise of, or is
|
||||
conditioned on the non-exercise of one or more of the rights that are
|
||||
specifically granted under this License. You may not convey a covered
|
||||
work if you are a party to an arrangement with a third party that is
|
||||
in the business of distributing software, under which you make payment
|
||||
to the third party based on the extent of your activity of conveying
|
||||
the work, and under which the third party grants, to any of the
|
||||
parties who would receive the covered work from you, a discriminatory
|
||||
patent license (a) in connection with copies of the covered work
|
||||
conveyed by you (or copies made from those copies), or (b) primarily
|
||||
for and in connection with specific products or compilations that
|
||||
contain the covered work, unless you entered into that arrangement,
|
||||
or that patent license was granted, prior to 28 March 2007.
|
||||
|
||||
Nothing in this License shall be construed as excluding or limiting
|
||||
any implied license or other defenses to infringement that may
|
||||
otherwise be available to you under applicable patent law.
|
||||
|
||||
12. No Surrender of Others' Freedom.
|
||||
|
||||
If conditions are imposed on you (whether by court order, agreement or
|
||||
otherwise) that contradict the conditions of this License, they do not
|
||||
excuse you from the conditions of this License. If you cannot convey a
|
||||
covered work so as to satisfy simultaneously your obligations under this
|
||||
License and any other pertinent obligations, then as a consequence you may
|
||||
not convey it at all. For example, if you agree to terms that obligate you
|
||||
to collect a royalty for further conveying from those to whom you convey
|
||||
the Program, the only way you could satisfy both those terms and this
|
||||
License would be to refrain entirely from conveying the Program.
|
||||
|
||||
13. Use with the GNU Affero General Public License.
|
||||
|
||||
Notwithstanding any other provision of this License, you have
|
||||
permission to link or combine any covered work with a work licensed
|
||||
under version 3 of the GNU Affero General Public License into a single
|
||||
combined work, and to convey the resulting work. The terms of this
|
||||
License will continue to apply to the part which is the covered work,
|
||||
but the special requirements of the GNU Affero General Public License,
|
||||
section 13, concerning interaction through a network will apply to the
|
||||
combination as such.
|
||||
|
||||
14. Revised Versions of this License.
|
||||
|
||||
The Free Software Foundation may publish revised and/or new versions of
|
||||
the GNU General Public License from time to time. Such new versions will
|
||||
be similar in spirit to the present version, but may differ in detail to
|
||||
address new problems or concerns.
|
||||
|
||||
Each version is given a distinguishing version number. If the
|
||||
Program specifies that a certain numbered version of the GNU General
|
||||
Public License "or any later version" applies to it, you have the
|
||||
option of following the terms and conditions either of that numbered
|
||||
version or of any later version published by the Free Software
|
||||
Foundation. If the Program does not specify a version number of the
|
||||
GNU General Public License, you may choose any version ever published
|
||||
by the Free Software Foundation.
|
||||
|
||||
If the Program specifies that a proxy can decide which future
|
||||
versions of the GNU General Public License can be used, that proxy's
|
||||
public statement of acceptance of a version permanently authorizes you
|
||||
to choose that version for the Program.
|
||||
|
||||
Later license versions may give you additional or different
|
||||
permissions. However, no additional obligations are imposed on any
|
||||
author or copyright holder as a result of your choosing to follow a
|
||||
later version.
|
||||
|
||||
15. Disclaimer of Warranty.
|
||||
|
||||
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
|
||||
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
|
||||
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
|
||||
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
|
||||
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
||||
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
|
||||
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
|
||||
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
|
||||
|
||||
16. Limitation of Liability.
|
||||
|
||||
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
|
||||
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
|
||||
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
|
||||
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
|
||||
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
|
||||
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
|
||||
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
|
||||
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
|
||||
SUCH DAMAGES.
|
||||
|
||||
17. Interpretation of Sections 15 and 16.
|
||||
|
||||
If the disclaimer of warranty and limitation of liability provided
|
||||
above cannot be given local legal effect according to their terms,
|
||||
reviewing courts shall apply local law that most closely approximates
|
||||
an absolute waiver of all civil liability in connection with the
|
||||
Program, unless a warranty or assumption of liability accompanies a
|
||||
copy of the Program in return for a fee.
|
||||
|
||||
END OF TERMS AND CONDITIONS
|
||||
|
||||
How to Apply These Terms to Your New Programs
|
||||
|
||||
If you develop a new program, and you want it to be of the greatest
|
||||
possible use to the public, the best way to achieve this is to make it
|
||||
free software which everyone can redistribute and change under these terms.
|
||||
|
||||
To do so, attach the following notices to the program. It is safest
|
||||
to attach them to the start of each source file to most effectively
|
||||
state the exclusion of warranty; and each file should have at least
|
||||
the "copyright" line and a pointer to where the full notice is found.
|
||||
|
||||
<one line to give the program's name and a brief idea of what it does.>
|
||||
Copyright (C) <year> <name of author>
|
||||
|
||||
This program is free software: you can redistribute it and/or modify
|
||||
it under the terms of the GNU General Public License as published by
|
||||
the Free Software Foundation, either version 3 of the License, or
|
||||
(at your option) any later version.
|
||||
|
||||
This program is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU General Public License
|
||||
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
|
||||
Also add information on how to contact you by electronic and paper mail.
|
||||
|
||||
If the program does terminal interaction, make it output a short
|
||||
notice like this when it starts in an interactive mode:
|
||||
|
||||
<program> Copyright (C) <year> <name of author>
|
||||
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
|
||||
This is free software, and you are welcome to redistribute it
|
||||
under certain conditions; type `show c' for details.
|
||||
|
||||
The hypothetical commands `show w' and `show c' should show the appropriate
|
||||
parts of the General Public License. Of course, your program's commands
|
||||
might be different; for a GUI interface, you would use an "about box".
|
||||
|
||||
You should also get your employer (if you work as a programmer) or school,
|
||||
if any, to sign a "copyright disclaimer" for the program, if necessary.
|
||||
For more information on this, and how to apply and follow the GNU GPL, see
|
||||
<http://www.gnu.org/licenses/>.
|
||||
|
||||
The GNU General Public License does not permit incorporating your program
|
||||
into proprietary programs. If your program is a subroutine library, you
|
||||
may consider it more useful to permit linking proprietary applications with
|
||||
the library. If this is what you want to do, use the GNU Lesser General
|
||||
Public License instead of this License. But first, please read
|
||||
<http://www.gnu.org/philosophy/why-not-lgpl.html>.
|
||||
@@ -1,14 +0,0 @@
|
||||
<html>
|
||||
<head>
|
||||
<title>Default page</title>
|
||||
</head>
|
||||
<body>
|
||||
<h1 align="center">HTML description file is missing</h1>
|
||||
<center>
|
||||
</center><br>
|
||||
Unfortunately there is no additional HTML description
|
||||
file to this class. Please refer to the JOptDocumentation
|
||||
file or the JavaDoc for more information on this class.
|
||||
|
||||
</body>
|
||||
</html>
|
||||
@@ -1,25 +0,0 @@
|
||||
<html>
|
||||
<head>
|
||||
<title>Evolution Strategy - ES</title>
|
||||
</head>
|
||||
<body>
|
||||
<h1 align="center">Evolution Strategy - ES</h1>
|
||||
<center>
|
||||
</center><br>
|
||||
An ES works on a population of real valued solutions
|
||||
by repeated use of evolutionary operators like reproduction,
|
||||
recombination and mutation.
|
||||
λ offspring individuals are generated from μ parents
|
||||
by recombination and mutation (with μ < λ).
|
||||
<br>
|
||||
After evaluating the fitness of the λ
|
||||
offspring individuals, the comma-strategy selects the μ individuals
|
||||
with the best fitness as parent population for the next generation.
|
||||
On the other hand, a plus-strategy selects the best μ individuals
|
||||
from the aggregation of parents and offspring individuals, so in this
|
||||
case the best individual is guaranteed to survive.
|
||||
In general, however, the comma-strategy is more robust and can easier
|
||||
escape from local optima, which is why it is usually the standard selection.
|
||||
<br>
|
||||
</body>
|
||||
</html>
|
||||
@@ -1,30 +0,0 @@
|
||||
<html>
|
||||
<head>
|
||||
<title>Increasing Population Size ES - IPOP-ES</title>
|
||||
</head>
|
||||
<body>
|
||||
<h1 align="center">Increasing Population Size ES - IPOP-ES</h1>
|
||||
<center>
|
||||
</center><br>
|
||||
<p>
|
||||
This class implements the IPOP (increased population size) restart strategy ES, which increases
|
||||
the ES population size (i.e., lambda) after phases of stagnation and then restarts the optimization
|
||||
by reinitializing the individuals and operators.<br>
|
||||
Stagnation is for this implementation defined by a FitnessConvergenceTerminator instance
|
||||
which terminates if the absolute change in fitness is below a threshold (default 10e-12) for a
|
||||
certain number of generations (default: 10+floor(30*n/lambda) for problem dimension n).
|
||||
</p>
|
||||
<p>
|
||||
If the MutateESRankMuCMA mutation operator is employed, additional criteria are used for restarts,
|
||||
such as numeric conditions of the covariance matrix.
|
||||
Lambda is increased multiplicatively for every restart, and typical initial values are
|
||||
mu=5, lambda=10, incFact=2.
|
||||
The IPOP-CMA-ES won the CEC 2005 benchmark challenge.
|
||||
Refer to Auger&Hansen 05 for more details.
|
||||
</p>
|
||||
<br>
|
||||
A.Auger & N.Hansen. <i>A Restart CMA Evolution Strategy With Increasing Population Size</i>. CEC 2005.
|
||||
|
||||
|
||||
</body>
|
||||
</html>
|
||||
@@ -1,30 +0,0 @@
|
||||
<html>
|
||||
<head>
|
||||
<title>Schwefels's (sine root) function</title>
|
||||
</head>
|
||||
<body>
|
||||
<h1 align="center">Schwefel's (sine root) function</h1>
|
||||
<center>
|
||||
<img src="../images/f13-tex-500.jpg" width="650" height="64" align="center">
|
||||
</center>
|
||||
<p>
|
||||
Schwefel's (sine root) function is highly multimodal and has no global basin of attraction. The optimum at a fitness of f(x*)=0 lies at x*=420.9687. Schwefel's sine root is a tough challenge for any global optimizer due to the multiple distinct optima. Especially, there is a deceptive nearly optimal solution close to x=(-420.9687)<SUP>n</SUP>.
|
||||
|
||||
<p>
|
||||
|
||||
<p>
|
||||
|
||||
<img src="../images/f13-schwefels-sine-root.jpg" width="667" height="493" border="2" align="center">
|
||||
<br>
|
||||
Schwefels's sine root function in 2D within the co-domain -500 <= <i>x</i> <= 500.
|
||||
<p>
|
||||
|
||||
<hr>
|
||||
More information about Ackley's function can be found at:
|
||||
<p>
|
||||
David. H. Ackley. <i>A connection machine for genetic hillclimbing.</i> Kluwer Academic Publishers, Boston, 1987.
|
||||
<p>
|
||||
Thomas Baeck. <i>Evolutionary Algorithms in Theory and Practice.</i> Oxford University Press, 1996.
|
||||
|
||||
</body>
|
||||
</html>
|
||||
@@ -1,24 +0,0 @@
|
||||
<html>
|
||||
<head>
|
||||
<title>f_1 : Sphere function</title>
|
||||
</head>
|
||||
<body>
|
||||
<h1 align="center">The F1 hyper-parabola function</h1>
|
||||
<center>
|
||||
<img src="../images/f1tex.jpg" width="85" height="95" border="0" align="center">
|
||||
</center><br>
|
||||
The hyper-parabola function is a <i>n</i>-dimensional, axis-symmetric, continuously differentiable, convex function:
|
||||
<p>
|
||||
Because of its simplicity every optimization-algorithm should be able to find its global minimum at <i>x</i>=[0, 0, ... , 0]
|
||||
<p>
|
||||
|
||||
<img src="../images/f1.jpg" width="480" height="360" border="2" align="middle">
|
||||
|
||||
<hr>
|
||||
More information about the F1 function can be found at:
|
||||
<p>
|
||||
|
||||
Kenneth De Jong. <i>An analysis of the behaviour of a class of genetic adaptive systems.</i> Dissertation, University of Michigan, 1975. Diss. Abstr. Int. 36(10), 5140B, University Microflims No. 76-9381.
|
||||
|
||||
</body>
|
||||
</html>
|
||||
@@ -1,36 +0,0 @@
|
||||
<html>
|
||||
<head>
|
||||
<title>Generalized Rosenbrock's function</title>
|
||||
</head>
|
||||
<body>
|
||||
<h1 align="center">Generalized Rosenbrock's function</h1>
|
||||
<center>
|
||||
<img src="../images/rosenbrocktex.jpg" width="500" height="78">
|
||||
</center>
|
||||
<p>
|
||||
This function is unimodal and continuous, but the global optimum is hard to find, because of independence through the term (<i>x</i>_(<i>i</i>+1) - <i>x_i</i>*<i>x_i</i>)^2 between contiguous parameters.
|
||||
<p>
|
||||
<img src="../images/f85.jpg" border="2">
|
||||
<br>
|
||||
Rosenbrock's function within the domain -5 <= <i>x</i> <= 5.
|
||||
<p>
|
||||
The global optimum is located in a parabolic formed valley (among the curve x^2 = x_1^2), which has a flat ground.
|
||||
<br>
|
||||
<img src="../images/f81.jpg" border="2">
|
||||
<br>
|
||||
The function close to its global optimum, which is: f(<i>x</i>) = f(1, 1, ... , 1) = 0.
|
||||
<p>
|
||||
Rosenbrock' function is not symmetric, not convex and not linear.
|
||||
|
||||
<hr>
|
||||
More information about Rosenbrock's function can be found at:
|
||||
<p>
|
||||
Kenneth De Jong. <i>An analysis of the behaviour of a class of genetic adaptive systems.</i> Dissertation, University of Michigan, 1975. Diss. Abstr. Int. 36(10), 5140B, University Microflims No. 76-9381.
|
||||
<p>
|
||||
Hans Paul Schwefel. <i>Evolution and optimum seeking.</i> Sixth-Generation Computer Technology Series. John Wiley & Sons, INC., 1995.
|
||||
<p>
|
||||
Darrell Whitley, Soraya Rana, John Dzubera, Keith E. Mathias. <i>Evaluating Evolutionary Algorithms. Artificial Intelligence</i>, 85(1-2):245-276. 1996.
|
||||
<p>
|
||||
Eberhard Schoeneburg, Frank Heinzmann, Sven Feddersen. <i>Genetische Algorithmen und Evolutionstrategien - Eine Einfuehrung in Theorie und Praxis der simulierten Evolution.</i> Addison-Wesley, 1994.
|
||||
</body>
|
||||
</html>
|
||||
@@ -1,29 +0,0 @@
|
||||
<html>
|
||||
<head>
|
||||
<title>The step function</title>
|
||||
</head>
|
||||
<body>
|
||||
<h1 align="center">The Step Function</h1>
|
||||
<center>
|
||||
<img src="../images/steptex.jpg" width="350" height="120" align="center">
|
||||
</center>
|
||||
<p>
|
||||
The idea of this function is the implementation of a flat plateau (slope 0)in an underlying continuous function. It's harder for optimization algortihms to find optima because minor changes of the object variables don't affect the fitness. Therefore no conclusions about the search direction can be made.
|
||||
<p>
|
||||
<img src="../images/step5.jpg" width="480" height="360" border="2" align="center">
|
||||
<p>
|
||||
The step function is symmetric considering the underlying function (here: f(x,y) = f(y,x)), but between the bulk constant plateau-areas not continuously differentiable.
|
||||
<p>
|
||||
Its minimum-area is located in the intervals: <i>f(x)</i>=<i>f</i>([-5.12,-5), ... , [-5.12,-5))=0.
|
||||
<p>
|
||||
<img src="../images/stepopt.jpg" width="480" height="360" border="2" align="center">
|
||||
<hr>
|
||||
More information about the step function can be found at:
|
||||
<p>
|
||||
Thomas Baeck, <i>Evolutionary Algorithms in Theory and Practice.</i> Oxford University Press, 1996.
|
||||
<p>
|
||||
Darrell Whitley, Soraya Rana, John Dzubera, Keith E. Mathias. <i>Evaluating Evolutionary Algorithms. Artificial Intelligence</i>, 85(1-2):245-276. 1996.
|
||||
<p>
|
||||
Eberhard Schoeneburg, Frank Heinzmann, Sven Feddersen. <i>Genetische Algorithmen und Evolutionstrategien - Eine Einfuehrung in Theorie und Praxis der simulierten Evolution.</i> Addison-Wesley, 1994.
|
||||
</body>
|
||||
</html>
|
||||
@@ -1,27 +0,0 @@
|
||||
<html>
|
||||
<head>
|
||||
<title>Schwefel's double sum</title>
|
||||
</head>
|
||||
<body>
|
||||
<h1 align="center">Schwefels double sum</h1>
|
||||
<center>
|
||||
<img src="../images/f2tex.jpg" width="220" height="102" border="0" align="center">
|
||||
</center>
|
||||
<p>
|
||||
Schwefel's double sum is a quadratic minimization problem. Its difficulty increases by the dimension <i>n</i> in <i>O(n^2)</i>. It is used for analysis of correlating mutations.
|
||||
<p>
|
||||
It possesses specific symmetrical properties:<br>
|
||||
|
||||
<img src="../images/schwefelsymmetrie.jpg" width="500" height="104" border="0" align="middle">
|
||||
<p>
|
||||
Its minimum is located at: <i>f(x)</i>=<i>f</i>([0, 0, ... , 0])=0
|
||||
<p>
|
||||
<img src="../images/f2.jpg" width="480" height="360" border="2" align="middle">
|
||||
|
||||
<hr>
|
||||
More information about Schwefel's double sum can be found at:
|
||||
<p>
|
||||
Hans Paul Schwefel. <i>Evolution and optimum seeking.</i> Sixth-Generation Computer Technology Series. John Wiley & Sons, INC., 1995.
|
||||
|
||||
</body>
|
||||
</html>
|
||||
@@ -1,42 +0,0 @@
|
||||
<html>
|
||||
<head>
|
||||
<title>Generalized Rastrigin's function</title>
|
||||
</head>
|
||||
<body>
|
||||
<h1 align="center">Generalized Rastrigin's function</h1>
|
||||
<center>
|
||||
<img src="../images/rastrigintex.jpg" width="500" height="101">
|
||||
</center>
|
||||
<p>
|
||||
Rastrigin's function is symmetric. It is based on the simple <i>parabola function</i> (called f1 in the EvA context), but it is multimodal because a modulation term on the basis of the cosine function is added. This evokes hills and valleys which are misleading local optima.
|
||||
<p>
|
||||
Values used for the following illustrations: <i>A</i>=10, <i>ω</i>=2*π, <i>n</i>=2.
|
||||
|
||||
<br>
|
||||
<img src="../images/rastrigin20.jpg" border="2">
|
||||
|
||||
<br>
|
||||
|
||||
Rastrigin's function within the co-domain -20>=<i>x</i>>=20
|
||||
|
||||
<p>
|
||||
<img src="../images/rastrigin5.jpg" border="2">
|
||||
<br>
|
||||
|
||||
Rastrigin's function within the co-domain -5>=<i>x</i>>=5
|
||||
|
||||
<p>
|
||||
|
||||
Like Ackley's function a simple evolutionary algorithm would get stuck in a local optimum, while a broader searching algorithm would get out of the local optimum closer to the global optimum, which in this case is: f(<i>x</i>) = f(0, 0, ... , 0) = 0.
|
||||
<p>
|
||||
<img src="../images/rastrigin1.jpg" border="2"><br>
|
||||
Rastrigin's function close to its optimum.
|
||||
|
||||
<hr>
|
||||
More information about Rastrigin's function can be found at:
|
||||
<p>
|
||||
Darrell Whitley, Soraya Rana, John Dzubera, Keith E. Mathias. <i>Evaluating Evolutionary Algorithms. Artificial Intelligence</i>, 85(1-2):245-276. 1996.
|
||||
<p>
|
||||
Eberhard Schoeneburg, Frank Heinzmann, Sven Feddersen. <i>Genetische Algorithmen und Evolutionstrategien - Eine Einfuehrung in Theorie und Praxis der simulierten Evolution.</i> Addison-Wesley, 1994.
|
||||
</body>
|
||||
</html>
|
||||
@@ -1,36 +0,0 @@
|
||||
<html>
|
||||
<head>
|
||||
<title>Ackley's function</title>
|
||||
</head>
|
||||
<body>
|
||||
<h1 align="center">Ackley's function</h1>
|
||||
<center>
|
||||
<img src="../images/ackleytex.jpg" width="500" height="58" align="center">
|
||||
</center>
|
||||
<p>
|
||||
Ackley's function is multimodal and symmetrical. It is based on an exponential function and modulated by a cosine function.
|
||||
The outside region is almost planar as to the growing influence of the exponential function.
|
||||
In the center there is a steep hole as to the influence of the cosine function.<br>
|
||||
Its minimum is at: <i>f(x)</i>=<i>f</i>([0, 0, ... , 0])=0.
|
||||
<p>
|
||||
The difficulty for an optimization algorithm is mid-graded because a simple optimization-algorithm like <i>hill-climbing</i> would get stuck in a local minimum. The optimization algorithm has to search a broader environ to overcome the local minimum and get closer to the global optima.
|
||||
|
||||
<p>
|
||||
|
||||
<img src="../images/ackley.jpg" width="480" height="360" border="2" align="center">
|
||||
<br>
|
||||
Ackley's function within the co-domain -20 >= <i>x</i> >= 20, <i>a</i>=20, <i>b</i>=0.2, <i>c</i>=2*π, <i>n</i>=2.
|
||||
<p>
|
||||
|
||||
<img src="../images/ackleyopt.jpg" width="480" height="360" border="2" align="center">
|
||||
<br>
|
||||
Ackley's function close to the optimum.
|
||||
<hr>
|
||||
More information about Ackley's function can be found at:
|
||||
<p>
|
||||
David. H. Ackley. <i>A connection machine for genetic hillclimbing.</i> Kluwer Academic Publishers, Boston, 1987.
|
||||
<p>
|
||||
Thomas Baeck. <i>Evolutionary Algorithms in Theory and Practice.</i> Oxford University Press, 1996.
|
||||
|
||||
</body>
|
||||
</html>
|
||||
@@ -1,19 +0,0 @@
|
||||
<html>
|
||||
<head>
|
||||
<title>Fitness Convergence Terminator</title>
|
||||
</head>
|
||||
<body>
|
||||
<h1 align="center">Fitness Convergence Terminator</h1>
|
||||
<center>
|
||||
</center><br>
|
||||
The fitness convergence terminator stops the optimization, when there has been hardly
|
||||
any change in the best fitness in the population (within percentual or absolute distance) for a certain
|
||||
time, given in generations or fitness calls. In case of multi-objective optimization, the 2-norm of
|
||||
the fitness vector is
|
||||
currently used.<br>
|
||||
Be aware that, if the optimization is allowed to be non-monotonic, such as for (,)-ES strategies,
|
||||
and if the optimum is close to zero, it may happen that the fitness fluctuates due to numeric
|
||||
issues and does not easily converge in a relative way.<br>
|
||||
Check the help for the <a href="PopulationMeasureTerminator.html">PopulationMeasureTerminator</a> for additional information.
|
||||
</body>
|
||||
</html>
|
||||
@@ -1,17 +0,0 @@
|
||||
<html>
|
||||
<head>
|
||||
<title>EvA2 Genetic Optimization</title>
|
||||
</head>
|
||||
<body>
|
||||
<h1 align="center">The EvA2 Genetic Optimization Module</h1>
|
||||
<br>
|
||||
The Genetic Optimization module allows the application of a variety of
|
||||
nature-inspired heuristics within one framework. You can combine several
|
||||
datatypes as representations with specific evolutionary operators and
|
||||
widely independently choose an optimization strategy. Some strategies,
|
||||
however, only work with certain datatypes. Most remarkably, DE and PSO
|
||||
require a real-valued representations for the moment, whereas GA, for example,
|
||||
is typically run with a binary datatype but also works on real valued individuals
|
||||
by just accessing the analoguous evolutionary operators.
|
||||
</body>
|
||||
</html>
|
||||
@@ -1,55 +0,0 @@
|
||||
<html>
|
||||
<head>
|
||||
<title>Generic Constraints</title>
|
||||
</head>
|
||||
<body>
|
||||
<h1 align="center">Generic Constraints</h1>
|
||||
<br>
|
||||
<p>To represent generic constraints on real-valued functions, this class can parse
|
||||
String expressions in prefix notation of the form:
|
||||
<blockquote>
|
||||
<expr> ::= <constant-operator> | <functional-operator> "(" <arguments> ")"<br>
|
||||
<arguments> ::= <expr> | <expr> "," <arguments>
|
||||
</blockquote>
|
||||
</p>
|
||||
|
||||
Setting the <b>constraint string</b>:
|
||||
Constant operators have an arity of zero. Examples are:<br>
|
||||
(pi,0) (X,0) (1.0,0)<br>
|
||||
|
||||
Functional operators have an arity greater zero. Examples are:<br>
|
||||
(sum,1) (prod,1) (abs,1) (sin,1) (pow2,1) (pow3,1) (sqrt,1) (neg,1) (cos,1) (exp,1)<br>
|
||||
(+,2) (-,2) (/,2) (*,2)<br>
|
||||
|
||||
<p>
|
||||
Additionally, any numerical strings can also be used; they are parsed to numeric constants. The literal <i>n</i>
|
||||
is parsed to the current number of problem dimensions.<br>
|
||||
Notice that only the <i>sum</i> and <i>prod</i> operators may receive the literal X as input, standing
|
||||
for the full solution vector. Access to single solution components is possible by writing <i>x0...x9</i>
|
||||
for a problem with 10 dimensions.
|
||||
</p>
|
||||
|
||||
<p>
|
||||
Thus you may write <font face="Courier">+(-(5,sum(X)),+sin(/(x0,pi)))</font>
|
||||
and select 'lessEqZero' as relation to require valid solutions to fulfill 5-sum(X)+sin(x0/pi)<=0.<br>
|
||||
</p>
|
||||
|
||||
<p>
|
||||
Typical <b>relations</b> concerning constraints allow for g(x)<=0, g(x)==0, or g(x)>=0 for
|
||||
constraint g. Notice that equal-to-zero constraints are converted to g(x)==0 <=> |g(x)-epsilon|<=0 for
|
||||
customizable small values of epsilon.
|
||||
</p>
|
||||
|
||||
<p>
|
||||
The <b>handling method</b> defines how EvA 2 copes with the constraint. Simplest variant is an
|
||||
additive penalty which is scaled by the penalty factor and then added directly to the fitness
|
||||
of an individual. This will work for any optimization strategy, but results will depend on
|
||||
the selection of penalty factors. Multiplicative penalty works analogously with the difference of
|
||||
being multiplied with the raw fitness.<br>
|
||||
In the variant called specific tag, the constraint violation is stored in an extra field of any
|
||||
individual and may be regarded by the optimization strategy. However, not all strategies provide
|
||||
simple mechanisms of incorporating this specific tag.
|
||||
</p>
|
||||
|
||||
</body>
|
||||
</html>
|
||||
@@ -1,33 +0,0 @@
|
||||
<html>
|
||||
<head>
|
||||
<title>Covariance Matrix Adaptation with Rank-Mu-Update</title>
|
||||
</head>
|
||||
<body>
|
||||
<h1 align="center">Covariance Matrix Adaptation with rank-mu update after Hansen & Kern 2004</h1>
|
||||
|
||||
Implementing CMA ES with rank-mu-update and weighted recombination. This operator won the CEC 2005
|
||||
challenge employed with a restart scheme with increasing population size.
|
||||
Basically, in each generation the population is resampled around the weighted center of the
|
||||
last population using the adapted covariance matrix C. In contrast to earlier CMA versions,
|
||||
this implementation only holds one single covariance matrix for the whole population, making
|
||||
it much more memory efficient and useful for high dimensional problems as well.
|
||||
<br>
|
||||
While C is adapted based on a cumulated evolution path, the step size sigma is adapted based
|
||||
on path length control.
|
||||
Due to the repeated resampling starting from a single "center", the CMA version can
|
||||
be interpreted as a sophisticated local search, if the initial solution set is sampled
|
||||
close to an initial guess. In this case, a small initial sigma is favourable.
|
||||
<br>
|
||||
For multimodal problems, the initial population can be sampled randomly in the search space
|
||||
and the initial sigma must be rather high.
|
||||
To meet both conditions, the initial sigma may be set to half the average problem range
|
||||
or to the average distance in the initial population.
|
||||
|
||||
<br>
|
||||
<p>
|
||||
|
||||
* N.Hansen & S.Kern 2004: <i>Evaluating the CMA Evolution Strategy on Multimodal Test Functions.</i>
|
||||
Parallel Problem Solving from Nature 2004.
|
||||
|
||||
</body>
|
||||
</html>
|
||||
@@ -1,25 +0,0 @@
|
||||
<html>
|
||||
<head>
|
||||
<title>EvA Genetic Optimization</title>
|
||||
</head>
|
||||
<body>
|
||||
<h1 align="center">Genetic Optimization Parameters</h1>
|
||||
<br>
|
||||
The GO parameter class is used to change main GO optimization settings. You may:
|
||||
<ul>
|
||||
<li>Choose the optimizer. Check the optimizer object for further parameters and information.</li>
|
||||
<li>Set post-processing parameters or leave it turned off.</li>
|
||||
<li>Select the problem to be optimized. Check the problem instance for further parameters and information. </li>
|
||||
<li>Set a random seed. For the same positive seed, an optimization run should yield the same results. Set the seed to zero to use a dynamic seed for each run (using system time).</li>
|
||||
<li>Define the termination criterion. Usually a maximum number of fitness evaluations is set, but
|
||||
it is also possible to choose a maximum number of generations, an absolute fitness value to be reached, a
|
||||
convergence criterion or a combination of those.</li>
|
||||
</ul>
|
||||
<b>Note:</b> <br>
|
||||
The evolutionary operators used by a strategy are tightly connected to the representation used.
|
||||
On the other hand, the representation is usually defined by the underlying problem, therefore,
|
||||
to change the operators effecting the individuals, select the problem and set them within the
|
||||
Individual class presented there. Also note, that not all optimizers can handle all types
|
||||
of representations.
|
||||
</body>
|
||||
</html>
|
||||
@@ -1,41 +0,0 @@
|
||||
<html>
|
||||
<head>
|
||||
<title>Particle Swarm Optimization - PSO</title>
|
||||
</head>
|
||||
<body>
|
||||
<h1 align="center">Particle Swarm Optimization - PSO</h1>
|
||||
<center>
|
||||
</center><br>
|
||||
The Particle Swarm Optimization by Kennedy and Eberhardt is inspired by swarm intelligent
|
||||
behaviour seen in animals like birds or ants. A swarm of particles is a set of individual agents
|
||||
"flying" across the search space with individual velocity vectors. There is no selection as in
|
||||
classic Evolutionary Algorithms. Instead, the individuals exchange knowledge about the space they
|
||||
have come across. Each one is attracted to the best position the individual has seen so far (cognitive
|
||||
component) and to the best position known by its neighbors (social component).
|
||||
<p>
|
||||
The neighborhood is defined by the swarm velocity, which may be a linear ordering, a grid and some others.
|
||||
The influence of the velocity of the last time-step is taken into account using an inertness/
|
||||
constriction parameter, which controls the convergence behaviour of the swarm.
|
||||
</p>
|
||||
The influence of social and cognitive attraction are weighed using the <i>phi</i> parameters. In the
|
||||
constriction variant there is a dependence enforced between constriction and the phi, making sure that
|
||||
the swarm converges slowly but steadily, see the publications of M.Clerc, e.g.
|
||||
Typical values for the attractor weights are phi1=phi2=2.05.
|
||||
<p>
|
||||
The topology defines the communication structure of the swarm. In linear topology, each particle has contact
|
||||
to n others in two directions, so there is a linear overlay structure. The grid topology connects a particle
|
||||
in 4 directions, while the star variant is completely connected. The random variant just connects each
|
||||
particle to k others by random and anew in every generation cycle.
|
||||
Basically, the more connections are available, the quicker will information about good areas spread through
|
||||
the swarm and lead to quicker convergence, thereby increasing the risk of converging prematurely.
|
||||
By default, the random (e.g. with range=4) or grid structure (e.g. with range=2) are good choices.
|
||||
</p>
|
||||
<p>
|
||||
The multi-swarm approach splits the main swarm in sub-swarms defined by the distance to a local "leader",
|
||||
as in the dynamic multi-swarm approaches by Shi and Branke, for example. The tree structure orders the
|
||||
swarm to a tree of degree k, where the fittest individuals are on top and inform all their children nodes.
|
||||
In this case, the higher the degree, the quicker will information spread. HPSO is a hierarchical tree variant
|
||||
by Janson and Middendorf, 2005.
|
||||
|
||||
</body>
|
||||
</html>
|
||||
@@ -1,16 +0,0 @@
|
||||
<html>
|
||||
<head>
|
||||
<title>Phenotype Convergence Terminator</title>
|
||||
</head>
|
||||
<body>
|
||||
<h1 align="center">Phenotype Convergence Terminator</h1>
|
||||
<center>
|
||||
</center><br>
|
||||
The phenotype convergence terminator stops the optimization when there has been hardly
|
||||
any change in the best population individual (within percentual or absolute distance) for a certain
|
||||
time span, given in generations or fitness calls.<br>
|
||||
Be aware that, if the optimum individual is close to zero, it may happen that its phenotype values
|
||||
fluctuate due to numeric issues and do not easily converge in a relative measure.<br>
|
||||
Additional information is given for the superclass <a href="PopulationMeasureTerminator.html">PopulationMeasureTerminator</a>.
|
||||
</body>
|
||||
</html>
|
||||
@@ -1,31 +0,0 @@
|
||||
<html>
|
||||
<head>
|
||||
<title>Population Measure Terminator</title>
|
||||
</head>
|
||||
<body>
|
||||
<h1 align="center">Population Measure Terminator</h1>
|
||||
<center>
|
||||
</center><br>
|
||||
An abstract class giving the framework for terminators based on
|
||||
a population measure converging for a given time (number of evaluations or
|
||||
generations).
|
||||
The class detects changes of a population P using a measure m over time and may signal convergence
|
||||
if the measure m(P) behaved in a certain way for a given time. Convergence may
|
||||
be signaled
|
||||
<ul>
|
||||
<li>if the measure reached absolute values below convThresh (absolute value),</li>
|
||||
<li>if the measure remained within m(P)+/-convThresh (absolute change),</li>
|
||||
<li>if the measure remained above m(P)-convThresh (absolute change and regard improvement only),</li>
|
||||
<li>if the measure remained within m(P)*[1-convThresh, 1+convThresh] (relative change),</li>
|
||||
<li>if the measure remained above m(P)*(1-convThresh) (relative change and regard improvement only).</li>
|
||||
</ul>
|
||||
The fitness convergence terminator stops the optimization, when there has been hardly
|
||||
any change in the best fitness in the population (within percentual or absolute distance) for a certain
|
||||
time, given in generations or fitness calls. In case of multi-objective optimization, the 2-norm of
|
||||
the fitness vector is
|
||||
currently used.<br>
|
||||
Be aware that, if the optimization is allowed to be non-monotonic, such as for (,)-ES strategies,
|
||||
and if the optimum is close to zero, it may happen that the fitness fluctuates due to numeric
|
||||
issues and does not easily converge in a relative way.<br>
|
||||
</body>
|
||||
</html>
|
||||
@@ -1,33 +0,0 @@
|
||||
<html>
|
||||
<head>
|
||||
<title>Post-processing parameters</title>
|
||||
</head>
|
||||
<body>
|
||||
<h1 align="center">Post-processing parameters</h1>
|
||||
<center>
|
||||
</center>
|
||||
<p>
|
||||
If post processing is activated, it is performed after every
|
||||
optimization run and it may be triggered using the solutions of the last optimization run by
|
||||
the "Post process" button.
|
||||
Post processing performs both accuracy checks of the delivered solutions and a clustering/refinement of the
|
||||
solutions with a local search method. The solutions are clustered to remove redundancy and the remaining
|
||||
best cluster representatives are considered. </p>
|
||||
<p>For the accuracy evaluation, multiple thresholds may be used. The solutions are then clustered using a distance
|
||||
of 0.1 times the respective accuracy threshold and a Nelder-Mead-Simplex search is initialized in close vicinity.
|
||||
As soon as the NMS search fails to produce an improved solution at a distance larger than the accuracy threshold
|
||||
from the original positions, the solution is considered to be accurate by that threshold. </p>
|
||||
<p>Besides the accuracy, a refinement can be performed using several local search methods. After the refinement,
|
||||
the set is clustered again to filter out solutions which converged on the same optimum during the local search.
|
||||
</p>
|
||||
<p>
|
||||
The results of the post processing are displayed in the text window (and/or stats output file) and show a coarse
|
||||
distribution of the final solutions as well as the explicit vectors of the n best solutions obtained, where n
|
||||
is set as printNBest parameter.
|
||||
If post-processing is started several times in a row, the initial solution set is the same, namely the one found
|
||||
by optimization. Thereby one can guess, e.g., how close the solutions are to each other and how closely they
|
||||
have converged during optimization itself.
|
||||
</p>
|
||||
|
||||
</body>
|
||||
</html>
|
||||
@@ -1,25 +0,0 @@
|
||||
<html>
|
||||
<head>
|
||||
<title>Statistics Parameter Panel</title>
|
||||
</head>
|
||||
<body>
|
||||
<h1 align="center">Statistics Parameter Panel</h1>
|
||||
<center>
|
||||
</center><br>
|
||||
Statistical options are:
|
||||
<ul>
|
||||
<li>Convergence rate threshold. Provided the target value is zero,
|
||||
convergence is assumed if a value smaller than this threshold is reached.
|
||||
For multi-run experiments, the number of hits is counted using this criterion.</li>
|
||||
<li>Number of multi-runs. To achieve statistically meaningful results on how well
|
||||
a certain optimizer works on a given problem, set this number to do several runs in a row.
|
||||
The plot will be averaged, while all data can be collected in an output file or text window.</li>
|
||||
<li>The fitness to plot. Define which fitness values to plot to the graph window after every
|
||||
generation. Select "best", "worst" or both.</li>
|
||||
<li>Result file name. If you want to collect optimization data, set this String to a desired file name.
|
||||
Optimization results will be written to the indicated file in the working directory.</li>
|
||||
<li>Show text output. If activated, the optimization data will also be shown in a graphical text
|
||||
window for immediate viewing.</li>
|
||||
</ul>
|
||||
</body>
|
||||
</html>
|
||||
@@ -1,22 +0,0 @@
|
||||
<html>
|
||||
<head>
|
||||
<title>TRIBES</title>
|
||||
</head>
|
||||
<body>
|
||||
<h1 align="center">TRIBES</h1>
|
||||
<center>
|
||||
</center><br>
|
||||
TRIBES is a parameter-free PSO implementation by Maurice Clerc. It combines several adaptive
|
||||
mechanisms to achieve good performance in different domains. It uses a dynamic number of particles,
|
||||
starting usually with 3 and adding new ones during optimization. Therefore, the number of generations
|
||||
is not directly connected to the number of fitness calls,
|
||||
because the population may grow (and seldomly shrink).<br>
|
||||
|
||||
Also, there are different initialization
|
||||
methods implemented which are chosen randomly when particles are created. The particles are organized
|
||||
in loosely connected groups or tribes (therefore the name), creating a kind of small-world topology.
|
||||
<br>
|
||||
As TRIBES uses an error approximation to steer the adaptations, a target value should be given, so far in the first
|
||||
dimension only.
|
||||
</body>
|
||||
</html>
|
||||
Binary file not shown.
|
Before Width: | Height: | Size: 962 B |
Binary file not shown.
|
Before Width: | Height: | Size: 535 B |
Binary file not shown.
|
Before Width: | Height: | Size: 40 KiB |
Binary file not shown.
Binary file not shown.
|
Before Width: | Height: | Size: 473 B |
Binary file not shown.
|
Before Width: | Height: | Size: 1.3 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 1.3 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 473 B |
Binary file not shown.
|
Before Width: | Height: | Size: 1.3 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 1.6 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 1.5 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 1.7 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 1.6 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 2.0 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 228 B |
Binary file not shown.
|
Before Width: | Height: | Size: 247 B |
Binary file not shown.
|
Before Width: | Height: | Size: 316 B |
Binary file not shown.
|
Before Width: | Height: | Size: 206 B |
Binary file not shown.
|
Before Width: | Height: | Size: 775 B |
Binary file not shown.
|
Before Width: | Height: | Size: 313 B |
Binary file not shown.
|
Before Width: | Height: | Size: 908 B |
Binary file not shown.
|
Before Width: | Height: | Size: 422 B |
Binary file not shown.
|
Before Width: | Height: | Size: 369 B |
Binary file not shown.
|
Before Width: | Height: | Size: 30 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 41 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 19 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 35 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 68 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 36 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 3.2 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 37 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 3.6 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 42 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 38 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 31 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 9.0 KiB |
Binary file not shown.
Binary file not shown.
|
Before Width: | Height: | Size: 937 B |
Binary file not shown.
|
Before Width: | Height: | Size: 959 B |
Binary file not shown.
|
Before Width: | Height: | Size: 1010 B |
Binary file not shown.
|
Before Width: | Height: | Size: 1015 B |
Binary file not shown.
|
Before Width: | Height: | Size: 37 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 44 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 40 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 8.8 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 6.5 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 13 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 42 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 42 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 4.9 KiB |
@@ -1,165 +0,0 @@
|
||||
GNU LESSER GENERAL PUBLIC LICENSE
|
||||
Version 3, 29 June 2007
|
||||
|
||||
Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
|
||||
Everyone is permitted to copy and distribute verbatim copies
|
||||
of this license document, but changing it is not allowed.
|
||||
|
||||
|
||||
This version of the GNU Lesser General Public License incorporates
|
||||
the terms and conditions of version 3 of the GNU General Public
|
||||
License, supplemented by the additional permissions listed below.
|
||||
|
||||
0. Additional Definitions.
|
||||
|
||||
As used herein, "this License" refers to version 3 of the GNU Lesser
|
||||
General Public License, and the "GNU GPL" refers to version 3 of the GNU
|
||||
General Public License.
|
||||
|
||||
"The Library" refers to a covered work governed by this License,
|
||||
other than an Application or a Combined Work as defined below.
|
||||
|
||||
An "Application" is any work that makes use of an interface provided
|
||||
by the Library, but which is not otherwise based on the Library.
|
||||
Defining a subclass of a class defined by the Library is deemed a mode
|
||||
of using an interface provided by the Library.
|
||||
|
||||
A "Combined Work" is a work produced by combining or linking an
|
||||
Application with the Library. The particular version of the Library
|
||||
with which the Combined Work was made is also called the "Linked
|
||||
Version".
|
||||
|
||||
The "Minimal Corresponding Source" for a Combined Work means the
|
||||
Corresponding Source for the Combined Work, excluding any source code
|
||||
for portions of the Combined Work that, considered in isolation, are
|
||||
based on the Application, and not on the Linked Version.
|
||||
|
||||
The "Corresponding Application Code" for a Combined Work means the
|
||||
object code and/or source code for the Application, including any data
|
||||
and utility programs needed for reproducing the Combined Work from the
|
||||
Application, but excluding the System Libraries of the Combined Work.
|
||||
|
||||
1. Exception to Section 3 of the GNU GPL.
|
||||
|
||||
You may convey a covered work under sections 3 and 4 of this License
|
||||
without being bound by section 3 of the GNU GPL.
|
||||
|
||||
2. Conveying Modified Versions.
|
||||
|
||||
If you modify a copy of the Library, and, in your modifications, a
|
||||
facility refers to a function or data to be supplied by an Application
|
||||
that uses the facility (other than as an argument passed when the
|
||||
facility is invoked), then you may convey a copy of the modified
|
||||
version:
|
||||
|
||||
a) under this License, provided that you make a good faith effort to
|
||||
ensure that, in the event an Application does not supply the
|
||||
function or data, the facility still operates, and performs
|
||||
whatever part of its purpose remains meaningful, or
|
||||
|
||||
b) under the GNU GPL, with none of the additional permissions of
|
||||
this License applicable to that copy.
|
||||
|
||||
3. Object Code Incorporating Material from Library Header Files.
|
||||
|
||||
The object code form of an Application may incorporate material from
|
||||
a header file that is part of the Library. You may convey such object
|
||||
code under terms of your choice, provided that, if the incorporated
|
||||
material is not limited to numerical parameters, data structure
|
||||
layouts and accessors, or small macros, inline functions and templates
|
||||
(ten or fewer lines in length), you do both of the following:
|
||||
|
||||
a) Give prominent notice with each copy of the object code that the
|
||||
Library is used in it and that the Library and its use are
|
||||
covered by this License.
|
||||
|
||||
b) Accompany the object code with a copy of the GNU GPL and this license
|
||||
document.
|
||||
|
||||
4. Combined Works.
|
||||
|
||||
You may convey a Combined Work under terms of your choice that,
|
||||
taken together, effectively do not restrict modification of the
|
||||
portions of the Library contained in the Combined Work and reverse
|
||||
engineering for debugging such modifications, if you also do each of
|
||||
the following:
|
||||
|
||||
a) Give prominent notice with each copy of the Combined Work that
|
||||
the Library is used in it and that the Library and its use are
|
||||
covered by this License.
|
||||
|
||||
b) Accompany the Combined Work with a copy of the GNU GPL and this license
|
||||
document.
|
||||
|
||||
c) For a Combined Work that displays copyright notices during
|
||||
execution, include the copyright notice for the Library among
|
||||
these notices, as well as a reference directing the user to the
|
||||
copies of the GNU GPL and this license document.
|
||||
|
||||
d) Do one of the following:
|
||||
|
||||
0) Convey the Minimal Corresponding Source under the terms of this
|
||||
License, and the Corresponding Application Code in a form
|
||||
suitable for, and under terms that permit, the user to
|
||||
recombine or relink the Application with a modified version of
|
||||
the Linked Version to produce a modified Combined Work, in the
|
||||
manner specified by section 6 of the GNU GPL for conveying
|
||||
Corresponding Source.
|
||||
|
||||
1) Use a suitable shared library mechanism for linking with the
|
||||
Library. A suitable mechanism is one that (a) uses at run time
|
||||
a copy of the Library already present on the user's computer
|
||||
system, and (b) will operate properly with a modified version
|
||||
of the Library that is interface-compatible with the Linked
|
||||
Version.
|
||||
|
||||
e) Provide Installation Information, but only if you would otherwise
|
||||
be required to provide such information under section 6 of the
|
||||
GNU GPL, and only to the extent that such information is
|
||||
necessary to install and execute a modified version of the
|
||||
Combined Work produced by recombining or relinking the
|
||||
Application with a modified version of the Linked Version. (If
|
||||
you use option 4d0, the Installation Information must accompany
|
||||
the Minimal Corresponding Source and Corresponding Application
|
||||
Code. If you use option 4d1, you must provide the Installation
|
||||
Information in the manner specified by section 6 of the GNU GPL
|
||||
for conveying Corresponding Source.)
|
||||
|
||||
5. Combined Libraries.
|
||||
|
||||
You may place library facilities that are a work based on the
|
||||
Library side by side in a single library together with other library
|
||||
facilities that are not Applications and are not covered by this
|
||||
License, and convey such a combined library under terms of your
|
||||
choice, if you do both of the following:
|
||||
|
||||
a) Accompany the combined library with a copy of the same work based
|
||||
on the Library, uncombined with any other library facilities,
|
||||
conveyed under the terms of this License.
|
||||
|
||||
b) Give prominent notice with the combined library that part of it
|
||||
is a work based on the Library, and explaining where to find the
|
||||
accompanying uncombined form of the same work.
|
||||
|
||||
6. Revised Versions of the GNU Lesser General Public License.
|
||||
|
||||
The Free Software Foundation may publish revised and/or new versions
|
||||
of the GNU Lesser General Public License from time to time. Such new
|
||||
versions will be similar in spirit to the present version, but may
|
||||
differ in detail to address new problems or concerns.
|
||||
|
||||
Each version is given a distinguishing version number. If the
|
||||
Library as you received it specifies that a certain numbered version
|
||||
of the GNU Lesser General Public License "or any later version"
|
||||
applies to it, you have the option of following the terms and
|
||||
conditions either of that published version or of any later version
|
||||
published by the Free Software Foundation. If the Library as you
|
||||
received it does not specify a version number of the GNU Lesser
|
||||
General Public License, you may choose any version of the GNU Lesser
|
||||
General Public License ever published by the Free Software Foundation.
|
||||
|
||||
If the Library as you received it specifies that a proxy can decide
|
||||
whether future versions of the GNU Lesser General Public License shall
|
||||
apply, that proxy's public statement of acceptance of any version is
|
||||
permanent authorization for you to choose that version for the
|
||||
Library.
|
||||
Reference in New Issue
Block a user