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
Sobre

Sobre

-

Tópicos
de interesse
Detalhes

Detalhes

  • Nome

    Ricardo Ferreira Soares
  • Cargo

    Investigador Auxiliar
  • Desde

    23 novembro 2016
005
Publicações

2025

The Robust Vehicle Routing Problem With Synchronization: Models and Branch-And-Cut Algorithms

Autores
Soares, R; Parragh, N; Marques, A; Amorim, P;

Publicação
Networks

Abstract
The Vehicle Routing Problem with Synchronization (VRPSync) aims to minimise the total routing costs while considering synchronization requirements that must be fulfilled between tasks of different routes. These synchronization requirements are especially relevant when it is necessary to have tasks being performed by vehicles within given temporal offsets, a frequent requirement in applications where multiple vehicles, crews, materials, or other resources are involved in certain operations. Although several works in the literature have addressed this problem, mainly the deterministic version has been tackled so far. This paper presents a robust optimization approach for the VRPSync, taking into consideration the uncertainty in vehicle travel times between customers. This work builds on existing approaches in the literature to develop mathematical models for the Robust VRPSync, as well as a branch-and-cut algorithm to solve more difficult problem instances. A set of computational experiments is also devised and presented to obtain insights regarding key performance parameters of the mathematical models and the solution algorithm. The results suggest that solution strategies where certain standard problem constraints are only introduced if a candidate solution violates any of those constraints provide more consistent improvements than approaches that rely on tailor-made cutting planes, added through separation routines. Furthermore, the analysis of the Price of Robustness indicators shows that the adoption of robust solutions can have a significant increase in the total costs, however, this increase quickly plateaus as budgets of uncertainty increase. © 2025 Wiley Periodicals LLC.

2024

Synchronisation in vehicle routing: Classification schema, modelling framework and literature review

Autores
Soares, R; Marques, A; Amorim, P; Parragh, SN;

Publicação
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH

Abstract
The practical relevance and challenging nature of the Vehicle Routing Problem (VRP) have motivated the Operations Research community to consider different practical requirements and problem variants throughout the years. However, businesses still face increasingly specific and complex transportation re-quirements that need to be tackled, one of them being synchronisation. No literature contextualises syn-chronisation among other types of problem aspects of the VRP, increasing ambiguity in the nomenclature used by the community. The contributions of this paper originate from a literature review and are three-fold. First, new conceptual and classification schemas are proposed to analyse literature and re-organise different interdependencies that arise in routing decisions. Secondly, a modelling framework is presented based on the proposed schemas. Finally, an extensive literature review identifies future research gaps and opportunities in the field of VRPs with synchronisation.(c) 2023 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY license ( http://creativecommons.org/licenses/by/4.0/ )

2022

New models and methods for the Vehicle Routing Problem with Multiple Synchronisation Constraints

Autores
Ricardo Filipe Ferreira Soares;

Publicação

Abstract

2020

Exploring the Linkages Between the Internet of Things and Planning and Control Systems in Industrial Applications

Autores
Soares, R; Marques, A; Gomes, R; Guardão, L; Hernández, E; Rebelo, R;

Publicação
Lecture Notes in Mechanical Engineering

Abstract
The potential of the Internet of Things (IoT) and other technologies in the realm of Industry 4.0 to generate valuable data for monitoring the performance of the production processes and the whole supply chain is well established. However, these large volumes of data can be used within planning and control systems (PCSs) to enhance real-time planning and decision-making. This paper conducts a literature review to envisage an overall system architecture that combines IoT and PCS for planning, monitoring and control of operations at the level of an industrial production process or at the level of its supply chain. Despite the extensive literature on IoT implementations, few studies explain the interactions between IoT and the components of PCS. It is expected that, with the increasing digitization of business processes, approaches with PCS and IoT become ubiquitous in the near future. © 2020, Springer Nature Switzerland AG.

2020

Integrated planning of inbound and outbound logistics with a Rich Vehicle Routing Problem with backhauls

Autores
Marques, A; Soares, R; Santos, MJ; Amorim, P;

Publicação
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE

Abstract
This paper addresses the integration of the planning decisions concerning inbound logistics in an industrial setting (from the suppliers to the mill) and outbound logistics (from the mill to customers). The goal is to find the minimum cost routing plan, which includes the cost-effective outbound and inbound daily routes (OIRs), consisting of a sequence of deliveries of customer orders, pickup of a full truck-load at a supplier, and its delivery to the mill. This study distinguishes between three planning strategies: opportunistic backhauling planning (OBP), integrated inbound and outbound planning (IIOP) and decoupled planning (DIOP), the latter being the commonly used, particularly in the case of the wood-based panel industry under study. From the point of view of process integration, OBP can be considered as an intermediate stage from DIOP to IIOP. The problem is modelled as a Vehicle Routing Problem with Backhauls, enriched with case-specific rules for visiting the backhaul, split deliveries to customers and the use of a heterogeneous fleet. A new fix-and-optimise matheuristic is proposed for this problem, seeking to obtain good quality solutions within a reasonable computational time. The results from its application to the wood-based panel industry in Portugal show that IIOP can help to reduce total costs in about 2.7%, when compared with DIOP, due to better use of the delivery truck and a reduction of the number of dedicated inbound routes. Regarding OBP, fostering the use of OIRs does not necessarily lead to better routing plans than DIOP, as it depends upon a favourable geographical configuration of the set of customers to be visited in a day, specifically, the relative distance between a linehaul that can be visited last in a route, a neighboring backhaul, and a mill. The paper further provides valuable managerial insights on how the routing plan is impacted by the values of business-related model parameters which are set by the planner with some degree of uncertainty. Results suggest that increasing the maximum length of the route will likely have the largest impact in reducing transportation costs. Moreover, increasing the value of a reward paid for visiting a backhaul can foster the percentage of OIR in the optimal routing plan.