An optomal path of a moving vehicle on a sphere

Seong I N Kim, In Chan Choi

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

We consider the problem of finding an optimal path of a moving vehicle, which during its journey provides a certain type of service to a group of existing facilities on a sphere. Service requests from each facility are assumed to follow a Poisson process and the conditional expected cost incurred by a service call is assumed to be proportional to the shortest arc distance between the facility and the vehicle's location at the time of the service request. This problem is Formulated as a variational problem and solved by repeatedly applying a dynamic programming procedure to a sequence of staged networks that are constructed via perturbation.

Original languageEnglish
Pages (from-to)383-389
Number of pages7
JournalIIE Transactions (Institute of Industrial Engineers)
Volume29
Issue number5
Publication statusPublished - 1997 Dec 1

Fingerprint

Dynamic programming
Costs
Perturbation
Optimal path
Poisson process

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering
  • Management Science and Operations Research

Cite this

An optomal path of a moving vehicle on a sphere. / Kim, Seong I N; Choi, In Chan.

In: IIE Transactions (Institute of Industrial Engineers), Vol. 29, No. 5, 01.12.1997, p. 383-389.

Research output: Contribution to journalArticle

@article{9773971c48aa431f851b168ecaf8933c,
title = "An optomal path of a moving vehicle on a sphere",
abstract = "We consider the problem of finding an optimal path of a moving vehicle, which during its journey provides a certain type of service to a group of existing facilities on a sphere. Service requests from each facility are assumed to follow a Poisson process and the conditional expected cost incurred by a service call is assumed to be proportional to the shortest arc distance between the facility and the vehicle's location at the time of the service request. This problem is Formulated as a variational problem and solved by repeatedly applying a dynamic programming procedure to a sequence of staged networks that are constructed via perturbation.",
author = "Kim, {Seong I N} and Choi, {In Chan}",
year = "1997",
month = "12",
day = "1",
language = "English",
volume = "29",
pages = "383--389",
journal = "IISE Transactions",
issn = "2472-5854",
publisher = "Taylor and Francis Ltd.",
number = "5",

}

TY - JOUR

T1 - An optomal path of a moving vehicle on a sphere

AU - Kim, Seong I N

AU - Choi, In Chan

PY - 1997/12/1

Y1 - 1997/12/1

N2 - We consider the problem of finding an optimal path of a moving vehicle, which during its journey provides a certain type of service to a group of existing facilities on a sphere. Service requests from each facility are assumed to follow a Poisson process and the conditional expected cost incurred by a service call is assumed to be proportional to the shortest arc distance between the facility and the vehicle's location at the time of the service request. This problem is Formulated as a variational problem and solved by repeatedly applying a dynamic programming procedure to a sequence of staged networks that are constructed via perturbation.

AB - We consider the problem of finding an optimal path of a moving vehicle, which during its journey provides a certain type of service to a group of existing facilities on a sphere. Service requests from each facility are assumed to follow a Poisson process and the conditional expected cost incurred by a service call is assumed to be proportional to the shortest arc distance between the facility and the vehicle's location at the time of the service request. This problem is Formulated as a variational problem and solved by repeatedly applying a dynamic programming procedure to a sequence of staged networks that are constructed via perturbation.

UR - http://www.scopus.com/inward/record.url?scp=0031140467&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031140467&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0031140467

VL - 29

SP - 383

EP - 389

JO - IISE Transactions

JF - IISE Transactions

SN - 2472-5854

IS - 5

ER -