WWW.ABSTRACT.XLIBX.INFO
FREE ELECTRONIC LIBRARY - Abstract, dissertation, book
 
<< HOME
CONTACTS



Pages:     | 1 |   ...   | 17 | 18 || 20 |

«Automated Tourist Decision Support Wouter Souffriau Dissertation presented in partial fulfillment of the requirements for the degree of Doctor in ...»

-- [ Page 19 ] --

J. Fink and A. Kobsa. User modeling in personalized city tours. Artificial Intelligence Review, 18:33–74, 2002.

M. Fischetti, J. Salazar, and P. Toth. Solving the orienteering problem through branch-and-cut.

INFORMS Journal on Computing, 10:133–148, 1998.

F. V. Fomin and A. Lingas. Approximation algorithms for time–dependent orienteering.

Information Processing Letters, 83:57–62, 2002.

G. Gallo and S. Pallattino. Shortest path methods: a unified approach. Mathematical Programming Study, 26:38–64, 1986.

–  –  –

A. Garcia, P. Vansteenwegen, W. Souffriau, M. T. Liniza, and O. Arbelaitz. Solving multiconstrained team orienteering problems to generate tourist routes. Computers & Industrial Engineering, under review, 2010.

M. Gendreau, G. Laporte, and F. Semet. A branch-and-cut algorithm for the undirected selective travelling salesman problem. Technical Report CRT-95-80, Centre de recherche sur les transports, Montreal, Canada, 1995.

M. Gendreau, G. Laporte, and F. Semet. A tabu search heuristic for the undirected selective travelling salesman problem. European Journal of Operational Research, 106:539–545, 1998a.

M. Gendreau, G. Laporte, and F. Semet. A branch-and-cut algorithm for the undirected selective travelling salesman problem. Networks, 32:263–273, 1998b.

F. Glover. Interfaces in Computer Science and Operations Research, chapter Tabu search and adaptive memory programming, pages 1–75. Kluwer, 1996.

F. Glover and M. Laguna. Tabu Search. Kluwer Academic Publishers, 1997.

J.M. Godart. Combinatorial optimisation for trip planning. Belgian Journal of Operations Research, Statistics and Computer Science, 41(1–2):59–68, 2001.

D. E. Goldberg. Genetic algorithms in search, optimization and machine learning. Kluwer Academic Publishers, 1989.

B. Golden, L. Levy, and R. Vohra. The orienteering problem. Naval Research Logistics, 34:

307–318, 1987.

B. Golden, Q. Wang, and L. Liu. A multifaceted heuristic for the orienteering problem. Naval Research Logistics, 35:359–366, 1988.

E. M. Goldratt. The Goal: A Process of Ongoing Improvement. North River Press, 1984.

C. Gueguen. Methodes de resolution exacte pour les problemes de tournes de vehicules. PhD thesis, Ecole Centrale Paris, France, 1999.

G. Gutin, A. Yeo, and A. Zverovich. Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the tsp. Discrete Applied Mathematics, 117:81–86, 2002.

W. Harvey and M. Ginsberg. Limited discrepancy search. In Proceedings of the 14th international joint conference on artificial intelligence (IJCAI–95), pages 607–615. Morgan Kaufman, 1995.

H. Hashimoto, M. Yagiura, and T. Ibaraki. An iterated local search algorithm for the timedependent vehicle routing problem with time windows. Discrete Optimization, 5:434–456, 2008.

N. Hayari, M.A. Manier, C. Bloch, and A. El Moudni. Un algorithme evolutionniste pour le probleme de tournees selectives avec constraintes de fenetres de temps. In 4e Confrence Francophone de MOdlisation et SIMulation, Toulouse, France, 2003.

F. Hermann and F. Heidmann. User requirement analysis and interface conception for a mobile, location-based fair guide. In F. Paterno, editor, Human Computer Interaction with Mobile Devices, Proceedings of the 4th International Symposium Mobile HCI, pages 388–392, Berlin,

2002. Springer.

–  –  –

F. Herrera, M. Lozano, and J. Verdegay. Tackling real-coded genetic algorithms: Operators and tools for behavioural analysis. Artificial Intelligence Review, 12(4):265–319, 1998.

F.S. Hillier. Efficient heuristic procedures for integer linear programming with an interior.

Operations Research, 17:600–637, 1969.

A. Hinze and A. Voisard. Location and time-based information delivery in tourism. In Proceedings of the 8th International Symposium on Advances in Spatial and Temporal Databases, 2003.

Y. Huang and L. Bian. A bayesian network and analytic hierarchy process based personalized recommendations for tourist attractions over the internet. Expert Systems with Applications, 36:933–943, 2009.

T. Ibaraki, S. Imahori, M. Kubo, T. Masuda, T. Uno, and M. Yagiura. Effective local search algorithms for routing and scheduling with general time-window constraints. Transportation Science, 39(2):206–232, 2005.

T. Ilhan, S. Iravani, and M. Daskin. The orienteering problem with stochastic profits. IIE Transactions, 40:406–421, 2008.

H. Iwasaki, N. Mizuno, K. Hara, and Y. Motomura. User-adapted car navigation system using a bayesian network personalized recommendation of content. In Proceedings of the 7th International Conference on Intelligent Transport Systems Telecommunications, 2007.

K. Kabassi. Personalizing recommendations for tourists. Telematics and Informatics, 27(1):51–66, 2010.

E. Kang, H. Kim, and J. Cho. Knowledge-Based Intelligent Information and Engineering Systems, volume 4251 of Lecture Notes in Computer Science, chapter Personalization Method for Tourist Point of Interest (POI) Recommendation, pages 392–400. Springer Berlin / Heidelberg, 2006.

M. Kantor and M. Rosenwein. The orienteering problem with time windows. Journal of the Operational Research Society, 43(6):629–635, 1992.





S. Kataoka and S. Morito. An algorithm for the single constraint maximum collection problem.

Journal of the Operations Research Society of Japan, 31(4):515–530, 1988.

L. Ke, C. Archetti, and Z. Feng. Ants can solve the team orienteering problem. Computers & Industrial Engineering, 54:648–665, 2008.

P. Keller. Algorithms to solve the orienteering problem: A comparison. European Journal of Operational Research, 41:224–231, 1989.

D.V. Keyson. An electronic mobile guide for Artis zoo. Technical report, Intelligence in Products Group, Faculty of Industrial Design, Delft University of Technology, The Netherlands, 2004.

T. Kinoshita, M. Nagata, N. Shibata, Y. Murata, K. Yasumoto, and M. Ito. A personal navigation system for sightseeing across multiple days. In Proc. of the 3rd Int’l. Conf. on Mobile Computing and Ubiquitous Networking (ICMU2006), pages 254–259, 2006.

S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi. Optimization by simulated annealing. Science, New Series 220:671–680, 1983.

–  –  –

J. Kr¨sche, J. Baldzer, and S. Boll. Mobidenk-mobile multimedia in monument conservation.

o IEEE MultiMedia, 11(2):72–77, 2004. ISSN 1070-986X. doi: http://doi.ieeecomputersociety.

org/10.1109/MMUL.2004.1289043.

A. Kr¨ger and R. Malaka. Artificial intelligence goes mobile. Applied Artificial Intelligence, 18:

u 469–476, 2004.

M. Laguna and R. Mart´ Grasp and path relinking for 2-layer straight line crossing minimization.

ı.

INFORMS Journal on Computing, 11:44–52, 1999.

G. Laporte and S. Martello. The selective travelling salesman problem. Discrete applied mathematics, 26:193–207, 1990.

C.-S. Lee, Y.-C. Chang, and M.-H. Wang. Ontological recommendation multi–agent for tainan city travel. Expert Systems with Applications, 36:6740–6753, 2009.

J. Lee,, E. Kang, and G.-L. Park. Computational Science and Its Applications ICCSA 2007, chapter Design and Implementation of a Tour Planning System for Telematics Users, pages 179–189. Springer Berlin / Heidelberg, 2007.

A.C. Leifer and M.S. Rosenwein. Strong linear programming relaxations for the orienteering problem. Bell System Technical Journal, 44:2245–2269, 1994.

D. Levine. Parallel genetic algorithm library. http://wwwfp.mcs.anl.gov/CCST/research/reports pre1998/comp bio/stalk/pgapack.html.

Y. Liang, S. Kulturel-Konak, and A. Smith. Meta heuristics for the orienteering problem. In Proceedings of the 2002 Congress on Evolutionary Computation, pages 384–389, Honolulu, Hawai, 2002.

Y.-C. Liang and A. E. Smith. An ant colony approach to the orienteering problem. Technical report, Department of Industrial and Systems Engineering, Auburn University, Auburn, AL, 2001.

S. Lin. Computer solutions of the traveling salesman problem. Bell System Technical Journal, 44:2245–2269, 1965.

S. Loh, F. Lorenzi, R. Saldana, and D. Licthnow. A tourism recommendation system based on collaboration and text analysis. Information Technology & Tourism, 5:157–165, 2003.

–  –  –

R. Malaka and A. Zipf. Deep Map - challenging it research in the framework of a tourist information system. In ENTER, Barcelona, Spain, 2000.

R. Mansini, M. Pelizzari, and R. Wolfer. A granular variable neighbourhood search heuristic for the tour orienteering problem with time windows. Technical Report 2006-02-52, University of Brescia, Italy, 2006.

S. Martello and P. Toth. Knapsack Problems - Algorithm and Computer Implementations. John Wiley & Sons, 1990.

–  –  –

A. Maruyama, N. Shibata, Y. Murata, K. Yasumoto, and M. Ito. A personal tourism navigation system to support traveling multiple destinations with time restrictions. In Proc. of the 18th Int’l. Conf. on Advanced Information Networking and Applications (AINA 2004), pages 18–21, 2004b.

C. E. Miller, A. W. Tucker, and R. A. Zemlin. Integer programming formulations and traveling salesman problems. Journal of the ACM, 7:326–329, 1960.

T.M. Mitchell. Machine Learning. McGraw-Hill, 1997.

N. Mladenovi´ and P. Hansen. Variable neighborhood search. Computers and Operations Research, c 24(11):1097–1100, 1997.

R. Montemanni and L.M. Gambardella. Ant colony system for team orienteering problems with time windows. Foundations of Computing and Decision Sciences, 34, 2009.

L. Muyldermans, P. Beullens, D. Cattrysse, and D. Van Oudheusden. Exploring variants of 2and 3-opt for the general routing problem. Operations Research, 53(6):982–995, 2005.

M. Nagata, Y. Murata, N. Shibata, K. Yasumoto, and M. Ito. Simulated Evolution and Learning, volume 4247 of Lecture Notes in Computer Science, chapter A Method to Plan Group Tours with Joining and Forking, pages 881–888. Springer Berlin / Heidelberg, 2006.

A.S. Niaraki and K. Kim. Ontology based personalized route planning system using a multi-criteria decision making approach. Expert Systems with Applications, 36:2250–2259, 2009.

M.J. O’ Grady and G.M.P. O’ Hare. Gullivers genie: agency, mobility & adaptivity. Computers & Graphics, 28(4):677–689, 2004. Special Issue on Pervasive Computing and Ambient Intelligence – Mobility, Ubiquity and Wearables Get Together.

G. O’Hare and M. O’Grady. Genie: a multi-agent system for ubiquitous and intelligent content delivery. Computer Communications, 26:1177–1187, 2002.

R. Oppermann and M. Specht. A nomadic information system for adaptive exhibition guidance.

Archives & Museum Informatics, 13:127–138, 1999.

I. Or. Traveling salesman-type combinatorial problems and their relation to the logistics of blood banking. PhD thesis, Department of Industrial Engineering and Management Sciences, Nortwestern University, Evanston, 1976.

A. Pashtan, R. Blattler, A. Heusser, and P. Scheuermann. Catis: a context–aware tourist information system. In Proceedings of the IMC 2003, 4th International Workshop of Mobile Computing, Rostock, Germany, 2003.

J. Pearl. Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley, 1984.

D. Petrelli, E. Not, M. Sarini, O. Stock, C. Strapparava, and M. Zancanaro. Hyperaudio:

Location-awareness + adaptivity. In the Extended

Abstract

of CHI99, Pittsburgh, 1999.

M. Porter. An algorithm for suffix stripping. Program, 14(3):130–137, 1980.

S. Poslad, H. Laamanen, R. Malaka, A. Nick, P. Buckle, and A. Zipf. Crumpet: Creation of user-friendly mobile services personalized for tourism. In 3G, London, U.K, 2001.

–  –  –

E. Pyrga, F. Schulz, D. Wagner, and C. Zaroliagis. Efficient models for timetable information in public transportation systems. Journal of Experimental Algorithmics, 12:1–39, 2008.

R. Ramesh and K. Brown. An efficient four-phase heuristic for the generalized orienteering problem. Computers and Operations Research, 18:151–165, 1991.

R. Ramesh, Y. Yoon, and M. Karwan. An optimal algorithm for the orienteering tour problem.

ORSA Journal on Computing, 4:155–165, 1992.

C. Reeves. Handbook of Metaheuristics, chapter Genetic Algorithms, pages 55–82. Kluwer Academic Publishers, 2003.

M. Reghioui, C. Prins, and N. Labadi. Grasp with path relinking for the capacitated arc routing problem with time windows. In EvoWorkshops, pages 722–731, 2007.

F. Ricci. Travel recommendation systems. IEEE Intelligent Systems, 17(6):55–57, 2002.

F. Ricci and H. Werthner. Case-based querying for travel planning recommendation. Information Technology and Tourism, 4(3–4):215–226, 2002.

F. Ricci, A. Venturini, D. Cavada, N. Mirzadeh, D. Blaas, and M. Nones. Proceedings of the 5th International Conference on Case-Based Reasoning, ICCBR 2003, volume 2689 of Lecture Notes in Computer Science, chapter Produce recommendation with interactive query management and twofold similarity, pages 479–493. Springer Berlin / Heidelberg, 2003.

G. Righini and M. Salani. Dynamic programming for the orienteering problem with time windows.

Technical Report 91, Dipartimento di Tecnologie dellInformazione, Universita degli Studi Milano, Crema, Italy, 2006.

G. Righini and M. Salani. New dynamic programming algorithms for the resource constrained elementary shortest path. Networks, 51(3):155–170, 2008.

G. Righini and M. Salani. Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming. Computers & Operations Research, 4:1191–1203, 2009.

J. Roth. Context-aware web applications using the pinpoint infrastructure. In IADIS International Conference WWW/Internet, pages 3–10, Lissabon, Portugal, 2002.

T. L. Saaty. The analytic hierarchy process. McGraw–Hill, 1980.

G. Salton. Automatic Text Processing. Addison-Wesley, 1989.

A. Scherp and S. Boll. Generic support for personalized mobile multimedia tourist applications. In ACM Multimedia 2004 Proceedings of the 12th ACM International Conference on Multimedia, page 178179, 2004.



Pages:     | 1 |   ...   | 17 | 18 || 20 |


Similar works:

«The Outsiders by S. E. Hinton Copyright Notice ©2011 eNotes.com Inc.ALL RIGHTS RESERVED. No part of this work covered by the copyright hereon may be reproduced or used in any form or by any means graphic, electronic, or mechanical, including photocopying, recording, taping, Web distribution or information storage retrieval systems without the written permission of the publisher. ©1998-2002; ©2002 by Gale Cengage. Gale is a division of Cengage Learning. Gale and Gale Cengage are trademarks...»

«IEA Fluidized Bed Conversion Programme Status Report 2010 F. Winter, P. Szentannai Berichte aus Energieund Umweltforschung 30/2010 Impressum: Eigentümer, Herausgeber und Medieninhaber: Bundesministerium für Verkehr, Innovation und Technologie Radetzkystraße 2, 1030 Wien Verantwortung und Koordination: Abteilung für Energieund Umwelttechnologien Leiter: DI Michael Paula Liste sowie Bestellmöglichkeit aller Berichte dieser Reihe unter http://www.nachhaltigwirtschaften.at IEA Fluidized Bed...»

«Abschlussbericht zum UFO-PLAN-Vorhaben Abfallwirtschaftskonferenz 2007 Exportmöglichkeiten der deutschen Abfallwirtschaft in Industrie-, Schwellenund Entwicklungsländer, FKZ: 907 14 615 im Auftrag von: BMU Bundesministerium für Umwelt, Naturschutz und Reaktorsicherheit Robert-Schuman-Platz 3 53175 Bonn vorgelegt von: ARGUS Arbeitsgruppe Umweltstatistik an der Technischen Universität Berlin e.V. Franklinstr. 1 10587 Berlin in Kooperation mit: EITEP Euro Institute for Information and...»

«30 CHAPTER 4 INTER-TIDAL RECHARGE TECHNIQUES 4.1 Increased Sediment Supply There are potential opportunities, through environmentally-sensitive soft engineering methods, to maximise environmental benefits. Inter-tidal recharge is the term used to describe the artificial raising of inter-tidal and sub-tidal areas with imported sediment (Environment Agency, 1998), The technique makes beneficial use of densified, lowcontaminated (clean or treated), low-cost maintenance-dredged sediment...»

«Crystallization Behavior in the System EMIM[Tf2N]-AlCl3 Kristallisationsverhalten im System EMIM[Tf2N]-AlCl3 Der Technischen Fakultät der Universität Erlangen-Nürnberg zur Erlangung des Grades DOKTOR-INGENIEUR vorgelegt von Jose Luis Solà Cervera Erlangen 2010 II Als Dissertation genehmigt von der Technischen Fakultät der Universität Erlangen-Nürnberg Tag der Einreichung: 05.02.2010 Tag der Promotion: 06.08.2010 Dekan: Prof. Dr. Reinhard German Berichterstatter: Prof. Dr. Axel König...»

«Nick Dyer-Witheford 1844/2004/2044: The Return of Species-Being Introduction After a long period of neglect, the question of ‘speciesbeing’ has resurfaced in Marxist theory, forming an important topic of discussion in recent works by David Harvey and Gayatri Spivak on capitalist globalisation, and in Jason Read’s re-examination of the mode of production. 1 This outbreak is conjunctural, not coincidental. The problem Marx addressed in 1844 under the rubric of species-being was the...»

«An Investigation of Eighth Grade Students’ Problem Posing Skills (Turkey Sample) Elif Esra Arıkan1, Hasan Ünal2 Yildiz Technical University, Turkey, arikanee@gmail.com Yildiz Technical University, Turkey, hunal@yildiz.edu.tr www.ijres.net To cite this article: Arikan, E. E. & Unal, H. (2015). An investigation of eighth grade students’ problem posing skills (Turkey sample). International Journal of Research in Education and Science (IJRES), 1(1), 23-30. This article may be used for...»

«Mechanical behavior of annulus fibrosus: a microstructural model of fibers reorientation. Dominique Ambard, Fabien Cherblanc To cite this version: Dominique Ambard, Fabien Cherblanc. Mechanical behavior of annulus fibrosus: a microstructural model of fibers reorientation. Annals of Biomedical Engineering, Springer Verlag, 2009, 37 (11), pp.2256-2265. 10.1007/s10439-009-9761-7. hal-00449672 HAL Id: hal-00449672 https://hal.archives-ouvertes.fr/hal-00449672 Submitted on 3 Feb 2011 HAL is a...»

«Fairer Austausch Vom Fachbereich Informatik der Technischen Universität Darmstadt genehmigte Dissertation zur Erlangung des akademischen Grades eines Doktor-Ingenieurs (Dr.-Ing.) von Dipl.-Inform. Holger Vogt aus Hofheim am Taunus Referenten: Prof. Dr. J. Buchmann Prof. Dr. R. Grimm Datum der Einreichung: 28.04.2003 Datum der mündlichen Prüfung: 13.06.2003 Darmstadt 2003 D17 II Danksagung Zunächst einmal möchte ich allen danken, die mich während der Arbeit an dieser Dissertation...»

«MOUSE BIOMETHODOLOGY Marcel I. Perret-Gentil, DVM, MS University Veterinarian & Director Laboratory Animal Resources Center The University of Texas at San Antonio (210) 458-6173 larc@utsa.edu PURPOSE OF THIS DOCUMENT This is a handout that accompanies a hands-on mouse biomethodology workshop in the Laboratory Animal Resources Center (LARC). OBJECTIVES A. Instruct participants in methods of safe, humane handling and restraint. B. Instruct participants in substance administration to include...»

«Hoover Press : Posner/Domestic Intel hposdi ch3 Mp_51_rev1_page 51 3. A Better Solution A new domestic intelligence agency is needed; but reform cannot stop there. Coordination and Command There are 17 federal intelligence agencies, scattered among different Cabinet-level departments, with the principal exception of the CIA, whose director reports to the President and the Director of National Intelligence rather than to a Cabinet member.1 Before the Intelligence Reform Act, the different...»

«Q2014 European Conference on quality in official statistics Vienna, 2-5 June 2014 Web scraping techniques to collect data on consumer electronics and airfares for Italian HICP compilation Riccardo Giannini (rigianni@istat.it), Rosanna Lo Conte (rolocont@istat.it), Stefano Mosca (stmosca@istat.it), Federico Polidoro (polidoro@istat.it), Francesca Rossetti (frrosset@istat.it)1 Table of contents Foreword 1. Centralised data collection for Italian HICP estimation and identification of the products...»





 
<<  HOME   |    CONTACTS
2016 www.abstract.xlibx.info - Free e-library - Abstract, dissertation, book

Materials of this site are available for review, all rights belong to their respective owners.
If you do not agree with the fact that your material is placed on this site, please, email us, we will within 1-2 business days delete him.