LISTSERV mailing list manager LISTSERV 16.0

Help for EC-DIGEST-L Archives


EC-DIGEST-L Archives

EC-DIGEST-L Archives


EC-DIGEST-L@LISTSERV.GMU.EDU


View:

Message:

[

First

|

Previous

|

Next

|

Last

]

By Topic:

[

First

|

Previous

|

Next

|

Last

]

By Author:

[

First

|

Previous

|

Next

|

Last

]

Font:

Monospaced Font

LISTSERV Archives

LISTSERV Archives

EC-DIGEST-L Home

EC-DIGEST-L Home

EC-DIGEST-L  March 2021

EC-DIGEST-L March 2021

Subject:

EC-Digest v35n3

From:

Eric 'Siggy' Scott <[log in to unmask]>

Reply-To:

Evolutionary Computation Digest <[log in to unmask]>

Date:

Thu, 4 Mar 2021 18:11:52 -0500

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (386 lines)

Evolutionary Computation Digest — Monday, 01 March 2021, Volume
35: Issue 3

SUBMISSION ADDRESS: [log in to unmask]
NEW LIST ARCHIVE: http://listserv.gmu.edu/cgi-bin/wa?A0=EC-DIGEST-L

(UN)SUBSCRIPTION INSTRUCTIONS: at the bottom of this email

********************************************************************************
Today's Topics:

Announcements:
----
- 05 March: Phd offer: Integration of Machine Learning into the
Resolution of MO-VRPTWs with Applications in Hospital Environment

 CFPs (with submission deadline)
 ----
 - 12 April: Evolutionary Algorithms for High Performance Computing
(GECCO Workshop)
 - 12 April: GECCO Competition on Optimal Camera Placement (OCP) and
Unicost Set Covering (USCP)
 - 12 April: Workshop on Understanding Reproducibility in Evolutionary
Computation (GECCO)
 - 30 April: Intl. Conf. on Metaheuristics and Nature Inspired
Computing (META'2021)


********************************************************************************
CALENDAR OF EC-RELATED ACTIVITIES:

April 7–9, 2021, Seville, Spain: EvoStar 2021

July 10–14, 2021, Lille, France: GECCO 2021


********************************************************************************
Sender: Laetitia Jourdan <[log in to unmask]>
Subject: Phd offer: Integration of Machine Learning into the
Resolution of MO-VRPTWs with Applications in Hospital Environment

* THE DEADLINE FOR APPLICATIONS: MARCH 5th 2021 *

**** Context
ORKAD (Operations Research, Knowledge And Data) is a research team
within the OPTIMA thematic group of the CRIStAL research center
(Centre de Recherche en Informatique, Signal et Automatique de Lille)
(UMR CNRS 9189) of the University of Lille (France). The main
objective of the ORKAD team is to simultaneously exploit combinatorial
optimization and data mining in order to solve optimization problems.
Despite the two scientific domains having evolved more or less
independently from each other, the synergy between combinatorial
optimization and data mining offers the opportunity of improving the
performance of optimization methods with help data mining and, on the
other hand, to solve data mining problems more efficiently with the
help of operations research methods [Dhaenens-Jourdan2016]. Our
approaches are mainly based on mono- and multi-objective combinatorial
optimization.

INOCS (INtegrated Optimization problems with Complex Structure) is an
INRIA’s research team part of the OPTIMA group of CRIStAL in
Lille(France). The INOCS team aims to develop new models, algorithmic
techniques and implementations for problems with complex structure
according to three types of optimization paradigms: mathematical
optimization, bilevel optimization and robust/stochastic optimization.

This thesis is a collaboration between the two teams, ORKAD and INOCS.
The objective of the thesis is to investigate the use of machine
learning techniques to solve multi-objective combinatorial
optimization problems and in particular Multi-Objective Vehicle
Routing Problems with Time Windows.


**** Objective
This thesis aims to investigate the use of machine learning to solve
Multi-Objective Combinatorial Optimization Problems and in particular
the MO-VRPTW [Jozefowiez2008]. A number of studies have emerged in
recent years to integrate learning techniques in optimization
algorithms for routing problems. These works have shown that
discovering the structural properties of high-quality solutions, can
strongly affect and enhance the performance of heuristic algorithms
for routing problems [Arnold2019c]. It is also well known that
high-quality solutions of a vehicle routing problem are highly similar
to optimal solutions, that is, are structurally close to the global
optima. Generally, a single objective that usually models an
economical aspect is taken into account in the modelisation of the
problem. This may be acceptable when merchandise is transported, but
may not be the case when it comes to the transport of people. In the
latter case, it is essential to take into account the comfort of the
passengers, while assuring to obtain low cost routes to enhance the
performance of the service company.

This leads to a compromise where both aspects are taken into account,
i.e., multi-objective optimization.
First, the transposition to the multi-objective case of the method
developed in [Arnold2019a] will be studied and experiments will be
conducted on literature benchmarks. Then, the aim will be to
investigate and understand how the properties of high-quality
solutions with respect to optimal solutions adapt to the
multi-objective context, where, usually, the optimization of one
objective results in the detriment of the other(s). This will lead to
the development of novel ways to integrate machine learning in both
exact algorithms and metaheuristics.

***** Application

The applicants should send in one pdf file to
[log in to unmask], [log in to unmask],
[log in to unmask] before the deadline (March 5th):
- CV
- Academic records + Diploma
- Motivation letter
- Reference letter
- if existing publications

The selected candidates will be contacted for interview then invited
to submit their applications to the second stage for end of March.

------------------------------------------------------
Pr. Laetitia Jourdan
Team Leader ORKAD
http://secure-web.cisco.com/1a69NZBbaOnfLP5f1vNGTM3IxIXMJgt4A7EydBsuxAKMwxoKJ2ADgdjUm5AQtQNMHxcgKXlqeQqU49CwU7MvV7yZmOFqQRDN6V11lI-qfi_0Mu_cOkm6HbnZX3XExkGkCn_2ElpnkQ7-I8gSOs1fdKWsCbiuw0EHb0KjlZvWEV3wrdDpsTne-QbR0cAme-_N5tfWG1Co8HqY0YTZG8qSU6aC8Dy33Vm1ODGXGXCG_bgn6ELgPHwVZ1KHNZVcbP-R5DRUBuQ9Pw2dBDDav83FBOfMNYS2jR_1WGGbaBu_aIrwh0MSdus7Czn8KZoiWSVWymNVlFLicTLzMY5puEWVk4uQdZ8gNG3YTSRBshLM5vamUUlj7jScZa0GNELB6AGJicB-Uvj3Sx4D3kUx4rGbhtVx7ZZt7E-3aGiueJb5UuIS_sytHX1ZcDxc6B7O92Bv4dHi7RIuU0fwgNXO5313NtA/http%3A%2F%2Forkad.univ-lille.fr%2F
CRIStAL/Université de Lille/CNRS
Bat ESPRIT
Cité Scientifique
59655 Villeneuve d’Ascq Cedex
FRANCE
Mail: [log in to unmask]
Phone FST/CRIStAL: +33 (0)3 28 77 85 19


********************************************************************************
Sender: EC-Digest Editor
Subject: GECCO’21 Evolutionary Algorithm in High Performance Computing
Workshop Call for Papers

Dear colleagues,

We would like to notify you about the upcoming ACM Evolutionary
Algorithms in High Performance Computing Workshop at GECCO 2021, which
is to be held virtually at Lille, France, from July 10-14, 2021.
Please be aware that GECCO will be entirely virtual because of
COVID-19, and so it will be necessary for a pre-recorded presentation
to be provided for accepted papers.

Scope and Topics of Interest

The wide variety of parallel and distributed versions of EAs make them
an ideal candidate for use with HPC systems. Consequently, EAs have
gathered considerable attention for their ability to accelerate
finding solutions for a variety of computationally expensive problem
domains, including reinforcement learning, neural architecture search,
and model calibration for complex simulations. However, use of HPC
resources adds an implicit secondary objective of ensuring those
resources are used efficiently. This means that practitioners have to
make decisions regarding evolutionary algorithms tailored for maximum
HPC resource use, as well as associated software and hardware support.
New EA-oriented HPC benchmarks might also be needed to guide
practitioners in making those decisions.


We are looking for papers on the following sub-topics to facilitate discussion:

 - algorithmic — what novel EA variants best exploit HPC resources?
 - benchmarks — are there HPC specific measures for EA performance?
 - hardware — can we improve use of HPC hardware, such as GPUs?
 - software — what EA software, or software development practices,
best leverage HPC capabilities?

More information can be found at our website,
https://secure-web.cisco.com/1ENh7s709aYj_mxCYaYSBCClyJVorKNXlFTVvzXenwGxLdyJLO_NTaVvQeyrPrMxUO1Y28vihPo6VnKNLtjzR4algWg0Ul0ED_Leivc3x80bo1hkgRWV0PTT_ignVxH08VCD5qmfEtUoSAudqDnFo-R7uEbdaviHvov0mDwG3XykwyqWPPIWehIVNSragm-BxUv4RUHBIP_RKtQN7w3PL6pVh_mEE2G7eCTVenXQ78eP9AxP1zmytqVrr3XeJOsYV6E4g-_xt28EbX5SDf0EXAn6RYGspOtFcbXs8FXDK0Hgl5s0pKGTl03i7ABYfxdu6h0d20QgNNFsGDMOZH77L1_GEACm921OOC4dYQig3ha-vUrz5wq-VPputXjSGeAD8m-95bW1VZ0pa-yv3R4MJKslqWy-HzxR-niO1fN8vvEe5r1EcPaStuFEH8gy74iiyJLv9QKXrOm2JA09axV20lQ/https%3A%2F%2Fpiprrr.github.io%2Fgecco_eahpc_workshop_site%2F2021%2F .

Submission and Important Dates

 - Paper submissions open: February 11, 2021
 - Paper submission deadline: April 12, 2021
 - Notification of acceptance: April 26, 2021
 - Camera ready submission: May 3, 2021
 - Author registration deadline: May 3, 2021
 - Conference date: July 10-14, 2021

This email sent on behalf of the EAHPC organizers, and we apologize
for any multiple postings. Any questions concerning submissions can be
addressed to [log in to unmask]


********************************************************************************
Sender: Julien Lepagnot <[log in to unmask]>
Subject: GECCO 2021 Competition on OCP and USCP - Call for
participation [kind reminder]

Dear colleagues,

This is just a gentle reminder to not forget to register to the GECCO
2021 Competition on OCP and USCP.

For a short description of this competition, please refer to the call
for participation at
http://secure-web.cisco.com/13Yg0L9ylrCTEMkEbZZYAXlulSpZ8rUx27jdQW9H_L9FZ5PWQslVrJKEaej91_Zsr6dkbqMh7siTDWDlNptX5dfvhNB2Iqwok1h_lif7Ly4QFvKm-IkMeJ6fDmrcfxn-h9OoeaE6wsU7VfeHdwEhrWaBP02ayiFWqpm9wXmIm0NgehzCwV_gR1VIMH-1hWmkSoJOjt3zVXaoMkDzCktJH-bzMTYM9ZMNKqsa-ieVZm0zwe7bgp9Or9pKPjyfwiQGno38LFwWlJ2eye4Bj2WlQ4avziT0xB7APsaxYFrVtSN483azU-TBy_ziQ54PON0jaPWptOB1Wgm29TOMOVVIwUMyCTA3syxL5epy7tEUoPhFoPL29C6VehjG2Lg-SPbJJOMd4ecrjrfaJDIQyV0ElBZ7pvZqKejLckdksLbkV7XxAxjVnglrJi7oOHkYKL91XHIETeQ_b-Ew75BZAn6hd5Q/http%3A%2F%2Fwww.mage.fst.uha.fr%2Fbrevilliers%2Fgecco-2021-ocp-uscp-competition%2F

As soon as you decide to take part in this competition, please send an
email to [log in to unmask] to declare your intention to
compete. Early registration is strongly encouraged, so that the
organizing committee is aware of all entrant teams, and can then keep
them informed of any update regarding the organization of the
competition (e.g. deadline extension). It is also worth noting that
taking part in this competition does not require a GECCO registration,
unless a submitted GECCO Companion abstract is accepted for
publication.

Please feel free to forward this announcement to any colleagues who
may be interested in this optimization competition.

We are looking forward to your registrations and welcome questions and comments.


********************************************************************************
Sender: Manuel López-Ibáñez <[log in to unmask]>
Subject: Call for Papers: Workshop on Understanding Reproducibility in
Evolutionary Computation (Benchmarking@GECCO2021)

1st Workshop on Understanding Reproducibility in Evolutionary Computation
http://secure-web.cisco.com/1RvI0QW1KZxSano7_ywaZJ9YdQZA2H_qN6d1IdhaHGNRbZQ7TNBmI74PzbFILtv_EeIy-LsROrr6aBf9uG3C8dALTL0NCYtPUgLu_qrE-3I50aTUa_QLyCLkG2uaWT3H2K5LGO7iJK4cI2kBOB4cytPyGMFyyGUhqptBXLd-o2z3rfnuRfsFSQnrHgt210gFhEbHhaBD5mrcTzZmRbxNsk-Xys2WtVPmebLgTT0b48srUpdpr6eUMYHC1x1YeOPK3MSjMGwMUDYTPoS-7ypEZrMOr_h8crTGZgUoILNkHT7e3wk3Dog_By1tLDtZPJvLsTP7pmyVJUU73-7EBhsmQxroZ23YFcPr7nFBvjSt-eUBVZnFtH6CZEvTcdwJuH-PorICF6ZSh8-qpWganPpEM0H3nCrXBil6ysYM1MuuDMrW_ZkAmhPCcSQYfs-rYDHY9ACUkK73-gRnlhp1P_VcEYg/http%3A%2F%2Flopez-ibanez.eu%2Freproducibility-gecco%2F

co-organised with

Good Benchmarking Practices for Evolutionary Computation
(Benchmarking@GECCO-2021)
https://sites.google.com/view/benchmarking-network/home/activities/gecco-2021-workshop

to be held online as part of

The Genetic and Evolutionary Computation Conference (GECCO 2021),
July 10-14 2021.
https://secure-web.cisco.com/1CMpsNL0EOf1adOD_9D4LeE029f5ZIcbujjdHe6ocogWAOeoTJY3IleaIEoA0-P3gVOVqMHRBSmBLVUuV6N4JIbkPi4_bSBMs3cW3Q68uN62fl1WmhxPjKoeQT_ozg06nopF3YYGN386V6KSA13yRPiKfeLi8UUsiVQqJcS13wukFHrwnY_7ilJcaaroHSFKHt40Jd2uVRKe4qwPnU2zxmhK07wNK3dPcbuzW5k80mn3AewJrVVIvfFznFpcK_TLRMjjfZ0Sj-bdLj1zU-AMW3SU9iVKlBt0-XYngvXSdUhEkVCigJ09OYu6pVeOJhC2k7SywQsAVXjD7k2Q3T-pfUALLIOj9VYewF3M9SACsOo9Nei7z-jKu6KT0OsCDWzsk0l4gGmDAtMZZXOLfvAVWwKEqlyT9uxiY5F9PkUHZnyuwpmOLcYE4OkkVYed5BBu_D3RGs96UrnYqbewn652tOA/https%3A%2F%2Fgecco-2021.sigevo.org%2FHomePage
============================

Experimental studies are prevalent in Evolutionary Computation (EC), and
concerns about the reproducibility and replicability of such studies has
increased in recent years, following similar discussions in other scientific
fields. In this workshop, we want to raise awareness of the reproducibility
issue, shed light on the obstacles when trying to reproduce results, and
discuss best practices in making results reproducible as well as reporting
reproducibility results.

We invite submissions of papers repeating an empirical study published in a
journal or conference proceedings, either by re-using, updating or
reimplementing the necessary codes and datasets, irrespectively of whether this
code was published in some form at the time or not.

  * The original study being reproduced should not be so recent as to make the
    reproduction attempt trivial. Ideally, we suggest looking at studies that
    are at least 10 years old. However, one of the criteria for acceptance is
    what can the GECCO community learn from the reproducibility study.

  * At least one of the co-authors of the submitted paper should be one of the
    co-authors of the original study. This condition makes sure that the
    reproducibility attempt is a fair attempt at reproducing the original work.

We expect in the submitted paper:

  * Documentation of the process necessary to re-run the experiments. For
    example, you may have to retrieve the benchmark problems from the web,
    downgrade your system or some libraries, modify your original code because
    some library is nowhere to be found, reinstall a specific compiler or
    interpreter, etc.

  * A discussion on whether you consider your paper reproducible, and why you
    think this is the case. If you ran your code with fixed random seeds and you
    have recorded them, you may be able to reproduce identical results. If you
    haven’t recorded the random seeds, you may need to use statistical tests to
    check whether the conclusions still hold. You may even want to try some
    different problem instances or parameter settings to check whether results
    still hold for slightly different experimental settings.

  * Sufficient details to allow an independent reproduction of your experiment
    by a third party, including all necessary artifacts used in the attempt to
    reproduce results (code, benchmark problems, scripts to generate plots or do
    statistical analysis). Artifacts should be made publicly and permanently
    available via Zenodo (https://secure-web.cisco.com/1fSqmSnx0J6We1V2o-8Mlaf_FKsKulwsTow4RxIDkx_4CDly5PRXfn6sBrxQyt0NQ3EyTPn6qeq8t3JvfNgPwm_6eUXfi7jY4VCsy99FWtwHJ0oEgj5msp-tocFRkUSKk7SLyhquSYuN7jZ23cHbW2F72t8eNCJc5X1h3-P_lgohgGrmuMRq1KLZdSpuLPpjWwztlwGvh-iGR8YK_jwoiJQ-9WNtqgRWQ3KdQyo4vAn_UlVeOoUabUpPf4STkNvzOUTk6Gv6ycI_Va8-wjwJrBKkI4GEND33bs46vwUjGubbqK6sxo58A5G_4zhQ8rCLmwRtE0S-3xD0yfFCgax8XARHMjhRgaOGQlw_vHsGNIb7b7Co0Bzb-rqARqsf2jFCadwjRcsgV4FJwkc0ZsvV3d0mkiNAZaA4Xm04dMP0CHw2cdZ8-Hhe8giNSfZ0_Kz6-1xDXCDjSEVjpAC-i3-YmDA/https%3A%2F%2Fzenodo.org%2F) or other data repository or
    submitted together with the paper to be archived in the ACM Digital Library.

In the end, there may be various possible outcomes, and all are acceptable for
a paper: you are unable to run or compile the code, you are able to run the
code but it does not give you the expected results (or no result at all), the
program crashed regularly (before getting results), you do not remember the
parameter settings used, etc. All these are valid conclusions. We care more
about the description of the process, challenges to reproduce results, and the
lessons to be learned, than about whether you have actually been able to
reproduce the study.


Important Dates
---------------

   - 11 February 2021: Submissions open
   - 12 April 2021: Submissions deadline
   - 26 April 2021: Acceptance decisions
   - 3 May 2021: Camera-ready papers due and author registration deadline
   - July 10th-14th 2021: Online GECCO conference


********************************************************************************
Sender: El-ghazali Talbi <[log in to unmask]>
Subject: CFP META'2021@Marrakech

                                                       META'2021
International Conference on Metaheuristics and Nature Inspired Computing
                                                    27-30 Oct 2021
                                            Marrakech, Morocco
https://secure-web.cisco.com/1H8_uiVD94KkEu-eujs6BoEdpGo173epB4CxaN02xQdlT4g-X-FJVR33FwIKn3wQc7YH9WHHNvpyUwc6NpTTSkHp_5TI81tyJ_JTtlkT2EegiXNe9NxZv68EQ9wPcdVLF37mmXy5yhb6SqYn-sXjMyhcEErCIMmd1GiY3r_iUutQF7KTEwG-yWPbUZVGbGUF9i06buAq8g-wnJAEnyrs_8clMMpS1XNwYq8CHQ6Mk2xayFFIhpLBPxwEDc0zeGO3modw-cmDmMgg5gLf7SEkVSnAhqDwVptTsAJM1Az8yGzM8ivvWpJTkoWHDqWnqT5CK9btExtMge5J2ZL3SyNqciiS5ttvAE9-hhfyOjx90mAD9ar0iGzvWjPNUzZJbyTs4MBH81Dp8uJ-p6nAMc-3GzGNYLwpNIRH_FFbAAhCswFK2ftFpAKNkLMa4ODMXM0KOigqnqeQ2NXVLVNidnhk3pg/https%3A%2F%2Fmeta2021.sciencesconf.org%2F

META is one of the main event focusing on the progress of the area of
metaheuristics and their applications. As in previous editions,
META’2021 will provide an opportunity to the international research
community in metaheuristics to discuss recent research results, to
develop new ideas and collaborations, and to meet old friends and make
new ones in a friendly and relaxed atmosphere.

All selected long papers will be published in the Springer (SCOPUS, ISI,
DBLP) conference proceedings.
At least, 2 special special issues in ISI and SCOPUS journals are also
confirmed.

META'2021 welcomes presentations that cover any aspects of metaheuristic
research such as new algorithmic developments, high-impact applications,
new research challenges, theoretical developments, implementation
issues, and in-depth experimental studies. META'2021 strives for a
high-quality program that will be completed by a number of invited
talks, tutorials, workshops and special sessions.

The scope of the META conference includes, but is not limited to:
     * Local search, tabu search, simulated annealing, VNS, ILS, …
     * Evolutionary algorithms, swarm intelligence, bio-inspired
algorithms, …
     * Emergent nature inspired algorithms: quantum computing,
artificial immune systems, bee colony, DNA computing, …
     * Quantum computing
     * Parallel and distributed algorithms
     * Decomposition methods
     * Hybrid methods with machine learning, game theory, mathematical
programming, constraint programming, co-evolutionary, …
     * Application to: logistics and transportation, networks,
scheduling, data mining, engineering design, energy, cloud, bio-medical, …
     * Theory of metaheuristics, landscape analysis, convergence,
problem difficulty, very large neighbourhoods, …
     * Multi-objective optimization, bi-level optimization
     * Dynamic optimization, problems with uncertainty, stochastic
optimization, …
     * Parameter tuning (static, dynamic, adaptive, self-adaptive)
     * Hyper-heuristics, cross-domain metaheuristics
     * Software frameworks for metaheuristics and nature inspired computing


Important dates:
_______________

- Submission deadline: April 30, 2021
- Notification of acceptance: June 11, 2021


********************************************************************************
(UN)SUBSCRIPTION INSTRUCTIONS:

 - Send submissions (articles) to [log in to unmask]
 DO NOT send submissions to the [log in to unmask] address.

 - To subscribe send email to [log in to unmask] containing the
 following text in the body of the message:

   subscribe ec-digest-l <Your Name (up to 4 words)>

 - To unsubscribe send email to [log in to unmask] containing the
 following text in the body of the message:

   unsubscribe ec-digest-l

 - To change your email address, simply unsubscribe the old address
 and subscribe the new one.

 - Send other administrative requests to [log in to unmask]

********************************************************************************
 End of Evolutionary Computation Digest
********************************************************************************

Top of Message | Previous Page | Permalink

Advanced Options


Options

Log In

Log In

Get Password

Get Password


Search Archives

Search Archives


Subscribe or Unsubscribe

Subscribe or Unsubscribe


Archives

February 2022
November 2021
August 2021
May 2021
March 2021
January 2021
December 2020
November 2020
October 2020
September 2020
July 2020
June 2020
May 2020
April 2020
February 2020
January 2020
March 2019
February 2019
March 2018
February 2018
January 2018
November 2017
October 2017
September 2017
August 2017
July 2017
June 2017
May 2017
April 2017
March 2017
January 2017
December 2016
November 2016
September 2016
July 2016
June 2016
May 2016
April 2016
March 2016
January 2016
September 2015
May 2015
March 2015
October 2014
September 2014
August 2014
June 2013
May 2013
March 2013
February 2013
January 2013
August 2012
June 2012
February 2012
January 2012
December 2011
November 2011
October 2011
September 2011
August 2011
July 2011
June 2011
April 2011
March 2011
February 2011
January 2011
December 2010
November 2010
October 2010
September 2010
August 2010
July 2010
June 2010
May 2010
April 2010
March 2010
February 2010
January 2010
December 2009
November 2009
October 2009
September 2009
August 2009
July 2009
April 2009
March 2009
February 2009
January 2009

ATOM RSS1 RSS2



LISTSERV.GMU.EDU

CataList Email List Search Powered by the LISTSERV Email List Manager