Abstract
As a location-based services problem, the concierge service problem is to find a minimum total cost for purchasing predetermined types and quantities of items with the shortest paths connecting the locations where the items are available. These locations are defined as points of interest (POIs). The total cost includes purchasing and stopping costs at POIs as well as the travel cost from origin to destination. To respond to a request for such a service, a search algorithm should be reasonably fast in computational time and high in accuracy. A heuristic search algorithm was developed by a Euclidean distance approach using a geographic information system. The algorithm was implemented with 1,248 POIs in the Seoul, South Korea, metropolitan area as a case study site. The road network is composed of 52,915 nodes and 77,339 links, and the existing subway network, and all existing bus routes were used for the implementation. Four scenarios were examined: a request for a service in peak and off-peak periods with and without turning restrictions. The results indicate that the computational time in each case is less than 4 s with the transit networks only and less than 30 s if the road network is used. The paper also evaluates the solutions generated from the algorithm.
| Original language | English |
|---|---|
| Title of host publication | Transportation Research Record |
| Pages | 123-132 |
| Number of pages | 10 |
| Edition | 1972 |
| Publication status | Published - 2006 Dec 1 |
| Externally published | Yes |
Publication series
| Name | Transportation Research Record |
|---|---|
| Number | 1972 |
| ISSN (Print) | 03611981 |
Fingerprint
ASJC Scopus subject areas
- Civil and Structural Engineering
Cite this
Heuristic algorithm for solving a multimodal location-based concierge service problem. / Kang, Seungmo; Oh, Seung; Kim, Tschangho John.
Transportation Research Record. 1972. ed. 2006. p. 123-132 (Transportation Research Record; No. 1972).Research output: Chapter in Book/Report/Conference proceeding › Chapter
}
TY - CHAP
T1 - Heuristic algorithm for solving a multimodal location-based concierge service problem
AU - Kang, Seungmo
AU - Oh, Seung
AU - Kim, Tschangho John
PY - 2006/12/1
Y1 - 2006/12/1
N2 - As a location-based services problem, the concierge service problem is to find a minimum total cost for purchasing predetermined types and quantities of items with the shortest paths connecting the locations where the items are available. These locations are defined as points of interest (POIs). The total cost includes purchasing and stopping costs at POIs as well as the travel cost from origin to destination. To respond to a request for such a service, a search algorithm should be reasonably fast in computational time and high in accuracy. A heuristic search algorithm was developed by a Euclidean distance approach using a geographic information system. The algorithm was implemented with 1,248 POIs in the Seoul, South Korea, metropolitan area as a case study site. The road network is composed of 52,915 nodes and 77,339 links, and the existing subway network, and all existing bus routes were used for the implementation. Four scenarios were examined: a request for a service in peak and off-peak periods with and without turning restrictions. The results indicate that the computational time in each case is less than 4 s with the transit networks only and less than 30 s if the road network is used. The paper also evaluates the solutions generated from the algorithm.
AB - As a location-based services problem, the concierge service problem is to find a minimum total cost for purchasing predetermined types and quantities of items with the shortest paths connecting the locations where the items are available. These locations are defined as points of interest (POIs). The total cost includes purchasing and stopping costs at POIs as well as the travel cost from origin to destination. To respond to a request for such a service, a search algorithm should be reasonably fast in computational time and high in accuracy. A heuristic search algorithm was developed by a Euclidean distance approach using a geographic information system. The algorithm was implemented with 1,248 POIs in the Seoul, South Korea, metropolitan area as a case study site. The road network is composed of 52,915 nodes and 77,339 links, and the existing subway network, and all existing bus routes were used for the implementation. Four scenarios were examined: a request for a service in peak and off-peak periods with and without turning restrictions. The results indicate that the computational time in each case is less than 4 s with the transit networks only and less than 30 s if the road network is used. The paper also evaluates the solutions generated from the algorithm.
UR - http://www.scopus.com/inward/record.url?scp=33947610809&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33947610809&partnerID=8YFLogxK
M3 - Chapter
AN - SCOPUS:33947610809
SN - 0309099811
SN - 9780309099813
T3 - Transportation Research Record
SP - 123
EP - 132
BT - Transportation Research Record
ER -