ORTEC & KU Leuven Hackathon: 

Vehicle assignment 

Registration

Teams consist of 1-5 people.Registration can be done by filling in the form:
https://forms.gle/R9j1ygQFZ9HaSVnZA

Deadline: 01/11/2023


For any further questions, please send an e-mail to:
tim.hellemans@ortec.com

About ORTEC

ORTEC is a leading global provider of advanced planning and optimization solutions. With over 35 years of experience, ORTEC offers software and consulting services for companies looking to optimize their supply chain, logistics, and workforce planning. ORTEC’s solutions are designed to help businesses reduce costs, increase efficiency, and improve customer satisfaction.

At ORTEC, we are committed to staying at the forefront of our industry. To achieve this, we collaborate with top universities such as the KU Leuven to incorporate the latest research and technology into our solutions. This allows us to provide our clients with state-of-the-art products that meet their needs and exceed their expectations.

Business Challenge

At ORTEC, we have many optimization algorithms which help us solve problems such as the Vehicle Routing Problem (VRP). However, before we can solve a VRP, a couple of other steps need to be taken. In particular, ORTEC’s customers would like to prepare for future operations. For example, receiving capacity information prior to operations. To do this, customers want to estimate the number of vehicles needed in the future, knowing the forecasted demand. With this information customers can be prepared, and the risk of operational challenges can be reduced. For example by relocating vehicles, purchasing extra vehicles, or to collaborate with a 3rd party.

Contest

In this contest, you are given:

·       A fixed set of distribution centers (with given locations).

·       A forecasted demand in the form of customers (assigned to distribution centers), their locations and their order frequency.

It is then up to you to use any methodology (OR/ML/…) in order to come up with an algorithm (with a reasonable runtime of  minutes on any “normal” computer for any “reasonable” instance) which chooses how many vehicles to use & assigns those vehicles to distribution centers in such a way that the VRPs that emerge from simulating instances from the forecasted demand have low cost solutions.

Agenda

This hackathon will take 2 weeks in total in the period 06-17 November.
  In particular the agenda is:

·       06/11: Opening day with problem setting & all involved parties are on site at KU Leuven (with free lunch, pun intended).

09:00: Welcome @ KULeuven

09:30-10:30: Problem introduction, practical guidelines & time for questions

10:30-12:00: Time to work & meet the competition hosts

12:00-13:00: Lunch

13:00-14:00 Last chance to ask questions in person.
GOAL is that after this day, you understand the problem and all technical hurdles involved are taken.

·       17/11: Final presentations at ORTEC Belgium with reception (Boortmeerbeek).

Each day of the hackathon, someone from ORTEC will be available for questions & remarks.


This event has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 822214.