Journées de l'optimisation 2018

HEC Montréal, Québec, Canada, 7 — 9 mai 2018

Horaire Auteurs Mon horaire
Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402

TB6 Supply chain I

8 mai 2018 15h30 – 17h10

Salle: Serge-Saucier (48)

Présidée par Thierry Moisan

4 présentations

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    15h30 - 15h55

    Formulations and branch-and-cut algorithms for multi-trip drone routing problem with time windows

    • Chun Cheng, prés., Poly
    • Yossiri Adulyasak, HEC Montréal
    • Louis-Martin Rousseau, Polytechnique Montréal

    This paper studies a multi-trip drone routing problem with time windows, where drones' energy consumption is influenced by payload and travel distance. To tackle the nonlinear energy function, we propose two types of cuts to calculate it exactly, instead of using linear approximation methods. Two formulations are presented, which are solved by branch-and-cut algorithms. Benchmark instances are first generated for this problem. Numerical tests evaluate the performance of the formulations and compare the solutions generated by exact and approximate methods.

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    15h55 - 16h20

    Order picking in e-commerce warehouses

    • Mustapha Haouassi, prés., CIRRELT
    • Louis-Martin Rousseau, Polytechnique Montréal
    • Jorge Mendoza, Laboratoire d'Informatique de Tours
    • Yannick Kergosien, Laboratoire d'Informatique de Tours

    We tackle a problem which is closely related to the Amazon’s PrimeNow service that proposes its customers to deliver them in a competitive time-lag (1 H after the demand’s release date). We focus on the order picking process. We aim to organize the order picker’s routes to satisfy all the demands and minimize the order pickers number. We propose a MILP model and a two-stage heuristic to solve the problem.

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    16h20 - 16h45

    An online stochastic optimization approach for the management of "smart warehouses"

    • Adrien Rimélé, prés., Cirrelt
    • Michel Gendreau, Polytechnique Montréal
    • Philippe Grangier, JDA Software
    • Louis-Martin Rousseau, Polytechnique Montréal

    Robot managed ‘smart warehouses’ are winning popularity as with online retailers such as Amazon and Alibaba. We consider the joint problem of requests sequencing and storage allocation using a fleet of robots. To account for the dynamic nature of the problem, a subset of requests is revealed through the day. This study proposes an online stochastic optimization framework for this specific version of an Automated Storage and Retrieval System.

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    16h45 - 17h10

    Warehouse task prioritization

    • Thierry Moisan, prés., Université Laval
    • Philippe Grangier, JDA Software
    • Vincent Raymond, JDA Software

    Warehouse management involves a set of diverse problems. One of them concerns the prioritization of picking tasks to employees to minimize global treatment time while taking into account the warehouse state. We show how task management is usually designed and different alternative approaches that we experimented at JDA labs.