[Posgrados-invop] Fwd: [Alio] Twelfth DIMACS Implementation Challenge: Vehicle Routing Problems

Tue Sep 15 18:57:39 -03 2020

-------- Mensaje reenviado --------
Asunto: 	[Alio] Twelfth DIMACS Implementation Challenge: Vehicle Routing 
Problems
Fecha: 	Tue, 15 Sep 2020 18:55:50 -0300
De: 	Irene Loiseau <irene at dc.uba.ar>
Organización: 	Depto. Computación, FCEN, UBA
Para: 	alio at dc.uba.ar

***************************************************************

*Twelfth DIMACS Implementation Challenge: Vehicle Routing Problems*

*Held in Memory of David S. Johnson*

*Organizers:*

Claudia Archetti, University of Brescia
Catherine McGeoch, D-Wave Systems
Jorge Mendoza, HEC Montréal
Panos Pardalos, University of Florida
Mauricio Resende, Amazon
Eduardo Uchoa, Universidade Federal Fluminense
Thibaut Vidal, Pontifical Catholic University of Rio de Janeiro

Presented in association with the Special Focus on Bridging Continuous 
and Discrete Optimization 
<http://dimacs.rutgers.edu/programs/sf/sf-optimization/> and the 
Implementation Challenges <http://dimacs.rutgers.edu/archive/Challenges/>.

*********************************************************************

*Announcement:

*Implementation Challenges 
<http://dimacs.rutgers.edu/programs/challenge/> trace back to the early 
years of DIMACS and to the vision of David S. Johnson to use 
experimentation as a companion to 
http://dimacs.rutgers.edu/tools/fileman/Uploads/Logos/VRP_logo_300px.pngtheory 
to gain more holistic perspective on the performance of algorithms. The 
over-arching purpose of a Challenge is to assess the practical 
performance of algorithms for a particular problem class, while 
fostering interactions that transfer ideas between research areas 
related to algorithms, data structures, implementation, and 
applications. This 12th DIMACS Implementation Challenge 
<http://dimacs.rutgers.edu/programs/challenge/vrp/> will be held in 
honor of David S. Johnson on the topic of Vehicle Routing Problems.

The Vehicle Routing Problem (VRP) and other related dispatch problems 
have been widely studied for over fifty years because they are of both 
practical relevance and theoretical interest. Designing efficient routes 
for vehicles performing distribution or service functions translates 
directly to cost savings, making vehicle routing a topic of great 
commercial interest. Moreover, the fact that it generalizes the 
Traveling Salesman Problem, but is substantially more difficult, has 
kept it in the sights of theoreticians for decades. The VRP exists in a 
myriad of variations that arise from practical considerations like 
vehicle capacities, delivery time windows, delays in road networks, and 
the ability to split deliveries.

Because of the expansive problem space, this Challenge will consider 
multiple VRP variants, representing a mix of classic VRP variants and 
newer variants inspired by practical considerations. The Challenge will 
address 7 or 8 problem variants, including some "classics" and some of 
the most challenging of the VRP family. These problems focus on features 
that are critical to bridging the gap between application and practice, 
but they lead to different structural characteristics favoring different 
solution approaches. The featured variants include:
1) Capacitated VRP (CVRP); 2) VRP with Time Windows (VRPTW); 3) 
Inventory Routing Problem (IRP); 4) VRP with Split Deliveries (VRPSD); 
5) Stochastic VRPs; 6) Capacitated Arc Routing (CARP) in realistic city 
networks; 7) CARP with time-dependent costs; and 8) Online Routing 
(under consideration but not confirmed).

We invite participants to submit instances or additional variants for 
potential inclusion. While we expect some common ideas to be applied 
across all problems, there will also be some important and necessary 
differences between methods, creating a rich and multi-faceted exchange 
throughout the Challenge.

We will leverage existing sets of problems instances and augment them 
with larger and more challenging examples, based on real transportation 
networks and city maps when possible.

The Challenge will conclude with a workshop held at DIMACS at Rutgers 
University. The workshop will pay tribute to the many contributions of 
David S. Johnson during a special banquet and related social activities. 
Teams participating in the Challenge should plan to submit a paper and 
present their work during the workshop if selected. Others are also 
invited to submit papers on novel methods for presentation at the workshop.

·*Visit the VRP Challenge website*: 
http://dimacs.rutgers.edu/programs/challenge/vrp/ 
<http://dimacs.rutgers.edu/programs/challenge/vrp/>

·*Follow the Challenge on twitter*: https://twitter.com/DIMACSChallenge 
<https://nam02.safelinks.protection.outlook.com/?url=https%3A%2F%2Ftwitter.com%2FDIMACSChallenge&data=02%7C01%7Clindac%40dimacs.rutgers.edu%7Cab543ea38a1448c4221908d8559f4e7a%7Cb92d2b234d35447093ff69aca6632ffe%7C1%7C0%7C637353489983270043&sdata=3PMeCZugpPKXn%2B1pdz4TW%2Bpucifvz5mreqgbNo07amo%3D&reserved=0> 

·*Subscribe to the mailing list*: 
http://email.rutgers.edu/mailman/listinfo/dimacs_vrp_challenge 
<http://email.rutgers.edu/mailman/listinfo/dimacs_vrp_challenge>

·*Email organizers*: dimacs_vrp_challenge_committee at email.rutgers.edu 
<mailto:dimacs_vrp_challenge_committee at email.rutgers.edu>

·*View the* VRP Challenge flyer 
<http://dimacs.rutgers.edu/tools/fileman/Uploads/Documents/VRP-Challenge/VRPChallenge_onepage_Aug2020.pdf>.

  *********************************************************************

*Call for Participation:*

The Implementation Challenge workshop is open for all to attend (subject 
to space constraints). Registration is not yet open, but you must 
register to attend. To participate in the Challenge, please visit the 
Challenge website <http://dimacs.rutgers.edu/programs/challenge/vrp/> 
for details.

*********************************************************************

Workshop web site (including workshop registration when it opens):

http://dimacs.rutgers.edu/events/details?eID=1090 
<http://dimacs.rutgers.edu/events/details?eID=1090>

_______________________________________________
DIMACS_SF_Optimization mailing list
DIMACS_SF_Optimization at email.rutgers.edu 
<mailto:DIMACS_SF_Optimization at email.rutgers.edu>
https://email.rutgers.edu/mailman/listinfo/dimacs_sf_optimization 
<https://email.rutgers.edu/mailman/listinfo/dimacs_sf_optimization>
-- 
Irene Loiseau
Departamento de Computación
Facultad de Ciencias Exactas y Naturales
Universidad de Buenos Aires

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://www.fing.edu.uy/pipermail/posgrados-invop/attachments/20200915/76e019cc/attachment-0001.html>
-------------- next part --------------
A non-text attachment was scrubbed...
Name: image001.png
Type: image/png
Size: 15901 bytes
Desc: not available
URL: <https://www.fing.edu.uy/pipermail/posgrados-invop/attachments/20200915/76e019cc/attachment-0001.png>
-------------- next part --------------
_______________________________________________
Alio mailing list
Alio at dc.uba.ar
https://listas.dc.uba.ar/cgi-bin/mailman/listinfo/alio