A user-aware tour proposal framework using a hybrid optimization approach

Proceedings of the ACM Workshop on Advances in Geographic Information Systems

Volumn , Issue , 2002, Pages 81-87

  Joest, Matthias ^a   Stille, Wolfgang ^b  

^a European Media Laboratory   (Germany)

^b DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Local Scareh Algorithms; Profitable Tour Problem; User Awareness

Indexed keywords

ALGORITHMS; GEOGRAPHIC INFORMATION SYSTEMS; OPTIMIZATION;

USER-AWARENESS;

COMPUTER SCIENCE;

EID: 0038644053     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/585163.585165     Document Type: Conference Paper

References (16)

1. E. H. L. Aarts and J. K. Lenstra, editors. Local Search in Combinatorial Optimization, chapter 9: Vehicle Routing: Modern Heuristics, pages 311-336. Wiley, Chichester, 1997.
2. G. Abowd, C. Atkeson, J. Hong, S. Long, R. Kooper, and M. Pinkerton. Cyberguide: A mobile context-aware tour guide. In ACM Wireless Networks, 5, pages 421-433, 1997.
3. E. Balas. The Prize Collecting Traveling Salesman Problem. Networks, 19:621-636, 1989.
4. B. Cherkassky, A. Goldberg, and T. Radzik. Shortest Paths Algorithms: Theory and Experimental Evaluation. In Proceedings of the 5th Annual ACM SIAM Symposium on Discrete Algorithms, pages 516-525, Arlington, VA, January 1994.
5. K. Cheverst, N. Davies, K. Mitchell, A. Friday, and C. Efstratiou. Developing a Context-Aware Electronic Tourist Guide: Some Issues and Experiences. In Proceedings of CHI'00, ACM Press, Netherlands, 2000.
6. M. Dell'Amico, F. Maffioli, and A. Sciomachen. A Lagrangian Heuristic for the Prize Collecting Travelling Salesman Problem. Annals of Operations Research, 81(1):289-305, 1998.
7. M. Dell'Amico, F. Maffioli, and P. Värbrand. On Prize-Collecting Tours and the Asymmetric Travelling Salesman Problem. International Transactions on Operational Research, 81(1):289-305, 1995.
8. M. Gendreau, A. Hertz, and G. Laporte. New Insertion and Postoptimization Procedures for the Traveling Salesman Problem. Operations Research, 40(6):1086-1094, 1992.
9. M. Goemans and D. Williamson. A General Approximation Technique for Constrained Forest Problems. In Proceedings of the 3rd ACM-SIAM Symposium on Discrete Algorithms, pages 307-315, 1992.
10. S. Lin and B. W. Kernighan. An Effective Heuristic Algorithm for the Traveling Salesman Problem. Operations Research, 21:498-516, 1973.
11. R. Malaka, R. Porzel, A. Zipf, and V. Chandrasekhara. Integration of Smart Components for Building your Personal Mobile Guide. In Proceedings of AIMS 2000. Workshop on Artificial Intelligence in Mobile Systems, Berlin, 2000.
12. R. Malaka and A. Zipf. Deep map - Challenging IT Research in the Framework of a Tourist Information System. In Information and Communication Technologies in Tourism 2000. Proceedings of ENTER 2000, 7th. International Congress on Tourism and Communications Technologies in Tourism. Barcelona. Spain, pages 15-27, 2000.
13. J. Mittenthal and C. E. Noon. An Insert/Delete Heuristic for the Travelling Salesman Subset-Tour Problem with one Additional Constraint. Journal of the Operational Research Society, 43(3):277-283, 1995.
14. G. Reinelt. The Traveling Salesman: Computational Solutions for TSP Applications, volume 840 of Lecture Notes in Computer Science. Springer, Heidelberg, 1994.
15. W. Stille. Lösungsverfahren für Prize-Collecting Traveling Salesman Subtour Probleme und ihre Anwendung auf die Tourenplanung im Touristeninformationssystem Deep Map. Master's thesis, University of Heidelberg, Heidelberg, March 2001.
16. F. B. Zhan and C. E. Noon. Shortest Path Algorithms: An Evaluation using Real Road Networks. Transportation Science, 32:65-73, 1998.