Cookies
O website necessita de alguns cookies e outros recursos semelhantes para funcionar. Caso o permita, o INESC TEC irá utilizar cookies para recolher dados sobre as suas visitas, contribuindo, assim, para estatísticas agregadas que permitem melhorar o nosso serviço. Ver mais
Aceitar Rejeitar
  • Menu
Publicações

Publicações por Fábio Silva Moreira

2020

The multi-period vehicle routing problem with refueling decisions: Traveling further to decrease fuel cost?

Autores
Neves Moreira, F; Amorim Lopes, M; Amorim, P;

Publicação
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW

Abstract
Most vehicle routing approaches disregard the need to refuel fleets. However, planners search for opportunities to refuel at lower prices even if, counter-intuitively, distant fuel stations need to be visited. We propose a novel mathematical formulation and develop branch-and-cut and matheuristic algorithms to efficiently tackle this problem. Results indicate that, to minimize costs, detour distances may increase up to 6 percentage points when fuel stations with lower prices are farther away from the depot. For practice, these insights imply that current policies disregarding station location and/or fuel prices along with "myopic" planning horizons may lead to sub-optimal decisions.

2014

Annual Distribution Budget in the Beverage Industry: A Case Study

Autores
Guimarães, L; Amorim, P; Sperandio, F; Moreira, F; Lobo, BA;

Publicação
Interfaces

Abstract

2019

A model for the multi-depot online vehicle routing problem with soft deadlines

Autores
Silva, Á; Ferreira, LP; Pereira, MT; Neves Moreira, F;

Publicação
Lecture Notes in Electrical Engineering

Abstract
In many companies in the automotive industry there are challenges in some key processes in their logistic departments, mainly in internal logistics. These challenges happen due to poorly defined rules for the transportation of goods, resulting in a great cost associated with the time lost in the process. Also, the optimization of these processes, incrementing the efficiency of internal logistics can bring competitive advantages to the companies. For that matter, this study was developed at a major tire manufacturing company and proposes a model for the optimization of in-bound logistics, viewed as an online vehicle routing problem with soft deadlines (OVRPSD), using multiple depots. The main goal of this study is the increase of efficiency in logistic, optimizing the number of vehicles to supply the machines in order to reduce the stopping time of machines due to the lack of tires to consume. © 2019, Springer International Publishing AG, part of Springer Nature.

2021

Service operation vessels for offshore wind farm maintenance: Optimal stock levels

Autores
Neves Moreira, F; Veldman, J; Teunter, RH;

Publicação
Renewable and Sustainable Energy Reviews

Abstract
Service operation vessels are becoming the dominant mode for the maintenance of most offshore wind farms. To minimize turbine downtime, it is essential to bring the right components to the wind farm, while budget and volume constraints prohibit having excess inventories on board. This setting can be interpreted as a repair kit problem, which seeks to define a set of components that may be necessary for on-site maintenance operations in a given time period during which emergency resupply is costly. Current repair kit problem approaches however, do not cater sufficiently for some of the characteristics of offshore wind farm maintenance, including weather-dependent deterioration and the possibility to perform emergency resupplies. We propose mixed-integer programming models both to determine (tactical model) and validate (operational model) repair kits when maintenance operations are performed under different weather conditions. The models are flexible enough to be used with real world data considering multiple turbines composed of different deteriorating components, service operation vessels characteristics (speed and volumetric capacity), different weather conditions, and emergency resupplies. An important feature of this approach is its ability to consider detailed maintenance and vessel routing operations to test and validate repair kits in realistic wind farm environments. We provide valuable insights on the composition of repair kits and on relevant business indicators for a set of different scenarios. The practical implications are that repair kits should be adapted depending on weather forecasts and that considerable downtime reductions can be achieved by allowing emergency resupplies. © 2021 The Author(s)

2022

The multi-product inventory-routing problem with pickups and deliveries: Mitigating fluctuating demand via rolling horizon heuristics br

Autores
Neves Moreira, F; Almada Lobo, B; Guimaraes, L; Amorim, P;

Publicação
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW

Abstract
In this paper, we explore the value of considering simultaneous pickups and deliveries inmulti-product inventory-routing problems both with deterministic and uncertain demand. Wepropose a multi-commodity, develop an exact branch-and-cut algorithm with patching heuristicsto efficiently tackle this problem, and provide insightful analyses based on optimal plans. Thesimplicity of the proposed approach is an important aspect, as it facilitates its usage in practice,opposed to complicated stochastic or probabilistic methods. The computational experimentssuggest that in the deterministic demand setting, pickups are mainly used to balance initialinventories, achieving an average total cost reduction of 1.1%, while transshipping 2.4% oftotal demand. Under uncertain demand, pickups are used extensively, achieving cost savings of up to 6.5% in specific settings. Overall, our sensitivity analysis shows that high inventory costsand high degrees of demand uncertainty drive the usage of pickups, which, counter-intuitively, are not desirable in every case

2023

Playing hide and seek: tackling in-store picking operations while improving customer experience

Autores
Moreira, FN; Amorim, P;

Publicação
CoRR

Abstract

  • 2
  • 3