Earticle

초록

영어

This paper considers the shortest path problem on directed acyclic graphs, where the uncertainty of input data (lengths of arcs) is modeled in the form of intervals. In order to handle the interval data the minmax criterion to the regret values is applied, where the original objective function with interval coefficients is transformed into that of finding the least maximum worst-case regret, which is called the minmax regret criterion. A heuristic algorithm exploiting properties to reduce the computational times and to improve the solution quality is developed and its performance is shown with computational experiments.

목차

Abstract
 1. Introduction
 2. Problem Description and Preliminaries.
 3. The Algorithm
  3.1 Main Ideas
  3.2 Pseudo-code
 4. Computational Experiments
  4.1 Network Model
  4.2 Experimental Result
 5. Conclusions
 Acknowledgements
 References

키워드

저자

• Jun-Gyu Kang [ Department of Industrial & Management Engineering, Sungkyul University, Korea ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Control and Automation

• 간기

  월간

• pISSN

  2005-4297

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605