« search calendars

« 12th DIMACS Implementation Challenge: Vehicle Routing Problems

12th DIMACS Implementation Challenge: Vehicle Routing Problems

October 05, 2020 - October 07, 2020

Location:

DIMACS Center

Rutgers University

CoRE Building

96 Frelinghuysen Road

Piscataway, NJ 08854

Click here for map.

Organizer(s):

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

Contact(s):

Tamra Carpenter, DIMACS
CoRE Building
96 Frelinghuysen Road
Piscataway, NJ 08854
E: tcar@dimacs.rutgers.edu
V: 848-445-4631


Implementation Challenges trace back to the early years of DIMACS and to the vision of David S. Johnson to use experimentation as a companion to theory 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 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 8 -10 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.

An initial list of the variants under consideration is:

1) Capacitated VRP
2) VRP with Time Windows
3) Inventory Routing Problem
4) VRP with Split Deliveries
5) VRP with transshipment or transfer facilities
6) Routing in realistic city networks
7) Stochastic VRPs
8) Online/Routing for Mobility-on-Demand.

We invite participants to submit both additional variants of potentially broad interest as well as instances for the variants that will be included in the Challenge.

More details are forthcoming soon. Please subscribe to the VRP Challenge mailing list and we will notify you when there is more information.

If you have questions for the organizers please send email to the organizing committee. (dimacs_vrp_challenge_committee@email.rutgers.edu)

View the VRP Challenge flyer.

 

Details on how to participate will be posted soon.

Registration is required but not yet open.