research and data science. The PhD is in collaboration with Padam
(www.padam.io <http://www.padam.io/>), a company working on a turnkey
platform and developing simulation tools for on-demand transportation
systems.
At the interface of 2 hot and trend topics, the project will be oriented
on the following aspects:
- The design of exact and heuristics algorithms for routing problems to
efficiently tackle instance of the company
- The use of original data science and probabilistic methods to improve
routing decisions
To achieve this goal, the candidate will have to suggest novel
algorithms combining advanced optimization techniques (e.g. mathematical
programming models, hyper- and meta- heuristics) with robust and
data-driven optimization techniques.
Applicants should have (or be about to finish) a relevant master degree.
Good knowledge of operations research techniques (integer linear
programming, graphs etc.) and data science/machine learning tools are
strongly recommended. The applicant should also have good programming
skills in any programming language. Expertise in working with a
unix-like system (e.g. ubuntu) and knowledge in database models will be
appreciated.
The PhD thesis will take place in 2 locations:
- Paris XIII University - 99, av. Jean-Baptiste Clément - 93430
Villetaneuse
- Padam - 34 boulevard Sebastopol - 75001 Paris
For more information contact:
Emiliano Traversi traversi@lipn.univ-paris13.fr
<mailto:traversi@lipn.univ-paris13.fr>
Roberto Wolfler Calvo wolfler@lipn.univ-paris13.fr
<mailto:wolfler@lipn.univ-paris13.fr>
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
