SearcharxivSearch

arXiv subjects

Zoha Sherkat-Masoumi

Publications and source records attributed to Zoha Sherkat-Masoumi.

2 recordsLinked to original sources

Fairness-aware Strategic Design of Station-based Electric Car-Sharing Systems

Electric car-sharing systems are pivotal for sustainable urban mobility, but their strategic design is complicated by operational constraints, particularly those arising from the charging needs of electric vehicles. The success of these systems hinges on integrating long-term investment decisions (such as station locations, charger capacities, and fleet size) with daily operational realities, including vehicle routing to serve user trip requests and battery management. While existing integrated models address this strategic-operational link, they have prioritized economic efficiency, overlooking the critical dimension of service equity. This paper addresses this gap by making fairness a central design principle, operationalized through two distinct paradigms, namely, service-rate disparity and max-min fairness, measured explicitly via realized group service rates rather than static spatial accessibility. To capture demand heterogeneity, we adopt a multi-day representative-demand setting, and develop a bi-objective trajectory-based formulation that jointly optimizes revenue and service equity. We develop a solution framework in which a branch-and-price algorithm solves the single-objective variants of the models, embedded within an exact bi-objective procedure to generate the Pareto frontier and complemented by a diving-heuristic-based approach for obtaining high-quality frontier approximations for larger instances. Through extensive computational experiments, including a Vienna-based real-data case study, we provide key managerial insights into the fundamental trade-offs between revenue, equity, and system design, demonstrating that the proposed framework can serve as a useful decision-support tool for designing station-based electric car-sharing systems that are both economically viable and socially inclusive.

math.OC

A Deep Reinforcement Learning Framework For Column Generation

Column Generation (CG) is an iterative algorithm for solving linear programs (LPs) with an extremely large number of variables (columns). CG is the workhorse for tackling large-scale \textit{integer} linear programs, which rely on CG to solve LP relaxations within a branch and price algorithm. Two canonical applications are the Cutting Stock Problem (CSP) and Vehicle Routing Problem with Time Windows (VRPTW). In VRPTW, for example, each binary variable represents the decision to include or exclude a \textit{route}, of which there are exponentially many; CG incrementally grows the subset of columns being used, ultimately converging to an optimal solution. We propose RLCG, the first Reinforcement Learning (RL) approach for CG. Unlike typical column selection rules which myopically select a column based on local information at each iteration, we treat CG as a sequential decision-making problem: the column selected in a given iteration affects subsequent column selections. This perspective lends itself to a Deep Reinforcement Learning approach that uses Graph Neural Networks (GNNs) to represent the variable-constraint structure in the LP of interest. We perform an extensive set of experiments using the publicly available BPPLIB benchmark for CSP and Solomon benchmark for VRPTW. RLCG converges faster and reduces the number of CG iterations by 22.4\% for CSP and 40.9\% for VRPTW on average compared to a commonly used greedy policy. Our code is available at https://github.com/chichengmessi/reinforcement-learning-for-column-generation.git.

math.OC