Abstract
This paper presents a C++ application programming interface for a co-evolutionary algorithm for solution and scenario generation in stochastic problems. Based on a two-space biased random-key genetic algorithm, it involves two types of populations that are mutually impacted by the fitness calculations. In the solution population, high-quality solutions evolve, representing first-stage decisions evaluated by their performance in the face of the scenario population. The scenario population ultimately generates a diverse set of scenarios regarding their impact on the solutions. This application allows the straightforward implementation of this algorithm, where the user needs only to define the problem-dependent decoding procedure and may adjust the risk profile of the decision-maker. This paper presents the co-evolutionary algorithm and structures the interface. We also present some experiments that validate the impact of relevant features of the application.

Abstract
First-mile logistics tackles the movement of products from retailers to a warehouse or distri-bution centre. This first step towards the end customer has been pushed by large e-commerce platforms forming extensive networks of partners and is critical for fast deliveries. First-mile pickup requires efficient methods different from those developed for last-mile delivery, among other reasons due to the complexity of cargo features and volume - increasing the relevance of advanced packing methods. More importantly, the problem is essentially dynamic and the pickup process, in which the vehicle is initially empty, is much more flexible to react to disruptions arising when the vehicles are en route. We model the static first-mile pickup problem as a vehicle routing problem for a hetero-geneous fleet, with time windows and three-dimensional packing constraints. Moreover, we propose an approach to tackle the dynamic problem, in which the routes can be modified to accommodate disruptions - new customers' demands and modified requests of known customers that are arriving while the initially established routes are being covered. We propose three reactive strategies for addressing the disruptions depending on the number of vehicles available, and study their results on a newly generated benchmark for dynamic problems. The results allow quantifying the impact of disruptions depending on the strategy used and can help the logistics companies to define their own strategy, considering the characteristics of their customers and products and the available fleet.

Abstract
In cutting processes, one of the strategies to reduce raw material waste is to generate leftovers that are large enough to return to stock for future use. The length of these leftovers is important since waste is expected to be minimal when cutting these objects in the future. However, in several situations, future demand is unknown and evaluating the best length for the leftovers is challenging. Furthermore, it may not be economically feasible to manage a stock of leftovers with multiple lengths that may not result in minimal waste when cut. In this paper, we approached the cutting stock problem with the possibility of generating leftovers as a two-stage stochastic program with recourse. We approximated the demand levels for the different items by employing a finite set of scenarios. Also, we modeled different decisions made before and after uncertainties were revealed. We proposed a mathematical model to represent this problem and developed a column generation approach to solve it. We ran computational experi-ments with randomly generated instances, considering a representative set of scenarios with a varying probability distribution. The results validated the efficiency of the proposed approach and allowed us to derive insights on the value of modeling and tackling uncertainty in this problem. Overall, the results showed that the cutting stock problem with usable leftovers benefits from a modeling approach based on sequential decision-making points and from explicitly considering uncertainty in the model and the solution method. (c) 2022 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license ( http://creativecommons.org/licenses/by-nc-nd/4.0/ )

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.

Abstract
Balancing supply and demand in free-floating one-way carsharing systems is a critical operational challenge. This paper presents a novel approach that integrates a binary logit model into a mixed integer linear programming framework to optimize short-term pricing and fleet relocation. Demand modeling, based on a binary logit model, aggregates different trips under a unified utility model and improves estimation by incorporating information from similar trips. To speed up the estimation process, a categorizing approach is used, where variables such as location and time are classified into a few categories based on shared attributes. This is particularly beneficial for trips with limited observations as information gained from similar trips can be used for these trips effectively. The modeling framework adopts a dynamic structure where the binary logit model estimates demand using accumulated observations from past iterations at each decision point. This continuous learning environment allows for dynamic improvement in estimation and decision-making. At the core of the framework is a mathematical program that prescribes optimal levels of promotion and relocation. The framework then includes simulated market responses to the decisions, allowing for real-time adjustments to effectively balance supply and demand. Computational experiments demonstrate the effectiveness of the proposed approach and highlight its potential for real-world applications. The continuous learning environment, combining demand modeling and operational decisions, opens avenues for future research in transportation systems.

Abstract
Car rental and car sharing are two established mobility concepts which traditionally have been offered by specialized providers. Presumably to increase utilization and profitability, most recently, car rental providers began to offer car sharing in addition, and vice versa. To assess and quantify benefits and drawbacks of combining both into a single mobility concept with one common fleet, we consider such combined systems on an aggregate level, replicating demand patterns and rentals throughout a typical week. Our systematic approach reflects that, depending on a provider's status quo, different business practices exist, for example with regard to the applied revenue management approaches. Methodologically, our analyses base on mathematical optimization. We propose several models that consider the different business practices and degrees to which the respective new mobility concept is offered. To support mobility providers in their strategic decision-making, we derive managerial insights based on numerical studies that use real-life data.