Cookies Policy
The website need some cookies and similar means to function. If you permit us, we will use those means to collect data on your visits for aggregated statistics to improve our service. Find out More
Accept Reject
  • Menu
Publications

Publications by Pedro Amorim

2025

A systematic review of mathematical programming models and solution approaches for the textile supply chain

Authors
Alves, GA; Tavares, R; Amorim, P; Camargo, VCB;

Publication
COMPUTERS & INDUSTRIAL ENGINEERING

Abstract
The textile industry is a complex and dynamic system where structured decision-making processes are essential for efficient supply chain management. In this context, mathematical programming models offer a powerful tool for modeling and optimizing the textile supply chain. This systematic review explores the application of mathematical programming models, including linear programming, nonlinear programming, stochastic programming, robust optimization, fuzzy programming, and multi-objective programming, in optimizing the textile supply chain. The review categorizes and analyzes 163 studies across the textile manufacturing stages, from fiber production to integrated supply chains. Key results reveal the utility of these models in solving a wide range of decision-making problems, such as blending fibers, production planning, scheduling orders, cutting patterns, transportation optimization, network design, and supplier selection, considering the challenges found in the textile sector. Analyzing those models, we point out that sustainability considerations, such as environmental and social aspects, remain underexplored and present significant opportunities for future research. In addition, this study emphasizes the importance of incorporating multi-objective approaches and addressing uncertainties in decision-making to advance sustainable and efficient textile supply chain management.

2025

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

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

Publication
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

Symbolic Pricing Policies for Attended Home Delivery - the Case of an Online Retailer

Authors
Lunet, M; Fernandes, D; Moreira, FN; Amorim, P;

Publication
Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2025, NH Malaga Hotel, Malaga, Spain, July 14-18, 2025

Abstract

2025

Enhancing Flexibility in Forest Biomass Procurement: A Matheuristic Approach for Resilient Bioenergy Supply Chains Under Resource Variability

Authors
Gomes, R; Marques, A; Neves-Moreira, F; Netto, CA; Silva, RG; Amorim, P;

Publication
Processes

Abstract
The sustainable utilization of forest biomass for bioenergy production is increasingly challenged by the variability and unpredictability of raw material availability. These challenges are particularly critical in regions like Central Portugal, where seasonality, dispersed resources, and wildfire prevention policies disrupt procurement planning. This study investigates two flexibility strategies—dynamic network reconfiguration and operations postponement—as policy relevant tools to enhance resilience in forest-to-bioenergy supply chains. A novel mathematical model, the mobile Facility Location Problem with dynamic Operations Assignment (mFLP-dOA), is proposed and solved using a scalable matheuristic approach. Applying the model to a real case study, we demonstrate that incorporating temporary intermediate nodes and adaptable processing schedules can reduce costs by up to 17% while improving operational responsiveness and reducing non-productive machine time. The findings offer strategic insights for policymakers, biomass operators, and regional planners aiming to design more adaptive and cost-effective biomass supply systems, particularly under environmental risk scenarios such as summer operation bans. This work supports evidence-based planning and investment in flexible logistics infrastructure for cleaner and more resilient bioenergy supply chains.

  • 16
  • 16