NDLI: Risk-averse shortest path problems

Content Provider	IEEE Xplore Digital Library
Author	Gavriel, C. Hanasusanto, G. Kuhn, D.
Copyright Year	2012
Description	Author affiliation: Department of Computing, Imperial College London, SW7 2AZ, United Kingdom (Gavriel, C.; Hanasusanto, G.; Kuhn, D.)
Abstract	We investigate routing policies for shortest path problems with uncertain arc lengths. The objective is to minimize a risk measure of the total travel time. We use the conditional value-at-risk (CVaR) for when the arc lengths (durations) have known distributions and the worst-case CVaR for when these distributions are only partially described. Policies which minimize the expected travel time (average-optimal policies) are desirable for experiments that are repeated several times, but the fact that they take no account of risk makes them unsuitable for decisions that need to be taken only once. In these circumstances, policies that minimize a risk measure provide protection against rare events with high cost.
Starting Page	2533
Ending Page	2538
File Size	403441
Page Count	6
File Format	PDF
ISBN	9781467320658
ISSN	07431546
e-ISBN	9781467320665
e-ISBN	9781467320641
DOI	10.1109/CDC.2012.6426188
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2012-12-10
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Shortest path problem Routing Random variables Dynamic programming Optimization Uncertainty Heuristic algorithms
Content Type	Text
Resource Type	Article
Subject	Control and Optimization Control and Systems Engineering Modeling and Simulation

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Optimization test problems with uniformly distributed coefficients

Dynamic algorithms for the shortest path routing problem: learning automata-based solutions

Shortest path problems on stochastic graphs: a neuro dynamic programming approach

Adaptive Routing in Network-on-Chips Using a Dynamic-Programming Network

Fast Parallel Hierarchical Aggregation/Disaggregation Algorithms for Multistage Optimization Problems and Shortest Path Problems

Solving Shortest Path Problem Using Hopfield Networks and Genetic Algorithms

Fractal Graph Optimization Algorithms

Solving generalized vehicle routing problem by parallel universes and Tabu search

Shortest paths subject to time-varying stochastic transit times

Risk-averse shortest path problems

Similar Documents

Optimization test problems with uniformly distributed coefficients

Dynamic algorithms for the shortest path routing problem: learning automata-based solutions

Shortest path problems on stochastic graphs: a neuro dynamic programming approach

Adaptive Routing in Network-on-Chips Using a Dynamic-Programming Network

Fast Parallel Hierarchical Aggregation/Disaggregation Algorithms for Multistage Optimization Problems and Shortest Path Problems

Solving Shortest Path Problem Using Hopfield Networks and Genetic Algorithms

Fractal Graph Optimization Algorithms

Solving generalized vehicle routing problem by parallel universes and Tabu search

Shortest paths subject to time-varying stochastic transit times

Risk-averse shortest path problems