@article{exposito_heuristic-biased_2016,
	title = {A heuristic-biased {GRASP} for the team orienteering problem},
	volume = {9868 LNAI},
	issn = {03029743},
	url = {https://www2.scopus.com/inward/record.uri?eid=2-s2.0-84988568992&doi=10.1007%2f978-3-319-44636-3_40&partnerID=40&md5=4acc4c302b13aca899807dd3de4c6a8e},
	doi = {10.1007/978-3-319-44636-3_40},
	abstract = {This paper introduces a route-planning problem in the sector of tourism. The Tourist Trip Design Problem seeks to maximize the number of points of interest to visit. This paper also proposes an optimization approach for a multi-day planning problem for sightseeing. In order to solve this optimization problem, an efficient Greedy Randomized Adaptive Search Procedure is developed to obtain high-quality solutions. Enhanced solution construction mechanisms and bias functions used in construction mechanism have been proposed. The computational experiments indicate the solving scheme is able to report competitive solutions by using short computational times. © Springer International Publishing Switzerland 2016.},
	language = {English},
	journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
	author = {Expósito, A. and Brito, J. and Moreno, J.A.},
	editor = {Barrenechea E., Troncoso A., Gamez J.A., Luaces O., Quintian H., Corchado E., Galar M.},
	year = {2016},
	keywords = {Artificial intelligence, Computational experiment, Computational time, Design problems, Greedy randomized adaptive search procedure, Heuristic algorithms, High-quality solutions, Optimization, Optimization approach, Optimization problems, Problem solving, Team orienteering problems},
	pages = {428--437}
}

{"_id":"K9ZqmbueuCTvYX2r2","bibbaseid":"expsito-brito-moreno-aheuristicbiasedgraspfortheteamorienteeringproblem-2016","authorIDs":[],"author_short":["Expósito, A.","Brito, J.","Moreno, J."],"bibdata":{"bibtype":"article","type":"article","title":"A heuristic-biased GRASP for the team orienteering problem","volume":"9868 LNAI","issn":"03029743","url":"https://www2.scopus.com/inward/record.uri?eid=2-s2.0-84988568992&doi=10.1007%2f978-3-319-44636-3_40&partnerID=40&md5=4acc4c302b13aca899807dd3de4c6a8e","doi":"10.1007/978-3-319-44636-3_40","abstract":"This paper introduces a route-planning problem in the sector of tourism. The Tourist Trip Design Problem seeks to maximize the number of points of interest to visit. This paper also proposes an optimization approach for a multi-day planning problem for sightseeing. In order to solve this optimization problem, an efficient Greedy Randomized Adaptive Search Procedure is developed to obtain high-quality solutions. Enhanced solution construction mechanisms and bias functions used in construction mechanism have been proposed. The computational experiments indicate the solving scheme is able to report competitive solutions by using short computational times. © Springer International Publishing Switzerland 2016.","language":"English","journal":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","author":[{"propositions":[],"lastnames":["Expósito"],"firstnames":["A."],"suffixes":[]},{"propositions":[],"lastnames":["Brito"],"firstnames":["J."],"suffixes":[]},{"propositions":[],"lastnames":["Moreno"],"firstnames":["J.A."],"suffixes":[]}],"editor":[{"propositions":[],"lastnames":["Barrenechea","E."],"firstnames":["Troncoso","A."],"suffixes":[]},{"propositions":[],"lastnames":["Gamez","J.A."],"firstnames":["Luaces","O."],"suffixes":[]},{"propositions":[],"lastnames":["Quintian","H."],"firstnames":["Corchado","E."],"suffixes":[]}],"year":"2016","keywords":"Artificial intelligence, Computational experiment, Computational time, Design problems, Greedy randomized adaptive search procedure, Heuristic algorithms, High-quality solutions, Optimization, Optimization approach, Optimization problems, Problem solving, Team orienteering problems","pages":"428–437","bibtex":"@article{exposito_heuristic-biased_2016,\n\ttitle = {A heuristic-biased {GRASP} for the team orienteering problem},\n\tvolume = {9868 LNAI},\n\tissn = {03029743},\n\turl = {https://www2.scopus.com/inward/record.uri?eid=2-s2.0-84988568992&doi=10.1007%2f978-3-319-44636-3_40&partnerID=40&md5=4acc4c302b13aca899807dd3de4c6a8e},\n\tdoi = {10.1007/978-3-319-44636-3_40},\n\tabstract = {This paper introduces a route-planning problem in the sector of tourism. The Tourist Trip Design Problem seeks to maximize the number of points of interest to visit. This paper also proposes an optimization approach for a multi-day planning problem for sightseeing. In order to solve this optimization problem, an efficient Greedy Randomized Adaptive Search Procedure is developed to obtain high-quality solutions. Enhanced solution construction mechanisms and bias functions used in construction mechanism have been proposed. The computational experiments indicate the solving scheme is able to report competitive solutions by using short computational times. © Springer International Publishing Switzerland 2016.},\n\tlanguage = {English},\n\tjournal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},\n\tauthor = {Expósito, A. and Brito, J. and Moreno, J.A.},\n\teditor = {Barrenechea E., Troncoso A., Gamez J.A., Luaces O., Quintian H., Corchado E., Galar M.},\n\tyear = {2016},\n\tkeywords = {Artificial intelligence, Computational experiment, Computational time, Design problems, Greedy randomized adaptive search procedure, Heuristic algorithms, High-quality solutions, Optimization, Optimization approach, Optimization problems, Problem solving, Team orienteering problems},\n\tpages = {428--437}\n}\n\n","author_short":["Expósito, A.","Brito, J.","Moreno, J."],"editor_short":["Barrenechea E., T. A.","Gamez J.A., L. O.","Quintian H., C. E."],"key":"exposito_heuristic-biased_2016","id":"exposito_heuristic-biased_2016","bibbaseid":"expsito-brito-moreno-aheuristicbiasedgraspfortheteamorienteeringproblem-2016","role":"author","urls":{"Paper":"https://www2.scopus.com/inward/record.uri?eid=2-s2.0-84988568992&doi=10.1007%2f978-3-319-44636-3_40&partnerID=40&md5=4acc4c302b13aca899807dd3de4c6a8e"},"keyword":["Artificial intelligence","Computational experiment","Computational time","Design problems","Greedy randomized adaptive search procedure","Heuristic algorithms","High-quality solutions","Optimization","Optimization approach","Optimization problems","Problem solving","Team orienteering problems"],"downloads":0,"html":""},"bibtype":"article","biburl":"https://bibbase.org/zotero/CatedraTurismo","creationDate":"2019-09-20T12:17:31.062Z","downloads":0,"keywords":["artificial intelligence","computational experiment","computational time","design problems","greedy randomized adaptive search procedure","heuristic algorithms","high-quality solutions","optimization","optimization approach","optimization problems","problem solving","team orienteering problems"],"search_terms":["heuristic","biased","grasp","team","orienteering","problem","expósito","brito","moreno"],"title":"A heuristic-biased GRASP for the team orienteering problem","year":2016,"dataSources":["rhepw38fMQQBcofug"]}