Cookies Policy
We use cookies to improve our site and your experience. By continuing to browse our site you accept our cookie policy. Find out More
Close
  • Menu
About

About

Master of Science and Doctor of Philosophy in Industrial Engineering and Management by FEUP.

Head of the Research Center for Industrial Engineering and Management from INESC TEC Laboratório Associado.

Assistant Professor at the Department of Industrial Engineering and Management at FEUP.

Co Founder of LTPlabs - consultancy company that applies advanced analytical methods to help make better complex decisions.

Specialist in supply chain planning with an emphasis on food products. He was Supply Chain Analyst at Total Raffinage Marketing (França). Researcher/Consultant in several projects related to Operations Management and supported by different types of entities.

Author of several publications in international journals in the field of Operations Research (for example, International Journal of Production Economics, Industrial Engineering and Chemistry Research, Computers and Chemical Engineering, Interfaces) - Google citation profile.

Interest
Topics
Details

Details

008
Publications

2018

A computational study of the general lot-sizing and scheduling model under demand uncertainty via robust and stochastic approaches

Authors
Alem, D; Curcio, E; Amorim, P; Almada Lobo, B;

Publication
COMPUTERS & OPERATIONS RESEARCH

Abstract
This paper presents an empirical assessment of the General Lot-Sizing and Scheduling Problem (GLSP) under demand uncertainty by means of a budget-uncertainty set robust optimization and a two-stage stochastic programming with recourse model. We have also developed a systematic procedure based on Monte Carlo simulation to compare both models in terms of protection against uncertainty and computational tractability. The extensive computational experiments cover different instances characteristics, a considerable number of combinations between budgets of uncertainty and variability levels for the robust optimization model, as well as an increasing number of scenarios and probability distribution functions for the stochastic programming model. Furthermore, we have devised some guidelines for decision-makers to evaluate a priori the most suitable uncertainty modeling approach according to their preferences.

2018

Planning woody biomass supply in hot systems under variable chips energy content

Authors
Marques, A; Rasinmaki, J; Soares, R; Amorim, P;

Publication
Biomass and Bioenergy

Abstract
The growing economic importance of the biomass-for-bioenergy in Europe motivates research on biomass supply chain design and planning. The temporally and geographically fragmented availability of woody biomass makes it particularly relevant to find cost-effective solutions for biomass production, storage and transportation up to the consumption facility. This paper addresses tactical decisions related with optimal allocation of wood chips from forest residues at forest sites to terminals and power plants. The emphasis is on a “hot-system” with synchronized chipping and chips transportation at the roadside. Thus, decisions related with the assignment of chippers to forest sites are also considered. We extend existing studies by considering the impact of the wood chips energy content variation in the logistics planning. This is a key issue in biomass-for-bioenergy supply chains. The higher the moisture content of wood chips, the lower its net caloric value and therefore, a larger amount of chips is needed to meet the contracted demand. We propose a Mixed Integer Programming (MIP) model to solve this problem to optimality. Results of applying the model in a biomass supply chain case in Finland are presented. Results suggest that a 20% improvement in the supplier profit can be obtained with the proposed approach when compared with a baseline situation that relies on empirical estimates for a fixed and known moisture content in the end of an obliged storage age. © 2017

2018

The time window assignment vehicle routing problem with product dependent deliveries

Authors
Neves Moreira, F; da Silva, DP; Guimaraes, L; Amorim, P; Almada Lobo, B;

Publication
Transportation Research Part E: Logistics and Transportation Review

Abstract

2018

Adaptation and approximate strategies for solving the lot-sizing and scheduling problem under multistage demand uncertainty

Authors
Curcio, E; Amorim, P; Zhang, Q; Almada Lobo, B;

Publication
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS

Abstract
This work addresses the lot-sizing and scheduling problem under multistage demand uncertainty. A flexible production system is considered, with the possibility to adjust the size and the schedule of lots in every time period based on a rolling-horizon planning scheme. Computationally intractable multistage stochastic programming models are often employed on this problem. An adaptation strategy to the multistage setting for two-stage programming and robust optimization models is proposed. We also present an approximate heuristic strategy to address the problem more efficiently, relying on multistage stochastic programming and adjustable robust optimization. In order to evaluate each strategy and model proposed, a Monte Carlo simulation experiment under a rolling-horizon scheme is performed. Results show that the strategies are promising in solving large-scale problems: the approximate strategy based on adjustable robust optimization has, on average, 6.72% better performance and is 7.9 times faster than the deterministic model.

2018

Loading constraints for a multi-compartment vehicle routing problem

Authors
Ostermeier, M; Martins, S; Amorim, P; Huebner, A;

Publication
OR Spectrum

Abstract
Multi-compartment vehicles (MCVs) can deliver several product segments jointly. Separate compartments are necessary as each product segment has its own specific characteristics and segments cannot be mixed during transportation. The size and position of the compartments can be adjusted for each tour with the use of flexible compartments. However, this requires that the compartments can be accessed for loading/unloading. The layout of the compartments is defined by the customer and segment sequence, and it needs to be organized in a way that no blocking occurs during loading/unloading processes. Routing and loading layouts are interdependent for MCVs. This paper addresses such loading/unloading issues raised in the distribution planning when using MCVs with flexible compartments, loading from the rear, and standardized transportation units. The problem can therefore be described as a two-dimensional loading and multi-compartment vehicle routing problem (2L-MCVRP). We address the problem of obtaining feasible MCV loading with minimal routing, loading and unloading costs. We define the loading problem that configures the compartment setup. Consequently, we develop a branch-and-cut (B&C) algorithm as an exact approach and extend a large neighborhood search (LNS) as a heuristic approach. In both cases, we use the loading model in order to verify the feasibility of the tours and to assess the problem as a routing and loading problem. The loading model dictates the cuts to be performed in the B&C, and it is used as a repair mechanism in the LNS. Numerical studies show that the heuristic reaches the optimal solution for small instances and can be applied efficiently to larger problems. Additionally, further tests on large instances enable us to derive general rules regarding the influence of loading constraints. Our results were validated in a case study with a European retailer. We identified that loading constraints matter even for small instances. Feasible loading can often be achieved only through minor changes to the routing solution and therefore with limited additional costs. Further, the importance to integrate loading constraints grows as the problem size increases, especially when a heterogeneous mix of segments is ordered. © 2018 Springer-Verlag GmbH Germany, part of Springer Nature

Supervised
thesis

2017

Product Substitution in the Fast-Moving Consumer Goods Sector: Process Mapping and Analysis

Author
Mafalda de Carvalho Monteiro

Institution
UP-FEUP

2017

Evaluating agile scheduling methods for a job shop problem

Author
Ricardo de Sá Caetano Ferreira da Cunha

Institution
UP-FEUP

2017

Cost Reductions on Returns: an eTailer’s Perspective

Author
Tomás Palhinhas Cruz Vieira

Institution
UP-FEUP

2017

Otimização de rotas de distribuição: o efeito do combustível

Author
André Cruz Coelho

Institution
UP-FEUP

2017

Um algoritmo adaptativo para o problema robusto de roteamento com retornos

Author
Vítor Emanuel Marques Mendes

Institution
UP-FEUP