Searcharxiv⌕ Search

arXiv subjects

Prasanna Ramamoorthy

Publications and source records attributed to Prasanna Ramamoorthy.

4 recordsLinked to original sources

On branch and cut approach for q-Allocation Hub Interdiction Problem

Many industries widely adopted hub networks these days. Managing logistics, transportation, and distribution requires a delicate balance to ensure seamless operations within this network. Hub network promotes cost-effective routing through inter-hub flows. Failure of such hubs may impact the total network with huge costs. In this paper, we study bilevel $q$-allocation hub interdiction problem. In previous literature hub interdiction problem was studied with single and multiple allocation protocols.This problem focus on $q$ allocation which solves single and multiple allocation problem as special case. We also show improvements on the branch and cut approach by using cutting planes.Our experiments based on large instances present the efficiency of the approach to solve some previously unsolved instances.

math.OC↗

Train timetabling with rolling stock assignment, short-turning and skip-stop strategy for a bidirectional metro line

Metro train operations is becoming more challenging due to overcrowding and unpredictable irregular passenger demand. To avoid passenger dissatisfaction, metro operators employ various operational strategies to increase the number of train services using limited number of trains. This paper integrates metro timetabling with several operational strategies to improve passenger services with limited number of trains. We propose three optimization models for timetable planning during both peak and off-peak hours: The first model aims to minimize operational costs, the second aims to minimize passenger waiting time, and the third is a multi-objective optimization model that considers both objectives simultaneously. These models integrate operational strategies such as rolling-stock assignment, short-turning, and skip-stop strategies to increase the number of services with limited trains on a bidirectional metro line. The paper also provides detailed calculations for train services, running times, and station dwell times. The proposed models are then implemented on a simplified Santiago metro line 1.

math.OC↗

A decision support framework for optimal vaccine distribution across a multi-tier cold chain network

In this paper, we present a decision support framework for optimizing multiple aspects of vaccine distribution across a multitier cold chain network. We propose two multi-period optimization formulations within this framework: first to minimize inventory, ordering, transportation, personnel and shortage costs associated with a single vaccine; the second being an extension of the first for the case when multiple vaccines with differing efficacies and costs are available for the same disease. Vaccine transportation and administration lead times are also incorporated within the models. We also develop robust optimization versions of the single vaccine model to account for the impact of uncertainty in model parameters on the optimal vaccine distribution solution. We use the case of the Indian state of Bihar and COVID-19 vaccines to illustrate the implementation of the framework. We present computational experiments to demonstrate: (a) the organization of the model outputs; (b) how the models can be used to assess the impact of cold chain point storage capacities, transportation vehicle capacities, and manufacturer capacities on the optimal vaccine distribution pattern; and (c) the impact of vaccine efficacies and associated costs such as ordering and transportation costs on the vaccine selection decision informed by the model. We then consider the computational expense of the framework for realistic problem instances, and suggest multiple preprocessing techniques to reduce their computational burden. Finally, we also demonstrate how the robust versions of the single vaccine model outperform the deterministic version under multiple levels of uncertainty in key model parameters. Our study presents public health authorities and other stakeholders with a vaccine distribution and capacity planning tool for multi-tier cold chain networks.

physics.soc-ph↗

Optimal minimal-contact routing of randomly arriving agents through connected networks

Collision-free or contact-free routing through connected networks has been actively studied in the industrial automation and manufacturing context. Contact-free routing of personnel through connected networks (e.g., factories, retail warehouses) may also be required in the COVID-19 context. In this context, we present an optimization framework for identifying routes through a connected network that eliminate or minimize contacts between randomly arriving agents needing to visit a subset of nodes in the network in minimal time. We simulate the agent arrival and network traversal process, and introduce stochasticity in travel speeds, node dwell times, and compliance with assigned routes. We present two optimization formulations for generating optimal routes - no-contact and minimal-contact - on a real-time basis for each agent arriving to the network given the route information of other agents already in the network. We generate results for the time-average number of contacts and normalized time spent in the network.

math.OC↗