Adaptive Population based Simplex - User contributions [en]

Programs

2022-05-24T14:18:00Z

Admin: APS13 + CEC benchmarks

== Codes ==
{| class="wikitable"
|-
! Name and link !! Comments !! Date
|-
| [[File:APS standard m.zip|Standard APS]] || MatLab (zipped), by Mahamed G. H. Omran || 2013-09-05
|-
| [[Media:Standard APS C.zip|Standard APS]] || C (zipped), by Maurice Clerc. Includes just an additional "tryMore" option || 2013-07-05
|-
| [[Media:Research_APS_C.zip|Research APS]] || C (zipped), by Maurice Clerc. A lot of options|| 2013-06-10
|-

|-
| [[Media:APS9.zip|APS 9]] || Matlab (zipped), by Maurice Clerc and Mahamed G. H. Omran. A version that easily beats CMA-ES and GA-MPC on the CEC2005 and CEC2011 benchmarks|| 2016-01-08
|-
| [[Media:APS11.zip|APS 11]] || Matlab (zipped), by Maurice Clerc and Mahamed G. H. Omran. Slightly modified version. Should be often better. || 2017-06-10
|-

|-
| [[Media:APS12_part_1.zip|APS 12, part 1]] || Matlab (double compression), by Maurice Clerc and Mahamed G. H. Omran. Research version. || 2018-11-14
|-
|-
| [[Media:APS12_part_2.zip|APS 12, part 2]] || Matlab (double compression) ||
|-
|-
| [[Media:MAMSO for paper.zip|MAMSO]] || Multi-Agents Multi-Strategies Optimiser (Matlab/Octave). “[https://hal.archives-ouvertes.fr/hal-03150719 Paper]”
||2021-03-12
|-
|-
| [[Media:CEC.zip|CEC benchmarks]] || Needed for APS13 ||2022-05-24
|-

|-
| [[Media:APS13 codes.zip|APS13]] || Slightly simplified version of APS12 ||2022-05-24
|-

| || ||
|}

Or you may simply want to play with the "[[APS online]]" version.

File:CEC.zip

2022-05-24T13:46:46Z

Admin: CEC benchmarks. Needed in particular for APS13

CEC benchmarks. Needed in particular for APS13

File:APS13 codes.zip

2022-05-24T13:44:55Z

Admin: APS13: A slightly simplified version of APS12 + Landscapes + Myfunctions

APS13: A slightly simplified version of APS12 + Landscapes + Myfunctions

Programs

2021-03-12T20:01:15Z

Admin:

== Codes ==
{| class="wikitable"
|-
! Name and link !! Comments !! Date
|-
| [[File:APS standard m.zip|Standard APS]] || MatLab (zipped), by Mahamed G. H. Omran || 2013-09-05
|-
| [[Media:Standard APS C.zip|Standard APS]] || C (zipped), by Maurice Clerc. Includes just an additional "tryMore" option || 2013-07-05
|-
| [[Media:Research_APS_C.zip|Research APS]] || C (zipped), by Maurice Clerc. A lot of options|| 2013-06-10
|-

|-
| [[Media:APS9.zip|APS 9]] || Matlab (zipped), by Maurice Clerc and Mahamed G. H. Omran. A version that easily beats CMA-ES and GA-MPC on the CEC2005 and CEC2011 benchmarks|| 2016-01-08
|-
| [[Media:APS11.zip|APS 11]] || Matlab (zipped), by Maurice Clerc and Mahamed G. H. Omran. Slightly modified version. Should be often better. || 2017-06-10
|-

|-
| [[Media:APS12_part_1.zip|APS 12, part 1]] || Matlab (double compression), by Maurice Clerc and Mahamed G. H. Omran. Research version. || 2018-11-14
|-
|-
| [[Media:APS12_part_2.zip|APS 12, part 2]] || Matlab (double compression) ||
|-
|-
| [[Media:MAMSO for paper.zip|MAMSO]] || Multi-Agents Multi-Strategies Optimiser (Matlab/Octave). “[https://hal.archives-ouvertes.fr/hal-03150719 Paper]”
||2021-03-12
|-

| || ||
|}

Or you may simply want to play with the "[[APS online]]" version.

Programs

2021-03-12T19:58:25Z

Admin:

== Codes ==
{| class="wikitable"
|-
! Name and link !! Comments !! Date
|-
| [[File:APS standard m.zip|Standard APS]] || MatLab (zipped), by Mahamed G. H. Omran || 2013-09-05
|-
| [[Media:Standard APS C.zip|Standard APS]] || C (zipped), by Maurice Clerc. Includes just an additional "tryMore" option || 2013-07-05
|-
| [[Media:Research_APS_C.zip|Research APS]] || C (zipped), by Maurice Clerc. A lot of options|| 2013-06-10
|-

|-
| [[Media:APS9.zip|APS 9]] || Matlab (zipped), by Maurice Clerc and Mahamed G. H. Omran. A version that easily beats CMA-ES and GA-MPC on the CEC2005 and CEC2011 benchmarks|| 2016-01-08
|-
| [[Media:APS11.zip|APS 11]] || Matlab (zipped), by Maurice Clerc and Mahamed G. H. Omran. Slightly modified version. Should be often better. || 2017-06-10
|-

|-
| [[Media:APS12_part_1.zip|APS 12, part 1]] || Matlab (double compression), by Maurice Clerc and Mahamed G. H. Omran. Research version. || 2018-11-14
|-
|-
| [[Media:APS12_part_2.zip|APS 12, part 2]] || Matlab (double compression) ||
|-
|-
| [[Media:MAMSO for paper.zip|MAMSO]] || Multi-Agents Multi-Strategies Optimiser (Matlab/Octave). Paper
||2021-03-12
|-

| || ||
|}

Or you may simply want to play with the "[[APS online]]" version.

Programs

2021-03-12T19:56:23Z

Admin:

== Codes ==
{| class="wikitable"
|-
! Name and link !! Comments !! Date
|-
| [[File:APS standard m.zip|Standard APS]] || MatLab (zipped), by Mahamed G. H. Omran || 2013-09-05
|-
| [[Media:Standard APS C.zip|Standard APS]] || C (zipped), by Maurice Clerc. Includes just an additional "tryMore" option || 2013-07-05
|-
| [[Media:Research_APS_C.zip|Research APS]] || C (zipped), by Maurice Clerc. A lot of options|| 2013-06-10
|-

|-
| [[Media:APS9.zip|APS 9]] || Matlab (zipped), by Maurice Clerc and Mahamed G. H. Omran. A version that easily beats CMA-ES and GA-MPC on the CEC2005 and CEC2011 benchmarks|| 2016-01-08
|-
| [[Media:APS11.zip|APS 11]] || Matlab (zipped), by Maurice Clerc and Mahamed G. H. Omran. Slightly modified version. Should be often better. || 2017-06-10
|-

|-
| [[Media:APS12_part_1.zip|APS 12, part 1]] || Matlab (double compression), by Maurice Clerc and Mahamed G. H. Omran. Research version. || 2018-11-14
|-
|-
| [[Media:APS12_part_2.zip|APS 12, part 2]] || Matlab (double compression) ||
|-
|-
| [[Media:MAMSO for paper.zip|MAMSO]] || Multi-Agents Multi-Strategies Optimiser (Matlab/Octave). Paper ||2021-03-12
|-

| || ||
|}

Or you may simply want to play with the "[[APS online]]" version.

Programs

2021-03-12T19:55:08Z

Admin:

== Codes ==
{| class="wikitable"
|-
! Name and link !! Comments !! Date
|-
| [[File:APS standard m.zip|Standard APS]] || MatLab (zipped), by Mahamed G. H. Omran || 2013-09-05
|-
| [[Media:Standard APS C.zip|Standard APS]] || C (zipped), by Maurice Clerc. Includes just an additional "tryMore" option || 2013-07-05
|-
| [[Media:Research_APS_C.zip|Research APS]] || C (zipped), by Maurice Clerc. A lot of options|| 2013-06-10
|-

|-
| [[Media:APS9.zip|APS 9]] || Matlab (zipped), by Maurice Clerc and Mahamed G. H. Omran. A version that easily beats CMA-ES and GA-MPC on the CEC2005 and CEC2011 benchmarks|| 2016-01-08
|-
| [[Media:APS11.zip|APS 11]] || Matlab (zipped), by Maurice Clerc and Mahamed G. H. Omran. Slightly modified version. Should be often better. || 2017-06-10
|-

|-
| [[Media:APS12_part_1.zip|APS 12, part 1]] || Matlab (double compression), by Maurice Clerc and Mahamed G. H. Omran. Research version. || 2018-11-14
|-
|-
| [[Media:APS12_part_2.zip|APS 12, part 2]] || Matlab (double compression) ||
|-
|-
| [[Media:MAMSO for paper.zip|MAMSO]] || Multi-Agents Multi-Strategies Optimiser (Matlab/Octave) ||2021-03-12
|-

| || ||
|}

Or you may simply want to play with the "[[APS online]]" version.

File:MAMSO for paper.zip

2021-03-12T19:49:55Z

Admin: Octave/Matlab code of MAMSO

Octave/Matlab code of MAMSO

Programs

2016-03-06T20:50:02Z

Admin:

File:APS9.zip

2016-03-06T20:49:07Z

Admin:

== Licensing ==
{{CC-by-sa-2.5}}

Programs

2016-03-06T20:42:02Z

Admin:

Local search

2015-09-22T08:06:37Z

Admin: Admin moved page Last Chance / Local search to Local search without leaving a redirect: revert

== Basic local search (l0) ==
The idea is to perform a random search "around" a good point, but only if the current point is worse than average, i.e. if $\frac{f(x_i)}{N}>C$. In that case, the process is the following:
* Compute the maximum distance $\rho$ between $x_{best}$ and all the other individuals of the population.
* Select the $x_l$ position at random in the hypersphere of centre $x_{best}$ and of radius $\rho$. The basic random choice makes use of two distributions, an uniform one, and a non-uniform one (see below).

If $x_{l}$ is better than $x_i$, decrease the population cost
$$ C\leftarrow C-f(x_i)+f(x_l)$$

If $x_{l}$ is better than the best ever found (i.e. $Best$), set $Best=x_{l}$.

=== Random choice ===
The distribution that is used is itself selected at random (uniform distribution) between two ones:
# the uniform one. The components of the direction vector follow the normalised Gaussian distribution, and the radius is $r=\rho*rand(0,1)^{\frac{1}{D}}$
# a non uniform one (more dense near to the centre). Here the radius is simply $r=\rho*rand(0,1)$.

Local search

2015-09-22T08:01:48Z

Admin: Admin moved page Local search to Last Chance / Local search without leaving a redirect

Reflection/Expansion

2015-09-22T07:39:23Z

Admin: Admin moved page Reflection to Reflection/Expansion

== Basic reflection/expansion (r0) ==
We combine four individuals, $x_{best}$, $x_{worst2}$, $w_{worst}$, and the current $x_i$ that has to be moved. The idea is that a move from $x_{worst}$ to $x_{worst2}$ is probably a good one, so, on the contrary, the same move applied to $x_{best}$ is probably a bad one, i.e. it tends to deteriorate the position. But on the other hand, it also gives a chance to escape from the attraction basin of $x_{best}$.

Of course, for a unimodal landscape, this is a waste of time, but for multimodal ones, it may be useful. Moreover, this move is not applied on all dimensions, but only on some of them, according to the probability estimated at the end of the selection phase. So, finally, the formulae to define the new point $x_e$ are, for each dimension $d$: 

if ($rand(0,1)<p)$ 
$ x_{r,d}=x_{best,d}+(x_{worst2,d}-x_{worst,d})$ 
else 
$ x_{r,d}=x_{i,d}$

If $x_{r}$ is better than $x_i$, decrease the population cost
$$ C\leftarrow C-f(x_i)+f(x_r)$$

If $x_{r}$ is better than the best ever found (i.e. $Best$), set $Best=x_{r}$.

.

Reflection

2015-09-22T07:39:23Z

Admin: Admin moved page Reflection to Reflection/Expansion

#REDIRECT [[Reflection/Expansion]]

Reflection/Expansion

2015-09-22T07:35:01Z

Admin:

Reflection/Expansion

2015-09-22T07:34:14Z

Admin: typos

== Basic expansion (r0) ==
We combine four individuals, $x_{best}$, $x_{worst2}$, $w_{worst}$, and the current $x_i$ that has to be moved. The idea is that a move from $x_{worst}$ to $x_{worst2}$ is probably a good one, so, on the contrary, the same move applied to $x_{best}$ is probably a bad one, i.e. it tends to deteriorate the position. But on the other hand, it also gives a chance to escape from the attraction basin of $x_{best}$.

Of course, for a unimodal landscape, this is a waste of time, but for multimodal ones, it may be useful. Moreover, this move is not applied on all dimensions, but only on some of them, according to the probability estimated at the end of the selection phase. So, finally, the formulae to define the new point $x_e$ are, for each dimension $d$: 

if ($rand(0,1)<p)$ 
$ x_{r,d}=x_{best,d}+(x_{worst2,d}-x_{worst,d})$ 
else 
$ x_{r,d}=x_{i,d}$

If $x_{r}$ is better than $x_i$, decrease the population cost
$$ C\leftarrow C-f(x_i)+f(x_r)$$

If $x_{r}$ is better than the best ever found (i.e. $Best$), set $Best=x_{r}$.

.

Welcome

2014-10-09T08:02:50Z

Admin: read-only mode

'''<big>A</big>daptive <big>P</big>opulation based <big>S</big>implex (<big>APS</big>)'''



a powerful tuning-free optimization method

== Getting started ==
If you do not know APS, please go to the [[Presentation]] page. Do not hesisate to use its Discussion tab, but, please, only for '''pertinent''' comments about APS. Note that things like "Hey ! My name is John, I like swimming" will be anyway almost immediately deleted.

'''WARNING''' (2014-10-09) ''Too many stupid created pages like this. As the webmaster is tired to delete them, the site is temporarily set in "read-only" mode.''

Or you may simply want to play with the "[[APS online]]" version.

Consult the [//meta.wikimedia.org/wiki/Help:Contents User's Guide] for information on using the wiki software.

{{#iDisplay:http://aps-optim.info/Clustrmaps.htm}}

Welcome

2014-10-04T06:56:28Z

Admin:

'''<big>A</big>daptive <big>P</big>opulation based <big>S</big>implex (<big>APS</big>)'''



a powerful tuning-free optimization method

== Getting started ==
If you do not know APS, please go to the [[Presentation]] page. Do not hesisate to use its Discussion tab, but, please, only for '''pertinent''' comments about APS. Note that things like "Hey ! My name is John, I like swimming" will be anyway almost immediately deleted.

Or you may simply want to play with the "[[APS online]]" version.

Consult the [//meta.wikimedia.org/wiki/Help:Contents User's Guide] for information on using the wiki software.

{{#iDisplay:http://aps-optim.info/Clustrmaps.htm}}

Welcome

2014-09-30T09:15:26Z

Admin:

'''<big>A</big>daptive <big>P</big>opulation based <big>S</big>implex (<big>APS</big>)'''



a powerful tuning-free optimization method

== Getting started ==
If you do not know APS, please go to the [[Presentation]] page. Do not hesisate to use its Discussion tab, but, please, only for '''pertinent''' comments about APS (not things like "Hey ! My name is John, I like swimming").

Or you may simply want to play with the "[[APS online]]" version.

Consult the [//meta.wikimedia.org/wiki/Help:Contents User's Guide] for information on using the wiki software.

{{#iDisplay:http://aps-optim.info/Clustrmaps.htm}}

Presentation

2014-06-23T08:21:27Z

Admin:

<imagemap>
Image:Flow_chart.png|right|thumb|280px|Standard APS flow chart

rect 6 5 368 122 [[Initialisation|Initialisation]]
rect 198 234 563 346 [[Selection|Selection]]
rect 199 426 562 539 [[Expansion|Expansion]]
rect 198 617 563 732 [[Contraction|Contraction]]
rect 197 810 564 925 [[Local search|Local search]]
rect 134 547 268 565 [[Improvement|Improvement]]
rect 133 738 268 752 [[Improvement|Improvement]]
desc none
</imagemap>

APS has been inspired by some previous works, in particular the ones of Luo et al. <ref name=luo2012lowdimensional> Luo, C. & Yu, B. Low dimensional simplex evolution: a new heuristic for global optimization Journal of Global Optimization, 2012, 52, 45-55</ref> <ref name=luo_modifications_2013>Luo, C.; Zhang, S.-L. & Yu, B. Some modifications of low-dimensional simplex evolution and their convergence Optimization Methods and Software, 2013, 28, 54-81 </ref> on Low dimensional simplex evolution (LDSE).

Each phase is explained on its own page (just click on the corresponding area of the figure). After the initialisation of $N$ individuals, all the other phases are in a loop on them. In the explanation, the current individual is called $x_i$. This loop is repeated as long as a stop criterion is not met. As usually, the stop criterion is either a maximum number of fitness evaluations, or an error value found smaller than a predefined threshold.

<references/>

APS online

2014-06-23T08:20:16Z

Admin:

Tested with Firefox, Chromium, Safari. May not work with some Internet Explorer versions.

{{#iDisplay:http://aps-optim.info/APS_JS/APS_JS.htm}}

File:Flow chart.png

2013-10-17T12:07:46Z

Admin: Admin uploaded a new version of "File:Flow chart.png": Expansion => Reflection

== Licensing ==
{{PD}}

Reflection/Expansion

2013-10-17T12:03:05Z

Admin: Admin moved page Expansion to Reflection

== Basic reflection (r0) ==
We combine four individuals, $x_{best}$, $x_{worst2}$, $w_{worst}$, and the current $x_i$ that has to be moved. The idea is that a move from $w_{worst}$ to $w_{worst2}$ is probably a good one, so, on the contrary, the same move applied to $x_{best}$ is probably a bad one, i.e. it tends to deteriorate the position. But on the other hand, it also gives a chance to escape from the attraction basin of $x_{best}$.

Of course, for a unimodal landscape, this is a waste of time, but for multimodal ones, it may be useful. Moreover, this move is not applied on all dimensions, but only on some of them, according to the probability estimated at the end of the selection phase. So, finally, the formulae to define the new point $x_e$ are, for each dimension $d$: 

if ($rand(0,1)<p)$ 
$ x_{r,d}=x_{best,d}+(w_{worst2,d}-w_{worst,d})$ 
else 
$ x_{r,d}=x_{i,d}$

If $x_{r}$ is better than $x_i$, decrease the population cost
$$ C\leftarrow C-f(x_i)+f(x_r)$$

If $x_{r}$ is better than the best ever found (i.e. $Best$), set $Best=x_{r}$.

.

Expansion

2013-10-17T12:03:05Z

Admin: Admin moved page Expansion to Reflection

#REDIRECT [[Reflection]]

Reflection/Expansion

2013-10-17T11:58:05Z

Admin: e0 => r0

Welcome

2013-07-30T08:33:32Z

Admin:

Welcome

2013-07-30T08:05:34Z

Admin:

'''<big>A</big>daptive <big>P</big>opulation based <big>S</big>implex (<big>APS</big>)'''



a powerful parameter-free optimization method

== Getting started ==
If you do not know APS, please go to the [[Presentation]] page. And do not hesisate to use its Discussion tab.

Or you may simply want to play with the "[[APS online]]" version.

Consult the [//meta.wikimedia.org/wiki/Help:Contents User's Guide] for information on using the wiki software.

[url=http://www2.clustrmaps.com/user/42310bc10][img]http://www2.clustrmaps.com/stats/maps-no_clusters/aps-optim.info-thumb.jpg[/img][/url]

<a href="http://www2.clustrmaps.com/user/42310bc10"><img src="http://www2.clustrmaps.com/stats/maps-no_clusters/aps-optim.info-thumb.jpg" alt="Locations of visitors to this page" />
</a>

APS online

2013-07-14T18:41:11Z

Admin:

Tested with Firefox, Chromium, Safari.

{{#iDisplay:http://aps-optim.info/APS_JS/APS_JS.htm}}

Welcome

2013-07-13T19:27:35Z

Admin:

APS online

2013-07-13T19:21:54Z

Admin:

Tested with Firefox, Chromium, Safari.

{{#iDisplay:http://aps-optim.info/APS_JS/APS_JS.htm}}

APS online

2013-07-12T07:22:51Z

Admin: Protected "APS online" ([Edit=Allow only administrators] (indefinite) [Move=Allow only administrators] (indefinite))

Programs

2013-07-11T20:26:14Z

Admin:

== Codes ==
{| class="wikitable"
|-
! Name and link !! Comments !! Date
|-
| [[Media:APS standard m.zip|Standard APS]] || MatLab (zipped), by Mahamed G. H. Omran || 2013-07-06
|-
| [[Media:Standard APS C.zip|Standard APS]] || C (zipped), by Maurice Clerc. Include just an additional "tryMore" option || 2013-07-05
|-
| [[Media:Research_APS_C.zip|Research APS]] || C (zipped), by Maurice Clerc. A lot of options|| 2013-06-10
|-
| || ||
|}

Or you may simply want to play with the "[[APS online]]" version.

Welcome

2013-07-11T20:25:28Z

Admin:

'''<big>A</big>daptive <big>P</big>opulation based <big>S</big>implex (<big>APS</big>)'''

a powerful parameter-free optimization method

== Getting started ==
If you do not know APS, please go to the [[Presentation]] page. And do not hesisate to use its Discussion tab.

Or you may simply want to play with the "[[APS online]]" version.

Consult the [//meta.wikimedia.org/wiki/Help:Contents User's Guide] for information on using the wiki software.

APS:About

2013-06-28T20:25:27Z

Admin: Protected "APS:About" ([Edit=Allow only administrators] (indefinite) [Move=Allow only administrators] (indefinite)) [cascading]

If you work on the Adaptive Population Simplex method or its variants, or if you want to work on it, or if you just want to know more about it, this site is for you.

In any case, do not hesitate to contribute, at least on the Discussion pages.

APS:General disclaimer

2013-06-28T20:24:49Z

Admin: Protected "APS:General disclaimer" ([Edit=Allow only administrators] (indefinite) [Move=Allow only administrators] (indefinite)) [cascading]

==No formal peer review==

Our active community of editors uses tools such as the Special:Recentchanges and Special:Newpages feeds to monitor new and changing content. However, APS is not uniformly peer reviewed; while readers may correct errors or engage in casual peer review, they have no legal duty to do so and thus all information read here is without any implied warranty of fitness for any purpose or use whatsoever. Even articles that have been vetted by informal peer review or featured article processes may later have been edited inappropriately, just before you view them.

None of the contributors, sponsors, administrators or anyone else connected with APS in any way whatsoever can be responsible for the appearance of any inaccurate or libelous information or for your use of the information contained in or linked from these web pages.
No contract; limited license

Please make sure that you understand that the information provided here is being provided freely, and that no kind of agreement or contract is created between you and the owners or users of this site, the owners of the servers upon which it is housed, the individual APS contributors, any project administrators, sysops or anyone else who is in any way connected with this project or sister projects subject to your claims against them directly. You are being granted a limited license to copy anything from this site; it does not create or imply any contractual or extracontractual liability on the part of this APS site or any of its agents, members, organizers or other users.

There is no agreement or understanding between you and APS regarding your use or modification of this information beyond the Creative Commons Attribution-Sharealike 3.0 Unported License (CC-BY-SA) and the GNU Free Documentation License (GFDL); neither is anyone at APS responsible should someone change, edit, modify or remove any information that you may post on this APS site or any of its associated projects.

==Trademarks==

Any of the trademarks, service marks, collective marks, design rights or similar rights that are mentioned, used or cited in the articles of the APS site are the property of their respective owners. Their use here does not imply that you may use them for any purpose other than for the same or a similar informational use as contemplated by the original authors of these APS articles under the CC-BY-SA and GFDL licensing schemes. Unless otherwise stated APS is neither endorsed by nor affiliated with any of the holders of any such rights and as such APS cannot grant any rights to use any otherwise protected materials. Your use of any such or similar incorporeal property is at your own risk.

==Personality rights==

This APS site contains material which may portray an identifiable person who is alive or deceased recently. The use of images of living or recently deceased individuals is, in some jurisdictions, restricted by laws pertaining to personality rights, independent from their copyright status. Before using these types of content, please ensure that you have the right to use it under the laws which apply in the circumstances of your intended use. You are solely responsible for ensuring that you do not infringe someone else's personality rights.

==Jurisdiction and legality of content==

Publication of information found in this APS site may be in violation of the laws of the country or jurisdiction from where you are viewing this information. The APS database is stored on servers in the United Kingdom, and is maintained in reference to the protections afforded under local law. Laws in your country or jurisdiction may not protect or allow the same kinds of speech or distribution. We does not encourage the violation of any laws, and cannot be responsible for any violations of such laws, should you link to this domain or use, reproduce or republish the information contained herein.

APS:Privacy policy

2013-06-28T20:24:21Z

Admin: Protected "APS:Privacy policy" ([Edit=Allow only administrators] (indefinite) [Move=Allow only administrators] (indefinite)) [cascading]

TO COMPLETE

APS:Privacy policy

2013-06-28T20:23:42Z

Admin: Created page with "TO COMPLETE"

TO COMPLETE

APS:General disclaimer

2013-06-28T20:22:31Z

Admin: /* Trademarks */

APS:General disclaimer

2013-06-28T20:21:42Z

Admin: /* No formal peer review */

==No formal peer review==

Our active community of editors uses tools such as the Special:Recentchanges and Special:Newpages feeds to monitor new and changing content. However, APS is not uniformly peer reviewed; while readers may correct errors or engage in casual peer review, they have no legal duty to do so and thus all information read here is without any implied warranty of fitness for any purpose or use whatsoever. Even articles that have been vetted by informal peer review or featured article processes may later have been edited inappropriately, just before you view them.

None of the contributors, sponsors, administrators or anyone else connected with APS in any way whatsoever can be responsible for the appearance of any inaccurate or libelous information or for your use of the information contained in or linked from these web pages.
No contract; limited license

Please make sure that you understand that the information provided here is being provided freely, and that no kind of agreement or contract is created between you and the owners or users of this site, the owners of the servers upon which it is housed, the individual APS contributors, any project administrators, sysops or anyone else who is in any way connected with this project or sister projects subject to your claims against them directly. You are being granted a limited license to copy anything from this site; it does not create or imply any contractual or extracontractual liability on the part of this APS site or any of its agents, members, organizers or other users.

There is no agreement or understanding between you and APS regarding your use or modification of this information beyond the Creative Commons Attribution-Sharealike 3.0 Unported License (CC-BY-SA) and the GNU Free Documentation License (GFDL); neither is anyone at APS responsible should someone change, edit, modify or remove any information that you may post on this APS site or any of its associated projects.

==Trademarks==

Any of the trademarks, service marks, collective marks, design rights or similar rights that are mentioned, used or cited in the articles of the APS site are the property of their respective owners. Their use here does not imply that you may use them for any purpose other than for the same or a similar informational use as contemplated by the original authors of these APS articles under the CC-BY-SA and GFDL licensing schemes. Unless otherwise stated Wikipedia and Wikimedia sites are neither endorsed by nor affiliated with any of the holders of any such rights and as such APS cannot grant any rights to use any otherwise protected materials. Your use of any such or similar incorporeal property is at your own risk.

==Personality rights==

This APS site contains material which may portray an identifiable person who is alive or deceased recently. The use of images of living or recently deceased individuals is, in some jurisdictions, restricted by laws pertaining to personality rights, independent from their copyright status. Before using these types of content, please ensure that you have the right to use it under the laws which apply in the circumstances of your intended use. You are solely responsible for ensuring that you do not infringe someone else's personality rights.

==Jurisdiction and legality of content==

Publication of information found in this APS site may be in violation of the laws of the country or jurisdiction from where you are viewing this information. The APS database is stored on servers in the United Kingdom, and is maintained in reference to the protections afforded under local law. Laws in your country or jurisdiction may not protect or allow the same kinds of speech or distribution. We does not encourage the violation of any laws, and cannot be responsible for any violations of such laws, should you link to this domain or use, reproduce or republish the information contained herein.

APS:General disclaimer

2013-06-28T20:21:07Z

Admin: /* No formal peer review */

==No formal peer review==

Our active community of editors uses tools such as the Special:Recentchanges and Special:Newpages feeds to monitor new and changing content. However, APS is not uniformly peer reviewed; while readers may correct errors or engage in casual peer review, they have no legal duty to do so and thus all information read here is without any implied warranty of fitness for any purpose or use whatsoever. Even articles that have been vetted by informal peer review or featured article processes may later have been edited inappropriately, just before you view them.

None of the contributors, sponsors, administrators or anyone else connected with APS in any way whatsoever can be responsible for the appearance of any inaccurate or libelous information or for your use of the information contained in or linked from these web pages.
No contract; limited license

Please make sure that you understand that the information provided here is being provided freely, and that no kind of agreement or contract is created between you and the owners or users of this site, the owners of the servers upon which it is housed, the individual APS contributors, any project administrators, sysops or anyone else who is in any way connected with this project or sister projects subject to your claims against them directly. You are being granted a limited license to copy anything from this site; it does not create or imply any contractual or extracontractual liability on the part of this APS site or any of its agents, members, organizers or other users.

There is no agreement or understanding between you and APS regarding your use or modification of this information beyond the Creative Commons Attribution-Sharealike 3.0 Unported License (CC-BY-SA) and the GNU Free Documentation License (GFDL); neither is anyone at APS responsible should someone change, edit, modify or remove any information that you may post on Wikipedia or any of its associated projects.

==Trademarks==

Any of the trademarks, service marks, collective marks, design rights or similar rights that are mentioned, used or cited in the articles of the APS site are the property of their respective owners. Their use here does not imply that you may use them for any purpose other than for the same or a similar informational use as contemplated by the original authors of these APS articles under the CC-BY-SA and GFDL licensing schemes. Unless otherwise stated Wikipedia and Wikimedia sites are neither endorsed by nor affiliated with any of the holders of any such rights and as such APS cannot grant any rights to use any otherwise protected materials. Your use of any such or similar incorporeal property is at your own risk.

==Personality rights==

This APS site contains material which may portray an identifiable person who is alive or deceased recently. The use of images of living or recently deceased individuals is, in some jurisdictions, restricted by laws pertaining to personality rights, independent from their copyright status. Before using these types of content, please ensure that you have the right to use it under the laws which apply in the circumstances of your intended use. You are solely responsible for ensuring that you do not infringe someone else's personality rights.

==Jurisdiction and legality of content==

Publication of information found in this APS site may be in violation of the laws of the country or jurisdiction from where you are viewing this information. The APS database is stored on servers in the United Kingdom, and is maintained in reference to the protections afforded under local law. Laws in your country or jurisdiction may not protect or allow the same kinds of speech or distribution. We does not encourage the violation of any laws, and cannot be responsible for any violations of such laws, should you link to this domain or use, reproduce or republish the information contained herein.

APS:General disclaimer

2013-06-28T20:20:21Z

Admin: /* Jurisdiction and legality of content */

==No formal peer review==

Our active community of editors uses tools such as the Special:Recentchanges and Special:Newpages feeds to monitor new and changing content. However, APS is not uniformly peer reviewed; while readers may correct errors or engage in casual peer review, they have no legal duty to do so and thus all information read here is without any implied warranty of fitness for any purpose or use whatsoever. Even articles that have been vetted by informal peer review or featured article processes may later have been edited inappropriately, just before you view them.

None of the contributors, sponsors, administrators or anyone else connected with APS in any way whatsoever can be responsible for the appearance of any inaccurate or libelous information or for your use of the information contained in or linked from these web pages.
No contract; limited license

Please make sure that you understand that the information provided here is being provided freely, and that no kind of agreement or contract is created between you and the owners or users of this site, the owners of the servers upon which it is housed, the individual APS contributors, any project administrators, sysops or anyone else who is in any way connected with this project or sister projects subject to your claims against them directly. You are being granted a limited license to copy anything from this site; it does not create or imply any contractual or extracontractual liability on the part of Wikipedia or any of its agents, members, organizers or other users.

There is no agreement or understanding between you and APS regarding your use or modification of this information beyond the Creative Commons Attribution-Sharealike 3.0 Unported License (CC-BY-SA) and the GNU Free Documentation License (GFDL); neither is anyone at APS responsible should someone change, edit, modify or remove any information that you may post on Wikipedia or any of its associated projects.

==Trademarks==

Any of the trademarks, service marks, collective marks, design rights or similar rights that are mentioned, used or cited in the articles of the APS site are the property of their respective owners. Their use here does not imply that you may use them for any purpose other than for the same or a similar informational use as contemplated by the original authors of these APS articles under the CC-BY-SA and GFDL licensing schemes. Unless otherwise stated Wikipedia and Wikimedia sites are neither endorsed by nor affiliated with any of the holders of any such rights and as such APS cannot grant any rights to use any otherwise protected materials. Your use of any such or similar incorporeal property is at your own risk.

==Personality rights==

This APS site contains material which may portray an identifiable person who is alive or deceased recently. The use of images of living or recently deceased individuals is, in some jurisdictions, restricted by laws pertaining to personality rights, independent from their copyright status. Before using these types of content, please ensure that you have the right to use it under the laws which apply in the circumstances of your intended use. You are solely responsible for ensuring that you do not infringe someone else's personality rights.

==Jurisdiction and legality of content==

Publication of information found in this APS site may be in violation of the laws of the country or jurisdiction from where you are viewing this information. The APS database is stored on servers in the United Kingdom, and is maintained in reference to the protections afforded under local law. Laws in your country or jurisdiction may not protect or allow the same kinds of speech or distribution. We does not encourage the violation of any laws, and cannot be responsible for any violations of such laws, should you link to this domain or use, reproduce or republish the information contained herein.

APS:General disclaimer

2013-06-28T20:19:18Z

Admin: Created page with "==No formal peer review== Our active community of editors uses tools such as the Special:Recentchanges and Special:Newpages feeds to monitor new and changing content. However..."

==No formal peer review==

Our active community of editors uses tools such as the Special:Recentchanges and Special:Newpages feeds to monitor new and changing content. However, APS is not uniformly peer reviewed; while readers may correct errors or engage in casual peer review, they have no legal duty to do so and thus all information read here is without any implied warranty of fitness for any purpose or use whatsoever. Even articles that have been vetted by informal peer review or featured article processes may later have been edited inappropriately, just before you view them.

None of the contributors, sponsors, administrators or anyone else connected with APS in any way whatsoever can be responsible for the appearance of any inaccurate or libelous information or for your use of the information contained in or linked from these web pages.
No contract; limited license

Please make sure that you understand that the information provided here is being provided freely, and that no kind of agreement or contract is created between you and the owners or users of this site, the owners of the servers upon which it is housed, the individual APS contributors, any project administrators, sysops or anyone else who is in any way connected with this project or sister projects subject to your claims against them directly. You are being granted a limited license to copy anything from this site; it does not create or imply any contractual or extracontractual liability on the part of Wikipedia or any of its agents, members, organizers or other users.

There is no agreement or understanding between you and APS regarding your use or modification of this information beyond the Creative Commons Attribution-Sharealike 3.0 Unported License (CC-BY-SA) and the GNU Free Documentation License (GFDL); neither is anyone at APS responsible should someone change, edit, modify or remove any information that you may post on Wikipedia or any of its associated projects.

==Trademarks==

Any of the trademarks, service marks, collective marks, design rights or similar rights that are mentioned, used or cited in the articles of the APS site are the property of their respective owners. Their use here does not imply that you may use them for any purpose other than for the same or a similar informational use as contemplated by the original authors of these APS articles under the CC-BY-SA and GFDL licensing schemes. Unless otherwise stated Wikipedia and Wikimedia sites are neither endorsed by nor affiliated with any of the holders of any such rights and as such APS cannot grant any rights to use any otherwise protected materials. Your use of any such or similar incorporeal property is at your own risk.

==Personality rights==

This APS site contains material which may portray an identifiable person who is alive or deceased recently. The use of images of living or recently deceased individuals is, in some jurisdictions, restricted by laws pertaining to personality rights, independent from their copyright status. Before using these types of content, please ensure that you have the right to use it under the laws which apply in the circumstances of your intended use. You are solely responsible for ensuring that you do not infringe someone else's personality rights.

==Jurisdiction and legality of content==

Publication of information found in this APS site may be in violation of the laws of the country or jurisdiction from where you are viewing this information. The APS database is stored on servers in the United Kingdom, and is maintained in reference to the protections afforded under local law. Laws in your country or jurisdiction may not protect or allow the same kinds of speech or distribution. Wikipedia does not encourage the violation of any laws, and cannot be responsible for any violations of such laws, should you link to this domain or use, reproduce or republish the information contained herein.

Programs

2013-06-16T20:33:13Z

Admin: /* Canonical flow chart */

== Codes ==
{| class="wikitable"
|-
! Name and link !! Comments !! Date
|-
| Standard APS || MatLab, by Mahamed G. H. Omran || 2013-06-10
|-
| [[Media:Standard APS C.zip|Standard APS]] || C (zipped), by Maurice Clerc. Include a "tryMore" option || 2013-06-15
|-
| [[Media:Research_APS_C.zip|Research APS]] || C (zipped), by Maurice Clerc|| 2013-06-10
|-
| || ||
|}

Presentation

2013-06-16T20:31:47Z

Admin:

Sandbox

2013-06-16T20:30:48Z

Admin: /* Text + Image Map */

== Math test ==
Use LaTeX syntax. 

Warning: the Preview doesn't work for mathematical expressions. You have to Publish (or Save page).

$N=20sqrt{D}$

$$
\operatorname{erfc}(x) =
\frac{2}{\sqrt{\pi}} \int_x^{\infty} e^{-t^2}\,dt =
\frac{e^{-x^2}}{x\sqrt{\pi}}\sum_{n=0}^\infty (-1)^n \frac{(2n)!}{n!(2x)^{2n}}
$$

<math>
N=\max\left(40+2\sqrt{D},\sqrt{40^{2}+\left(D+2\right)^{2}}\right)\label{eq:N_popsize}
</math>

== Text + Image Map ==
<imagemap>
Image:Flow_chart.png|right|thumb|280px|Standard APS flow chart

rect 6 5 368 122 [[Initialisation|Initialisation]]
rect 198 234 563 346 [[Selection|Selection]]
rect 199 426 562 539 [[Expansion|Expansion]]
rect 198 617 563 732 [[Contraction|Contraction]]
rect 197 810 564 925 [[Local search|Local search]]
rect 134 547 268 565 [[Improvement|Improvement]]
rect 133 738 268 752 [[Improvement|Improvement]]
desc none
</imagemap>
The main idea was to define ... 

...

...

...

...

Programs

2013-06-16T08:22:33Z

Admin: /* Codes */

== Canonical flow chart ==
<imagemap>
Image:Flow_chart.png|center|250px

rect 6 5 368 122 [[Initialisation|Initialisation]]
rect 198 234 563 346 [[Selection|Selection]]
rect 199 426 562 539 [[Expansion|Expansion]]
rect 198 617 563 732 [[Contraction|Contraction]]
rect 197 810 564 925 [[Local search|Local search]]
rect 134 547 268 565 [[Improvement|Improvement]]
rect 133 738 268 752 [[Improvement|Improvement]]

desc none
</imagemap>

Of course, the algorithm may stop after any phase, if a given stop criterion is met. This is not represented here, for simplicity.

== Codes ==
{| class="wikitable"
|-
! Name and link !! Comments !! Date
|-
| Standard APS || MatLab, by Mahamed G. H. Omran || 2013-06-10
|-
| [[Media:Standard APS C.zip|Standard APS]] || C (zipped), by Maurice Clerc. Include a "tryMore" option || 2013-06-15
|-
| [[Media:Research_APS_C.zip|Research APS]] || C (zipped), by Maurice Clerc|| 2013-06-10
|-
| || ||
|}

File:Standard APS C.zip

2013-06-16T08:20:56Z

Admin: Admin uploaded a new version of "File:Standard APS C.zip": Include the "tryMore" option. Not pure standard, but significantly improve the performance on some problems.

== Licensing ==
{{GPL}}

Programs

2013-06-15T20:54:53Z

Admin: /* Codes */

== Canonical flow chart ==
<imagemap>
Image:Flow_chart.png|center|250px

rect 6 5 368 122 [[Initialisation|Initialisation]]
rect 198 234 563 346 [[Selection|Selection]]
rect 199 426 562 539 [[Expansion|Expansion]]
rect 198 617 563 732 [[Contraction|Contraction]]
rect 197 810 564 925 [[Local search|Local search]]
rect 134 547 268 565 [[Improvement|Improvement]]
rect 133 738 268 752 [[Improvement|Improvement]]

desc none
</imagemap>

Of course, the algorithm may stop after any phase, if a given stop criterion is met. This is not represented here, for simplicity.

== Codes ==
{| class="wikitable"
|-
! Name and link !! Comments !! Date
|-
| Standard APS || MatLab, by Mahamed G. H. Omran || 2013-06-10
|-
| [[Media:Standard APS C.zip|Standard APS]] || C (zipped), by Maurice Clerc || 2013-06-15
|-
| [[Media:Research_APS_C.zip|Research APS]] || C (zipped), by Maurice Clerc|| 2013-06-10
|-
| || ||
|}

File:Standard APS C.zip

2013-06-15T20:52:49Z

Admin:

== Licensing ==
{{GPL}}