2016
Authors
Amorim, P; Martins, S; Curcio, E; Almada Lobo, B;
Publication
ERCIM NEWS
Abstract
Large food retailers have to deal with a complex distribution network with multiple distribution centres, different temperature requirements, and a vast range of store formats. This project used an optimization-simulation approach to help food retailer Sonae MC make the best decisions regarding product-warehouse-outlet assignment, product delivery modes planning and fleet sizing.
2016
Authors
Amorim, P; Curcio, E; Almada Lobo, B; Barbosa Povoa, APFD; Grossmann, IE;
Publication
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Abstract
This paper addresses an integrated framework for deciding about the supplier selection in the processed food industry under uncertainty. The relevance of including tactical production and distribution planning in this procurement decision is assessed. The contribution of this paper is three-fold. Firstly, we propose a new two-stage stochastic mixed-integer programming model for the supplier selection in the process food industry that maximizes profit and minimizes risk of low customer service. Secondly, we reiterate the importance of considering main complexities of food supply chain management such as: perishability of both raw materials and final products; uncertainty at both downstream and upstream parameters; and age dependent demand. Thirdly, we develop a solution method based on a multi-cut Benders decomposition and generalized disjunctive programming. Results indicate that sourcing and branding actions vary significantly between using an integrated and a decoupled approach. The proposed multi-cut Benders decomposition algorithm improved the solutions of the larger instances of this problem when compared with a classical Benders decomposition algorithm and with the solution of the monolithic model.
2016
Authors
Motta Toledo, CFM; Arantes, MD; Bressan Hossomi, MYB; Almada Lobo, B;
Publication
COMPUTERS & OPERATIONS RESEARCH
Abstract
This paper introduces a mathematical model (together with a relaxed version) and solution approaches for the multi-facility glass container production planning (MF-GCPP) problem. The glass container industry covers the production of glass packaging (bottle and jars), where a glass paste is continuously distributed to a set of parallel molding machines that shape the finished products. Each facility has a set of furnaces where the glass paste is produced in order to meet the demand. Furthermore, final product transfers between facilities are allowed to face demand. The objectives include meeting demand, minimizing inventory investment and transportation costs, as well as maximizing the utilization of the production facilities. A novel mixed integer programming formulation is introduced for MF-GCPP and solution approaches applying heuristics and meta-heuristics based on mathematical programming are developed. A multi-population genetic algorithm defines for each individual the partitions of the search space to be optimized by the MIP solver. A variant of the fix-and-optimize improvement heuristic is also introduced. The computational tests are carried on instances generated from real-world data provided by a glass container company. The results show that the proposed methods return competitive results for smaller instances, comparing to an exact solver method. In larger instances, the proposed methods are able to return high quality solutions.
2016
Authors
Fernandes, PM; Pacheco, AP; Almeida, R; Claro, J;
Publication
EUROPEAN JOURNAL OF FOREST RESEARCH
Abstract
Large forest fires are notorious for their environmental and socio-economic impacts and are assigned a disproportionately high percentage of the fire management budget. This study addresses extremely large fires (ELF, C2500 ha) in Portugal (2003-2013). We analysed the effect of fire-suppression force variation on ELF duration, size and growth rate, versus the effect of the concomitant fire environment (namely fuel and weather) conditions. ELF occurred in highly flammable landscapes and typically were impelled by extreme fire weather conditions. Allocation of suppression resources (normalized per unit of burned area or perimeter length) was disparate among fires, suggesting inadequate incident management. Fire-suppression effort did not affect time to containment modelled by survival analysis. Regression tree analysis indicated ELF spread to be negatively affected by higher fire-suppression resourcing, less severe fire weather, lower time to containment and higher presence of <9-year-old fuels, by decreasing order of importance; regional variability was relevant. Fire environment-to-fire suppression ratios of influence were 3: 1 for fire size and 1: 1 for fire growth rate, respectively, explaining 76 and 60 % of the existing variability. Results highlight the opportunistic nature of large-fire containment. To minimize the area burned by ELF, management and operational improvements leading to faster containment are recommended, rather than higher fire-suppression resourcing; more effective identification and exploration of containment opportunities are preferable to the accumulation of suppression resources.
2016
Authors
Klimentova, X; Ushakov, AV; Vasilyev, I;
Publication
CEUR Workshop Proceedings
Abstract
In this paper we present a hybrid approach to integrative clustering based on the p-median problem with clients' preferences. We formulate the problem of simultaneous clustering of a set of objects, characterized by two sets of features, as a bi-level p-median model. An exact approach involving a branch-and-cut method combined with the simulated annealing algorithm is used, that allows one to find a two-source clustering. The proposed approach is compared with some well-known mathematical optimisation based clustering techniques applied to the NCI-60 tumour cell line anticancer drug screen dataset. The results obtained demonstrate the applicability of our approach to find competitive integrative clusterings. Copyright © by the paper's authors.
2016
Authors
Hora, J; Dias, TG; Camanho, A;
Publication
EXPLORING SERVICES SCIENCE (IESS 2016)
Abstract
This study proposes an optimization model to improve the robustness of an existing bus schedule. Robustness represents the ability of schedules to absorb deviations from the timetable and to prevent their propagation through the daily operations. The model developed proposes an optimal assignment of arrival times and distribution of slacks among Time Control Points of a bus line, in order to minimize delays and anticipations from schedule. This required the use of data collected through GPS devices installed in buses, informing the location of buses during their daily operation. The robustness of bus schedules was evaluated through the quantification of delays and anticipations of real observations of bus shifts by comparison with the timetable. The performance measures used to evaluate robustness are the average delay (or anticipation) of buses by comparison with the timetable, and the probability that a passenger that arrives on time according to the timetable will miss the bus or have to wait more than a specified threshold at a Time Control Point. We also compared the improvement of the schedule proposed by the optimization model with the original schedule. The results obtained in a real-world case study, corresponding to a bus line operating in Porto, showed that the model could return an improved schedule for all performance measures considered when compared with the original schedule.
The access to the final selection minute is only available to applicants.
Please check the confirmation e-mail of your application to obtain the access code.