Santa Claus TSP Challenge
Call for papers: Special issue and Competition
BackgroundTravelling salesman problem (TSP) is classical optimization problem that has been evolved to real-life vechile routing problems (VRP). Recent development in unmanned aerial vehicles (UAV) is bringing these problems into new dimensions.
GoalChristmas is coming and Santa Claus needs to deliver presents to the children in every family during a single day in Christmas. He can prepare his sledge and move to any start point he wants to. But when the time has come, he has to proceed fast and optimize the length of his tour. He might also use helpers and divide the tour into several sub tours. Your task is to optimize the trip.
What is it?We organize the special issue as a challenge. We invite researchers and practitioners to help Santa and give solutions to:
- Open-loop TSP
- Multiple Santa tours
- Fast processing (optional)
Competition Rules:To be defined.
Data:To keep the task reasonable, we limit the tour in Finland. We have constructed the targets to visit from OpenStreetMap buildings data. There are N=1,437,195 targets in total. Dataset is available here.
Submission:We organize the special issue as a challenge. We invite researchers and practitioners to:
- Submit your method in the competition
- Submit a paper to the special issue
- Source code
- Method description
- Citation (in case of using existing method) or Abstract (in case of novel method)
It is possible to submit your method only to the competition but we strongly recommend to submit also a paper to the special issue if the method has novelty and its performance is competitive.
Paper submissions outside the competition are allowed and can take broader view to the problem - with clear arguments how the alternative approach is relevant. All submitted papers will go through a normal review process.
|Competition opens:||1 July 2019|
|Deadline for algorithm submissions:||24 December 2019|
|Final results:||1 March 2020|
|Deadline for manuscript submissions:||1 May 2020|