Date: March, 29th, 14h30 Place: Inria Lille-Nord Europe Abstract: This seminar will show mathematical models and algorithms for optimizing the management of crews and aircrafts of an airline company operating flights in Canary Islands. It is the result of a research work for a company, and it can be extended…
Date: January, 29th, 11h00 Place: ULB Bruxelles Abstract: In this talk we introduce an stochastic optimization/game-theory model to describe an energy market working on a network (transmission), including renewal energy suppliers, distributed generators and demand nodes. We characterize Nash equilibria and pricing rules in this stochastic setting as well as…
Date: December, 12th, 12h00 Place: Inria Lille-Nord Europe Abstract: In this work we face the problem of finding strong Stackelberg equilibrium in stochastic games. We study a familiy of stochastic games where equilibrium in stationary policies exist and prove the convergence of value iteration and policy iteration procedures. Preliminary computational…
Date: November, 17th, 16h00 Place: Inria Lille-Nord Europe Abstract: In optimization problems, it is common the case where the value of some variables is not well known, or it is uncertain. Traditionally, this uncertainty has been dealt with, from the point of view of Stochastic Optimization, which models these variables…
Date: November, 17th, 11h00 Place: Inria Lille-Nord Europe Abstract: Given a set of client demands and potential facility locations, the (discrete) capacitated facility location problem (cFLP) consists in selecting a subset of locations where to install a facility, and assigning demands to these facilities without exceeding their capacity. In this…
Date: February 8th 2017, 11h00 Place: ULB Bruxelles Abstract: The Closest String Problem (CSP) calls for finding an n-string that minimizes its maximum Hamming distance from m given n-strings. This problem, originated in Code Theory, has recently be considered for applications in Bioinformatics. In the last years, integer linear programs…
Date: November, 30th, 11h00 Place: Inria Lille-Nord Europe Abstract: Enhancing visual attractiveness or “beauty” in a routing plan has proven to be an effective way to facilitate practical implementation and positive collaboration among tactical and operational levels in the organization. This is the reason why many authors have considered, either…
Date: November, 3rd, 14h00 Place: Inria Lille-Nord Europe Abstract: We introduce two large neighborhood search approaches for solving the multi-trip vehicle routing problem with time windows, where each vehicle can perform several routes to serve a set of customers. Besides considering a time window at the depot, the working time…
Date: October, 13th, 12h00 Place: ULB Bruxelles Abstract: The Discrete Ordered Median Problem (DOMP) is a modelling tool that provides flexible representations of a large variety of problems, which include most of the classical discrete location problems. In this talk we present new formulations for the DOMP and a novel…
Date: October, 11th, 15h00 Place: Inria Lille-Nord Europe Abstract: Choices of different individuals over time exhibit pairwise associations in a wide range of economic contexts. Network models for the processes by which ideas and decisions propagate through social interaction have been studied in different streams of literature. However, when the…
