2026
Autores
Currie, CSM; M'Hallah, R; Oliveira, BB;
Publicação
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Abstract
Car sharing, car clubs and short-term rentals could support the transition toward net zero but their success depends on them being financially sustainable for service providers and attractive to end users. Dynamic pricing could support this by incentivizing users while balancing supply and demand. We describe the usage of a round trip car sharing fleet by a continuous time Markov chain model, which reduces to a multi-server queuing model where hire duration is assumed independent of the hourly rental price. We present analytical and simulation optimization models that allow the development of dynamic pricing strategies for round trip car sharing systems; in particular identifying the optimal hourly rental price. The analytical tractability of the queuing model enables fast optimization to maximize expected hourly revenue for either a single fare system or a system where the fare depends on the number of cars on hire, while accounting for stochasticity in customer arrival times and durations of hire. Simulation optimization is used to optimize prices where the fare depends on the time of day or hire duration depends on price. We present optimal prices for a given customer population and show how the expected revenue and car availability depend on the customer arrival rate, willingness-to-pay distribution, dependence of the hire duration on price, and size of the customer population. The results provide optimal strategies for pricing of car sharing and inform strategic managerial decisions such as whether to use time-or state-dependent pricing and optimizing the fleet size.
2026
Autores
Silva, AC; Santos, R; Senna, PP; Borges, FM; Marques, CM;
Publicação
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
Abstract
Effective warehouse management plays a pivotal role in optimizing supply chain performance, particularly in high-demand, time-sensitive environments. This study introduces a simulation-based decision support system designed to improve the management of Picking-By-Line (PBL) operations in cross-docking distribution centres. Developed in FlexSim and calibrated with empirical data from an industrial case study, the model replicates real-world warehouse conditions and is validated against observed operational performance. The tool supports warehouse managers in evaluating and comparing operational strategies, such as dynamic storage allocation policies and picker routing constraints, with the goal of reducing operator travel distances, mitigating congestion, and enhancing overall efficiency. A key contribution of this work is the integration of congestion-sensitive performance indicators that allow for a detailed analysis of the trade-offs between travel efficiency and localized congestion-an aspect often overlooked in traditional optimization methods. This study demonstrates the value of simulation as a scalable and realistic decision-support tool for optimizing PBL operations in complex and variable environments where human movement is a major cost and performance driver. The proposed tool bridges the gap between theoretical modelling and practical implementation, offering actionable insights for warehouse layout, space utilization, and resource allocation.
2026
Autores
Alexandre Jesus; Arthur Corrêa; Miguel Vieira; Catarina Marques; Cristóvão Silva; Samuel Moniz;
Publicação
Computers & Operations Research
Abstract
2026
Autores
Santos, MJ; Jorge, D; Bonomi, V; Ramos, T; Póvoa, A;
Publicação
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH
Abstract
Today, logistics activities are driven by the pressing need to simultaneously increase efficiency, reduce costs, and promote sustainability. In our research, we tackle this challenge by adapting a general vehicle routing problem with deliveries and pickups to accommodate different types of customers. Customers requiring both delivery and pickup services are mandatory, while those needing only a pickup service (backhaul customers) are optional and are only visited if profitable. A mixed-integer linear programming model is formulated to minimize fuel consumption. This model can address various scenarios, such as allowing mandatory customers to be served with combined or separate delivery or pickup visits, and visiting optional customers either during or only after mandatory customer visits. An adaptive large neighborhood search is developed to solve instances adapted from the literature as well as to solve a real-case study of a beverage distributor. The results show the effectiveness of our approach, demonstrating the potential to utilize the available capacity on vehicles returning to the depot to create profitable and environmentally friendly routes, and so enhancing efficient, cost-effective, and sustainable logistics activities.
2026
Autores
Duraes, MJ; Barbosa, F; D'Inverno, G; Camanho, AS;
Publicação
SOCIO-ECONOMIC PLANNING SCIENCES
Abstract
This paper focuses on the comprehensive assessment of regional performance in attaining the 2030 Strategic Framework for Education and Training (ET2030) established by the European Union. To this end, we propose a composite indicator framework based on robust Benefit-of-the-doubt models empirically validated through an extensive analysis of data spanning 32 countries and 101 NUTS-I level regions for 2019. We integrate contextual variables into a robust conditional model to ensure an equitable evaluation among regions grappling with distinct circumstances. Specifically, the unemployment rate and the percentage of the population holding national citizenship are considered. Moreover, the research identifies best practices from high-performing regions that can serve as benchmarks for underperforming areas. Analyzing regional-level data is crucial for understanding disparities between European regions and within countries.
2026
Autores
Gomes, R; Ribeiro, JP; Silva, RG; Soares, R;
Publicação
Sustainability
Abstract
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.