Searcharxiv⌕ Search

arXiv subjects

Rahimeh Neamatian Monemi

Publications and source records attributed to Rahimeh Neamatian Monemi.

5 recordsLinked to original sources

GenOR-Twin: A Semantic Middleware for Integrating Operational Discourse with Mathematical Optimization

We introduce GenOR-Twin, a neuro-symbolic framework that bridges the translation gap between unstructured operational logs and rigorous mathematical optimization. Our architecture uniquely positions Large Language Models as semantic translators rather than direct solvers, ensuring that the system retains the feasibility guarantees of exact combinatorial methods. { \color{red}We design a dynamic constraint injection mechanism (the runtime translation of qualitative disruption events into formal mathematical constraints) that allows the system to structurally modify the optimization problem's feasibility region in real-time based on qualitative human inputs. The resulting bidirectional coupling---where operational observations update the virtual model state and optimized decisions are reflected back into the Knowledge Graph---satisfies the synchronization requirement of a proper Digital Twin. The framework features an adaptive decision policy} that automatically selects between low-complexity schedule repair and full re-optimization by analyzing the available system slack. Finally, we demonstrate the generalization of this approach across six distinct optimization domains, {\color{red}turning static models into resilient systems that adapt to the operational uncertainty and variability of real-world environments.}

cs.LG↗

Cognitive Warfare, Hybrid Pressure, and Sovereign Resilience: An Operations Research Framework Applied to the Iranian Case (2017--2026)

A defending state facing sustained economic, media, and psychological pressure from an adversary that continuously re-optimises its campaign poses a problem that existing attacker-defender models in operations research do not directly resolve, because they treat the defender's state as a discrete allocation rather than a continuous, slow-moving institutional process. We formulate a coupled dynamical system in which grievance and institutional resilience evolve continuously while pressure intensity is chosen by an optimising Markov decision process, prove existence and local stability of the resulting equilibrium, and prove a formal result distinguishing it from standard feedback-stability analysis and from a stationary Markov chain treated in isolation. We validate the framework computationally using thirty randomised network instances, full value iteration, and a documented case study of cognitive warfare directed at Iran (2017--2026). The historically calibrated case sits approximately twenty-five times above the computed operational collapse boundary, and a greedy seeding policy reaches eighty-seven percent average network penetration across the randomised instances, significantly above a degree-centrality baseline. A practitioner can use the equilibrium and boundary computation to assess where a specific case sits relative to collapse, rather than relying on an unverified comparison between opposing pressure intensities.

math.OC↗

A note on "A multi-compartment VRP model for the health care waste transportation problem"

A mathematical model and a genetic algorithm, referred to as an adaptive one, have been proposed in the paper by Nasreddine Ouertani, Hajer Ben-Romdhane, Issam Nouaouri, Hamid Allaoui, and Saoussen Krichen, titled "A multi-compartment VRP model for the healthcare waste transportation problem," published in the Journal of ComputationalScience in 2023 (72), pages 102-104. This model addresses the problem of waste disposal and the transportation of waste from healthcare facilities to treatment centers. In this note, we demonstrate that the model contains several minor and major flaws in its structure, making it, in short, incorrect. Therefore, we conclude that it cannot serve as a reliable benchmark for evaluating the proposed heuristic. We recommend amending the model to rectify some of these flaws.

math.OC↗

A Neural Benders Decomposition for the Hub Location Routing Problem

In this study, we propose an imitation learning framework designed to enhance the Benders decomposition method. Our primary focus is addressing degeneracy in subproblems with multiple dual optima, among which Magnanti-Wong technique identifies the non-dominant solution. We develop two policies. In the first policy, we replicate the Magnanti-Wong method and learn from each iteration. In the second policy, our objective is to determine a trajectory that expedites the attainment of the final subproblem dual solution. We train and assess these two policies through extensive computational experiments on a network design problem with flow subproblem, confirming that the presence of such learned policies significantly enhances the efficiency of the decomposition process.

math.OC↗

Truck pooling and scheduling in post-distribution cross-docking with JIT demands and synchronized interchangeability

Various operational optimization problems arise in cross-dock synchronization. The combination of the truck scheduling with other decision problems in cross-docking has been targeted by researchers in the recent years. In most of the truck scheduling researches, the load and the destination of the outbound trucks are predetermined. This paper presents a novel cross-docking optimization problem in which the truck scheduling is combined by two assignment problems: the assignment of received loads and the assignment of destinations to outbound trucks (product-truck-destination allocation). Moreover, a Just-In-Time (JIT) strategy is imposed on the destination demands, whereas in most of the previous researches the time windows are imposed to the trucks rather than the demands. An integrated mathematical model is presented for this cross-docking problem. The mathematical model is reinforced by two categories of symmetry breaking constraints. A matheuristic approach, including two mixed-integer mathematical models, is proposed. An adaptive heuristic is presented to solve the first step of the matheuristic algorithm instead of the mathematical model. The solution approaches are analyzed by the extensive computational experiments. The numerical results show the efficiency of the hybrid matheuristic to solve the real size instances of the studied problem.

math.OC↗