10h30 - 10h55
Short- and Medium-Term Scheduling Optimization for Underground Mines
Applications of operations research to short-term underground mine scheduling are very few, mostly because of the complexity and specificity of its constraints. This presentation will discuss the advances made with a model for short- and medium-term scheduling in large underground mines. The results of the model application to real-world and fictional data sets will also be explained. Comments on future work and possibilities in this field will conclude the presentation.
10h55 - 11h20
Metaheuristics for integrated production scheduling, express material deliveries, and outbound distribution.
We propose metaheuristics to optimize the short-term production planning and scheduling at a fast-moving consumer good company. The proposed approach integrates multiple decisions. More precisely, it finds the size of the production lots; provides a detailed production schedule; triggers the express deliveries of raw materials; and manages the production distribution.
11h20 - 11h45
Models and methods for an integrated load plan design and vehicle routing problem
The distribution of goods in large structured networks is generally organized in two layers: (i) a long haul network, made of logistics hubs and terminals, and (ii) a local distribution network between a terminal and its associated customers. The routing of goods in long haul networks is studied in the field of service network design and, more precisely, load plan design. Local distribution deals with solving vehicle routing problems. We consider a case where meeting the delivery deadline is particularly hard which motivates the joint design of load plans and and local delivery routes. We present models to solve this problem as a continuous time service network design.
11h45 - 12h10
A bi-objective approach for integrating vehicle routing operations into tactical clustering decisions
In this work we consider a bi-objective vehicle routing problem in which, in addition to the classical minimization of the total routing cost, the operator is also required to minimize the maximum diameter of the routes, this is the maximum distance between any two customers serviced within the same route. This problem arises in multiple practical applications. In addition to the problem description, we provide a formal linear-integer formulation of the problem and an ad-hoc constraint method capable of handling small-size problems. We also introduce a variable neighborhood search-based algorithm for the solution of larger problems. Finally, we provide a critical analysis of the results obtained after executing our algorithm on some classical instances of the capacitated vehicle routing problem.