3 présentations

• 
  09h00 - 09h25

  Loading equipment planning considering optimization and simulation for the fulfillment of a production plan in open pit mining

  • Hector Gonzalez, prés., Universidad de Chile
  • Nelson Morales, Universidad de Chile
  • Fabian Manriquez, Universidad de Chile

  Open pit mining is an equipment intensive process. By incorporating a simulation model together with an equipment assignment methodology, it was possible to capture the uncertainty of shovel-truck systems and achieve an adequate loading equipment allocation. This allows both minimizing operating costs and guaranteeing compliance with a production plan.

  Keywords: Optimization model, Simulation model, Equipment Allocation
• 
  09h25 - 09h50

  On-line car parking via 0-1 programming

  • Marko Mladenovic, prés., UPHF
  • Thierry Delot, UPHF
  • Gilbert Laporte, HEC Montréal
  • Christophe Wilbaut, UPHF

  Cities suffer from high traffic congestion of which one of the main causes is the unorganized pursuit of available parking. We consider a general parking allocation scenario, in which the GPS data of a set of vehicles, such as current location and destination are available to a central agency, which will guide the vehicles toward a designated parking lot, instead to the entered destination. In its natural form, the parking allocation problem is dynamic, i.e., its input is continuously updated. Therefore, standard static allocation, assignment, problems do not apply. In this paper, we solve several parking allocation policies through a 0-1 mathematical programming model with various degrees of dynamism. The proposed policies are empirically compared based on real data gathered from three European cities: Belgrade, Luxembourg, and Lyon.
• 
  09h50 - 10h15

  Robotic process automation for financial services using integer programming

  • Sara Séguin, prés., UQAC, GERAD
  • Guillaume Routhier, CGI

  Robotic Process Automation is used to automate repetitive tasks completed by humans on a computer. In the banking sector, millions of transactions are carried out every day and are constrained by market hours. We present a linear integer model to minimize the number of robots required to carry out the transactions, as well as their reconfigurations.