Joseph Assaker Wins Bodenseo Python Competition

2019-04-27

Joseph Assaker

Joseph Assaker has brilliantly won the Bodenseo Python Competition run in collaboration with Coder-Maker. This competition is an important stage of the Coder-Maker Volunteers’ Program to enhance their coding skills.

“Joseph’s design and implementation of the solution came the closest to a professional one that would be implemented in a real-life situation”, said Bernd Klein founder and CEO of Bodenseo. Christopher Khoury and Charbel Elias came in second place.

Bodenseo is today a world sought-after Python training firm, it has served corporations in Canada, USA, and Europe coming from a wide range of industries like transport, communication, and cars. It is also teaching scientists in leading research institutes like Fraunhofer Society, Deutsches Elektronen-Synchrotron, DESY, and Centre Européen de Recherche Nucléaire, CERN. Bernd is also a lecturer at Freiburg University.

Joseph Assaker

Joseph is a Lebanese University student, 4th year, majoring in Computer Science. He started his volunteering work at Coder-Maker in January 2018.

The Competition: Optimize Elevators’ Traffic in Hotels

The aim of the competition is to create a virtual game that simulates a real-life problem and enhance skills in Python programming and data analysis.
The elevators, which could be perceived as a new technology, have been actually around for over 2,000 years. Throughout this period however, their behavior remained the same: they stay static when there's no demand and move to the target position when invoked. This model has proven to be very inefficient, especially in the modern age and most noticeably in hotels, which is in fact the scenario used in this competition. Towers with large numbers of floors cannot afford to have customers waiting unbearable periods of time for their elevators to reach them.
The goal of the simulation is to come up with an algorithm that optimizes elevators' traffic to reduce energy consumption and increase customers’ satisfaction. This algorithm's most
fundamental axiom is that for any given hotel, the ground floor is the level from which the largest number of guests will order elevators. Hence, priority is to have at least one elevator at that level so that its waiting time is as close to zero as possible, while having guests waiting on all other floors with almost absolute certainty.