# Shiva Prakash GuptaTribhuvan University · Central Department of Mathematics

Shiva Prakash Gupta

Ph.D. Research Scholar [OPTIMIZATION] Tribhuvan University Nepal

## About

12

Publications

819

Reads

**How we measure 'reads'**

A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more

43

Citations

Citations since 2017

Introduction

Shiva Prakash Gupta currently works as a Ph.D. student at the Central Department of Mathematics, Tribhuvan University in Optimization under the supervision of Prof. Dr. Tanka Nath Dhamala. Their most recent publication is 'Generalized Dynamic Contraflow with Non-Symmetric Transit Times'.

**Skills and Expertise**

Additional affiliations

September 2004 - present

**Trichandra College**

Position

- Professor (Assistant)

Education

March 2014 - March 2016

## Publications

Publications (12)

During the transmission of several different commodities from respective sources to the sinks, there may be loss due to leakage, evaporation, or damage. The generalized multi-commodity flow problem on a lossy network deals with the transshipment of these commodities from the origin nodes to the destination nodes − not violating the capacity constra...

One of the challenges in operations research is to route numerous commodities from particular supply locations to the corresponding demand points across the lanes of a network infrastructure while maintaining capacity restrictions. The quickest multi-commodity flow problem would be one of those that reduces the time it takes to complete the process...

A maximum dynamic multicommodity flow problem concerns with the transportation of several different commodities through the specific source-sink path of an underlying capacity network with the objective of maximizing the sum of commodity flows within a given time horizon. Motivated by the uneven road condition of transportation network topology, we...

The contraflow technique has been extensively used to evacuate people in disasters situation. By flipping the orientation of necessary road segments, the flow value increases, and the evacuation time decreases significantly. Contraflow problems with asymmetric capacity and symmetric transit time on arcs have polynomial-time solutions. But in uneven...

In a transportation network such as an evacuation planning, if we transmit the people or goods from the dangerous zones to the safety places, there are chances of loss due to death, leakage or damage. To address this issue, the generalized network flow model incorporates a gain factor on each arc, which makes it different from the classical network...

Multi-commodity flow problem appears when several distinct commodities are shipped from supply nodes to the demand nodes through a network without violating the capacity constraints. The quickest multi-commodity flow problem deals with the minimization of time satisfying given demand. Ingeneral, the quickest multi-commodity flow problems are comput...

The multicommodity flow problem arises when several different commodities are transshipped from specific supply nodes to the corresponding demand nodes through the arcs of an underlying capacity network. The maximum flow over time problem concerns to maximize the sum of commodity flows in a given time horizon. It becomes the earliest arrival flow p...

Routing of more than one different commodity from specific origin nodes to the corresponding destination nodes through the arcs of an underlying network respecting the capacity constraints is one of the main problems in operational research. Among them, the quickest multi-commodity flow problem concerns with minimization of time taken to complete t...

People have unpleasant experience of driving through congested road network of urban areas, where transit time is not constant but flow-dependent. Network flow over time with flow-dependent transit times is more realistic than flow over time with fixed transit time on arcs which is an active area of research from last two decades. In traffic assign...

Dissimilar to conventional static flow problem, this research studies network flows in relation to time. Any one caught up in a traffic jam would know that the existing premise of flow overtime with constant transit times on the arcs cannot access the real life road traffic. Challenges with flows overtime and constant transit times can be rephrased...

p>The earliest arrival flow problem sends a maximum number of evacuees as early as possible during the evacuation of people and/or property from dangerous zone to the safe zone. The contraflow approach significantly increases the capacity to send the evacuees at one hand and reduces the time the evacuation takes on the other hand. The problem has b...