Abstract
Introduction: Urban centers face increasing congestion and pollution due to population growth driven by jobs, education, and entertainment. Promoting active modes like walking and cycling offers healthier and less polluting alternatives. Understanding perceptions of comfort (green areas, commercial areas, crowd density, noise, thermal sensation, air quality, allergenics), safety and security (street illumination, traffic volume, surveillance, visual appearance, and speed limits) are crucial for encouraging active modes adoption. This study categorizes user groups based on these indicators, supporting policymakers in the development of targeted strategies. Methods: We developed a questionnaire to support our empirical study and collected 653 responses. We have analyzed the data using clustering methods such as Affinity Propagation, BIRCH, Bisecting K-means, HAC, K-means, Mini-Batch K-means, and Spectral clustering. The best performing method (K-means) was used to identify the user groups while a random forest model evaluated the relative importance of indicators for each group. Results: The study identified five user groups based on urban mobility indicators for safety and security, comfort, and distance and time. Conclusions: These groups, distinguished by sociodemographic features, include: Street Aesthetes (young men valuing visual appeal), Safety Seekers (employed men prioritizing speed limits), Working Guardians (employed men focused on surveillance and green spaces), Urban Explorers (young women valuing air quality and low traffic), and Comfort Connoisseurs (employed women prioritizing noise reduction and aesthetics).

Abstract
The main goal of this paper was to develop, implement, and test a practical framework for large-scale last-mile delivery problems that employ a combination of optimisation and machine learning while focussing on different routing methods. Delivery companies in big cities choose delivery orders based on the tacit knowledge of experienced drivers, since solving a large optimisation model with several variables is not a practical solution to meet their daily needs. This framework includes three phases of districting, sequencing, and routing, and in total 30 different variants were tested in different capacities. Using the power of machine learning, a model is trained and tuned to predict driving road distances, allowing the implementation of the whole framework and improving performance from analysing 2983 stops in several hours to 58,192 stops in less than 15 minutes. The results demonstrated that Inter 1 - Centroids is the best inter-district connection method, and one of the best variants in this framework is variant 26 which managed to decrease up to 34,77% total distances with 79 fewer drivers in a full month analysis compared to the original routes of the delivery company. © The Author(s), under exclusive licence to Springer Nature Singapore Pte Ltd. 2025.

Abstract
At the practical level, the static stability constraint is one of the most important constraints in practical pallet loading problems, such as air cargo palletizing. Approaches to modeling static stability, which range from base support and mechanical equilibrium calculations to physical simulation, differ in workflow, focus, and assumptions, so choosing the right static stability approach has a substantial impact on the quality of the solution and, ultimately, on loading security. To date, little research has investigated the structural differences between approaches. The aim of this paper is to integrate knowledge and shed light on the applicability of the different approaches for the practical scenario of air cargo palletizing. We tackle this problem through (1) a reformulation and extension of static stability toward loading stability, (2) a conceptual analysis of current approaches, and (3) benchmarking that employs an independent multibody simulation on multiple heterogeneous datasets. Our results show that all approaches are prone to structure errors and vary significantly in their premises and information usage. Further, full base support is revealed to be the most restrictive approach by far, while physical simulation achieves the greatest accuracy. Given the trade-off between accuracy and runtime, the mechanical equilibrium approach is a good choice, while partial base support performs best for lower support values.

Abstract
Port wine stocks ameliorate during storage, facilitating product differentiation according to age. This induces a trade-off between immediate revenues and further maturation. Varying climate conditions in the limited supply region lead to stochastic purchase prices for wine grapes. Decision makers must integrate recurring purchasing, production, and issuance decisions. Because stocks from different age classes can be blended to create final products, the solution space increases exponentially in the number of age classes. We model the problem of managing port wine inventory as a Markov decision process, considering decay as an additional source of uncertainty. For small problems, we derive general management strategies from the long-run behavior of the optimal policy. Our solution approach for otherwise intractable large problems, therefore, first aggregates age classes to create a tractable problem representation. We then use machine learning to train tree-based decision rules that reproduce the optimal aggregated policy and the enclosed management strategies. The derived rules are scaled back to solve the original problem. Learning from the aggregated optimum outperforms benchmark rules by 21.4% in annual profits (while leaving a 2.8%-gap to an upper bound). For an industry case, we obtain a 17.4%-improvement over current practices. Our research provides distinct strategies for how producers can mitigate climate risks. The purchasing policy dynamically adapts to climate-dependent price fluctuations. Uncertainties are met with lower production of younger products, whereas strategic surpluses of older stocks ensure high production of older products. Moreover, a wide spread in the age classes used for blending reduces decay risk exposure.

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.

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.