Adaptive dynamic programming approach to a multi-purpose location-based concierge service model

Seungmo Kang, T. J. Kim

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

The multi-purpose location-based concierge service model is a new value-added service in the location-based service market, designed to provide the route and location of point-of-interests between an origin and destination with minimum total cost, including the purchasing and travel costs, in a multi-purpose shopping trip. Dynamic programming methods are developed to find the exact solutions for given problems. The dynamic programming decomposes complex problems into a sequential form that is easier to solve and the suggested adaptive method reduces the response time significantly. For a case in which multiple optional routes are preferable, a method that finds a second or third optimal solution is also introduced. These solution algorithms are implemented in the Chicago and Seoul metropolitan network. Test results show that the suggested algorithms can solve large size problems efficiently. The suggested methodology can be directly applied to the commercial-scale service model with a small number of shopping categories, and work as a benchmark for testing the accuracy of other heuristic algorithms for more shopping categories.

Original languageEnglish
Pages (from-to)277-285
Number of pages9
JournalIET Intelligent Transport Systems
Volume5
Issue number4
DOIs
Publication statusPublished - 2011 Dec 1

Fingerprint

Location based services
Dynamic programming
programming
Purchasing
Heuristic algorithms
Costs
Testing
costs
heuristics
value added
travel
market
methodology
services
cost
method

ASJC Scopus subject areas

  • Mechanical Engineering
  • Environmental Science(all)
  • Law
  • Transportation

Cite this

Adaptive dynamic programming approach to a multi-purpose location-based concierge service model. / Kang, Seungmo; Kim, T. J.

In: IET Intelligent Transport Systems, Vol. 5, No. 4, 01.12.2011, p. 277-285.

Research output: Contribution to journalArticle

@article{dda5ab448a5f4537a81025007bb32861,
title = "Adaptive dynamic programming approach to a multi-purpose location-based concierge service model",
abstract = "The multi-purpose location-based concierge service model is a new value-added service in the location-based service market, designed to provide the route and location of point-of-interests between an origin and destination with minimum total cost, including the purchasing and travel costs, in a multi-purpose shopping trip. Dynamic programming methods are developed to find the exact solutions for given problems. The dynamic programming decomposes complex problems into a sequential form that is easier to solve and the suggested adaptive method reduces the response time significantly. For a case in which multiple optional routes are preferable, a method that finds a second or third optimal solution is also introduced. These solution algorithms are implemented in the Chicago and Seoul metropolitan network. Test results show that the suggested algorithms can solve large size problems efficiently. The suggested methodology can be directly applied to the commercial-scale service model with a small number of shopping categories, and work as a benchmark for testing the accuracy of other heuristic algorithms for more shopping categories.",
author = "Seungmo Kang and Kim, {T. J.}",
year = "2011",
month = "12",
day = "1",
doi = "10.1049/iet-its.2011.0029",
language = "English",
volume = "5",
pages = "277--285",
journal = "IET Intelligent Transport Systems",
issn = "1751-956X",
publisher = "Institution of Engineering and Technology",
number = "4",

}

TY - JOUR

T1 - Adaptive dynamic programming approach to a multi-purpose location-based concierge service model

AU - Kang, Seungmo

AU - Kim, T. J.

PY - 2011/12/1

Y1 - 2011/12/1

N2 - The multi-purpose location-based concierge service model is a new value-added service in the location-based service market, designed to provide the route and location of point-of-interests between an origin and destination with minimum total cost, including the purchasing and travel costs, in a multi-purpose shopping trip. Dynamic programming methods are developed to find the exact solutions for given problems. The dynamic programming decomposes complex problems into a sequential form that is easier to solve and the suggested adaptive method reduces the response time significantly. For a case in which multiple optional routes are preferable, a method that finds a second or third optimal solution is also introduced. These solution algorithms are implemented in the Chicago and Seoul metropolitan network. Test results show that the suggested algorithms can solve large size problems efficiently. The suggested methodology can be directly applied to the commercial-scale service model with a small number of shopping categories, and work as a benchmark for testing the accuracy of other heuristic algorithms for more shopping categories.

AB - The multi-purpose location-based concierge service model is a new value-added service in the location-based service market, designed to provide the route and location of point-of-interests between an origin and destination with minimum total cost, including the purchasing and travel costs, in a multi-purpose shopping trip. Dynamic programming methods are developed to find the exact solutions for given problems. The dynamic programming decomposes complex problems into a sequential form that is easier to solve and the suggested adaptive method reduces the response time significantly. For a case in which multiple optional routes are preferable, a method that finds a second or third optimal solution is also introduced. These solution algorithms are implemented in the Chicago and Seoul metropolitan network. Test results show that the suggested algorithms can solve large size problems efficiently. The suggested methodology can be directly applied to the commercial-scale service model with a small number of shopping categories, and work as a benchmark for testing the accuracy of other heuristic algorithms for more shopping categories.

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

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

U2 - 10.1049/iet-its.2011.0029

DO - 10.1049/iet-its.2011.0029

M3 - Article

AN - SCOPUS:82955207137

VL - 5

SP - 277

EP - 285

JO - IET Intelligent Transport Systems

JF - IET Intelligent Transport Systems

SN - 1751-956X

IS - 4

ER -