Journées de l'optimisation 2018

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

Horaire Auteurs Mon horaire
Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402

TA8 Facility location

8 mai 2018 10h30 – 12h10

Salle: Metro inc. (72)

Présidée par Claudio Contardo

4 présentations

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    10h30 - 10h55

    A scalable exact algorithm for the vertex p-center problem

    • Claudio Contardo, prés., GERAD - ESG UQÀM
    • Raphael Kramer, Università degli studi di Modena e Reggio Emilia (UNIMORE - Italy)
    • Manuel Iori, Università degli Studi di Modena e Reggio Emilia

    We present a scalable relaxation algorithm for the vertex p-center problem. Our algorithm can handle to proven optimality problems derived from the TSP library containing up to 1 million nodes, this is roughly 200 times larger than the state-of-the-art solvers for this problem

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    10h55 - 11h20

    Revenue management in hub location problems

    • Gita Taherkhani, prés., University of Waterloo
    • Sibel Alumur Alev, University of Waterloo
    • Seyed Mojtaba Hosseini, University of California Irvine

    We consider one of the basic and classical revenue management model known as capacity-control discount fares within the hub location problem and develop a deterministic formulation of this problem. We further extend this model considering uncertainty associated with demand and revenues and develop a stochastic minmax regret formulation. Two exact algorithms based on a Benders reformulation are proposed to solve large-size instances of the problem.

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    11h20 - 11h45

    Hub location problem under the risk of interdiction

    • Prasanna Ramamoorthy, prés., Indian Institute of Management Ahmedabad
    • Sachin Jayaswal, Indian Institute of Management Ahmedabad
    • Ankur Sinha, Indian Institute of Management Ahmedabad
    • Navneet Vidyarthi, Concordia University

    In this paper, we study hub location problem under the risk of interdiction (HLPI). We present several formulations of the problem and compare them theoretically and computationally.
    We further develop an efficient cutting plane algorithm to solve the problem.

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    11h45 - 12h10

    Dynamic facility location problems with stochastic demands and congestion

    • Masoud Madani, prés., Concordia university
    • Ivan Contreras, Concordia University
    • Navneet Vidyarthi, Concordia University

    In this thesis, we study a multi-periodic facility location problem with stochastic demand to determine the optimal location, capacity selection and demands allocation of facilities within distinct time periods, while, each facility contains a server with a limited capacity. It causes facilities to experience a period of congestion, when not all arriving demands can be served immediately. Customers that arrive in this period might await service in a queue. This thesis perspective incorporates customers waiting costs as part of the objective. In this case, facilities do not utilize whole of the established capacity to ensure a maximum waiting time of the allocated customers. Firstly, a mathematical model is presented for a dynamic facility location problem with stochastic demand and congestion. The problem is setup as a network of spatially distributed queues and formulated as a nonlinear mixed integer program (MINLP). To transform the nonlinear congestion function to a piecewise linear, a linearization method is adapted. This method adds a set of inequalities to the model. We show that lifting this set of inequalities, with keeping generality of the method, reduces CPU times up to 3.5 times, on average. Moreover, a decent heuristic is proposed to solve the problem. Computational experiments indicate that the heuristic results in less costly solutions than them obtained by CPLEX algorithms, in 58% of relatively-difficult test problems.

Retour