On the quickest path problem

Chen, Gen-Huey; Hung, Yung-Chen

doi:10.1016/0020-0190(93)90057-g

Cited by 110 publications

(68 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The problem is called the quickest transshipment problem that minimizes the clearance time. The problem with a single disaster node and a single safety node case is called the quickest flow problem [5]. The quickest flow problem has been solved by polynomial and strongly polynomial solution procedures based on parametric search.…”

Section: Optimization Approachmentioning

confidence: 99%

Optimal Traffic Planning for Efficient Evacuation

Khadka

2016

J. Adv. Coll. Engin. Mgt.

View full text Add to dashboard Cite

Efficient traffic planning during evacuation in emergency has been important issue. The planning based on research significantly improves the quality of the emergency management. In this paper, we discuss on both optimization and simulation approaches of the traffic planning. Both approaches have been extensively studied in the literature with efficient softwares. Keywords: Traffic planning, evacuation planning, emergency management ____________________________________________________________________________________________________ IntroductionEmergency management deals with natural and man-made disasters with the goal of saving lives and protecting property during emergencies and disasters. The management based on research upgrades the quality. Nepal has been a vulnerable place for disasters such as earthquake, flood, land slide, explosion of glacial lakes, fire etc. The country has been suffering from such disasters like flood, land slide, fire every year and has been losing a good number of lives and property. Emergency management does not avert or eliminate the threats themselves. However, the study and prediction of the threats based on research substantially reduce the risk.One of the most important issues in the emergency management is to plan effective transportation mode which can evacuates within a reasonable time. The traffic planning during the response phase of the emergency management has been extensively studied in the literature on both optimization as well as simulation approaches, see [6].In this paper, we describe both optimization and simulation approaches in brief that exist in the literature.The organization of the paper is as follows. We describe about emergency management in Section 2, evacuation planning in Section 3, traffic planning in Section 4. We give a brief report of the optimization and simulation approaches for the traffic planning. The last section concludes the paper. Emergency ManagementEmergency management includes prevention, planning, response and recovery (PPRR) in order to lessen the impact of disasters.Prevention is designed to provide permanent protection from disasters though not all disasters can be prevented. The risk of loss can be lessened. It is not worthy that the Hyogo Framework has been adopted on 2005 by 168 Governments as a 10-year global plan for natural disaster risk reduction.

show abstract

Section: Optimization Approachmentioning

confidence: 99%

Optimal Traffic Planning for Efficient Evacuation

Khadka

2016

J. Adv. Coll. Engin. Mgt.

View full text Add to dashboard Cite

show abstract

“…The first algorithm developed specifically for this problem was proposed by Chen and Chin (1990), who noted that b( p) ∈ {b 1 , . .…”

Section: The Quickest Path Problemmentioning

confidence: 99%

“…Among them we can mention Chen and Hung (1993), Lee and Papadopoulou (1993), who consider the quickest path among all node pairs, Calvete (2004), Lin (2003) and Rao (2004) who address non-deterministic values associated with the arcs, and Kagaris et al (1999) who propose parallel algorithms to find the quickest path in sparse networks, besides algorithms to find the dynamic quickest path problem, where the parameters of the problem may change over time.…”

Section: Boffey Et Al's Algorithmmentioning

confidence: 99%

A comprehensive survey on the quickest path problem

2006

View full text Add to dashboard Cite

This work is a survey on a special minsum-maxmin bicriteria problem, known as the quickest path problem, that can model the transmission of data between two nodes of a network. Moreover, the authors review the problems of ranking the K quickest paths, and the K quickest loopless paths, and compare them in terms of the worst-case complexity order. The classification presented led to the proposal of a new variant of a known K quickest loopless paths algorithm. Finally, applications of quickest path algorithms are mentioned, as well as some comparative empirical results. Keywords Bicriteria problem . Minsum-maxmin . Quickest path . Paths rankingThe quickest path problem is a particular case of optimal path problems, whose objective function evaluates the time taken to transmit a given amount of data through each path. This function depends on two parameters, an additive function that represents the path delay, and a bottleneck function that represents the path capacity or bandwidth. Thus, the resolution of

show abstract

“…Then it was proposed by Chen and Chin [5] in the context of modeling transmission problems in communication networks where nodes represent transmitters/receivers without data memories and arcs represent communication channels. Clímaco et al [6] applied the model to the routing of data packets in Internet networks.…”

Section: Introductionmentioning

confidence: 99%

“…They are based on solving a shortest path problem in an enlarged network [2,5], solving a sequence of shortest path problems with respect to the delay time on networks where the minimum capacity increases [10,11,16,19], using a label-setting algorithm [12] or taking into account that a quickest path is a supported efficient solution of the aforementioned bi-objective problem [20].…”

Section: Introductionmentioning

confidence: 99%

The energy-constrained quickest path problem

2016

View full text Add to dashboard Cite

This paper addresses a variant of the quickest path problem in which each arc has an additional parameter associated to it representing the energy consumed during the transmission along the arc while each node is endowed with a limited power to transmit messages. The aim of the energyconstrained quickest path problem is to obtain a quickest path whose nodes are able to support the transmission of a message of a known size. After introducing the problem and proving the main theoretical results, a polynomial algorithm is proposed to solve the problem based on computing shortest paths in a sequence of subnetworks of the original network. In the second part of the paper, the bi-objective variant of this problem is considered in which the objectives are the transmission time and the total energy used. An exact algorithm is proposed to find a complete set of efficient paths. The computational experiments carried out show the performance of both algorithms.

show abstract

On the quickest path problem

Cited by 110 publications

References 8 publications

Optimal Traffic Planning for Efficient Evacuation

Optimal Traffic Planning for Efficient Evacuation

A comprehensive survey on the quickest path problem

The energy-constrained quickest path problem

Contact Info

Product

Resources

About