Concierge Service Problem for Location -Based Services: Combined-Cost and Multi Objective Approaches
Kang, Seungmo
This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/83373
Description
Title
Concierge Service Problem for Location -Based Services: Combined-Cost and Multi Objective Approaches
Author(s)
Kang, Seungmo
Issue Date
2008
Doctoral Committee Chair(s)
Valocchi, Albert J.
Department of Study
Civil Engineering
Discipline
Civil Engineering
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Transportation
Language
eng
Abstract
In this research, we defined and formulated CSP for both general and simple cases, and developed exact and heuristic solution algorithms for both combined-cost and multi-objective approaches. The exact algorithms include the adaptive dynamic programming with or without multiple alternative solutions. The heuristic solution algorithms vary from the Euclidean heuristic, the modified K-th shortest path method, the single minimum cost POI method, and Genetic Algorithms. The computational performance of suggested algorithms has been evaluated for its efficiency and validated by implementing them using large size metropolitan networks; Chicago, Illinois and Seoul, Korea for various service scenarios.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
