{"id":"https://openalex.org/W2901038591","doi":"https://doi.org/10.1109/ic3.2018.8530523","title":"Recommending Optimal Tour for Groups Using Ant Colony Optimization","display_name":"Recommending Optimal Tour for Groups Using Ant Colony Optimization","publication_year":2018,"publication_date":"2018-08-01","ids":{"openalex":"https://openalex.org/W2901038591","doi":"https://doi.org/10.1109/ic3.2018.8530523","mag":"2901038591"},"language":"en","primary_location":{"id":"doi:10.1109/ic3.2018.8530523","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ic3.2018.8530523","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 Eleventh International Conference on Contemporary Computing (IC3)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5113854302","display_name":"Parul Hgarwal","orcid":null},"institutions":[{"id":"https://openalex.org/I154970844","display_name":"Jaypee Institute of Information Technology","ror":"https://ror.org/05sttyy11","country_code":"IN","type":"education","lineage":["https://openalex.org/I154970844"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Parul Hgarwal","raw_affiliation_strings":["Department of Computer Science and Information Technology, Jaypee Institute of Information Technology, Noida, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Technology, Jaypee Institute of Information Technology, Noida, India","institution_ids":["https://openalex.org/I154970844"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076837789","display_name":"Mayank Sourabh","orcid":null},"institutions":[{"id":"https://openalex.org/I154970844","display_name":"Jaypee Institute of Information Technology","ror":"https://ror.org/05sttyy11","country_code":"IN","type":"education","lineage":["https://openalex.org/I154970844"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Mayank Sourabh","raw_affiliation_strings":["Department of Computer Science and Information Technology, Jaypee Institute of Information Technology, Noida, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Technology, Jaypee Institute of Information Technology, Noida, India","institution_ids":["https://openalex.org/I154970844"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069528934","display_name":"Rishabh Sachdeva","orcid":null},"institutions":[{"id":"https://openalex.org/I154970844","display_name":"Jaypee Institute of Information Technology","ror":"https://ror.org/05sttyy11","country_code":"IN","type":"education","lineage":["https://openalex.org/I154970844"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Rishabh Sachdeva","raw_affiliation_strings":["Department of Computer Science and Information Technology, Jaypee Institute of Information Technology, Noida, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Technology, Jaypee Institute of Information Technology, Noida, India","institution_ids":["https://openalex.org/I154970844"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040250279","display_name":"Siddharh Sharma","orcid":null},"institutions":[{"id":"https://openalex.org/I154970844","display_name":"Jaypee Institute of Information Technology","ror":"https://ror.org/05sttyy11","country_code":"IN","type":"education","lineage":["https://openalex.org/I154970844"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Siddharh Sharma","raw_affiliation_strings":["Department of Computer Science and Information Technology, Jaypee Institute of Information Technology, Noida, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Technology, Jaypee Institute of Information Technology, Noida, India","institution_ids":["https://openalex.org/I154970844"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078384737","display_name":"Shikha Mehta","orcid":"https://orcid.org/0000-0002-2601-6284"},"institutions":[{"id":"https://openalex.org/I154970844","display_name":"Jaypee Institute of Information Technology","ror":"https://ror.org/05sttyy11","country_code":"IN","type":"education","lineage":["https://openalex.org/I154970844"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Shikha Mehta","raw_affiliation_strings":["Department of Computer Science and Information Technology, Jaypee Institute of Information Technology, Noida, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Technology, Jaypee Institute of Information Technology, Noida, India","institution_ids":["https://openalex.org/I154970844"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2524,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.66073772,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"223","issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9927999973297119,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7736376523971558},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.7271026372909546},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6353404521942139},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6206404566764832},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5763077139854431},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5409468412399292},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.5275076627731323},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5204794406890869},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.5031647086143494},{"id":"https://openalex.org/keywords/group","display_name":"Group (periodic table)","score":0.4903850555419922},{"id":"https://openalex.org/keywords/point-of-interest","display_name":"Point of interest","score":0.47831252217292786},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.44359785318374634},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.34977737069129944},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.32244372367858887},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2703530490398407},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.22537383437156677},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.14335712790489197},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.0694878101348877}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7736376523971558},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.7271026372909546},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6353404521942139},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6206404566764832},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5763077139854431},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5409468412399292},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.5275076627731323},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5204794406890869},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.5031647086143494},{"id":"https://openalex.org/C2781311116","wikidata":"https://www.wikidata.org/wiki/Q83306","display_name":"Group (periodic table)","level":2,"score":0.4903850555419922},{"id":"https://openalex.org/C150140777","wikidata":"https://www.wikidata.org/wiki/Q960648","display_name":"Point of interest","level":2,"score":0.47831252217292786},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.44359785318374634},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.34977737069129944},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.32244372367858887},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2703530490398407},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.22537383437156677},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.14335712790489197},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0694878101348877},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C178790620","wikidata":"https://www.wikidata.org/wiki/Q11351","display_name":"Organic chemistry","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ic3.2018.8530523","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ic3.2018.8530523","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 Eleventh International Conference on Contemporary Computing (IC3)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W39976709","https://openalex.org/W196039309","https://openalex.org/W1191297651","https://openalex.org/W1954404225","https://openalex.org/W2013205100","https://openalex.org/W2064702560","https://openalex.org/W2121985689","https://openalex.org/W2151239055","https://openalex.org/W2151526720","https://openalex.org/W2162750432","https://openalex.org/W2172118809","https://openalex.org/W2521036580","https://openalex.org/W2611791389","https://openalex.org/W6601578854","https://openalex.org/W6678219515","https://openalex.org/W6682552337"],"related_works":["https://openalex.org/W4385871958","https://openalex.org/W4245157707","https://openalex.org/W1997193297","https://openalex.org/W2208777194","https://openalex.org/W2908391583","https://openalex.org/W2369428395","https://openalex.org/W2406404685","https://openalex.org/W2981400081","https://openalex.org/W2353880500","https://openalex.org/W2553274123"],"abstract_inverted_index":{"Tour":[0],"recommendation":[1],"is":[2,61,78,140],"one":[3],"of":[4,8,36,53,58,67,70,84,132,145,168],"the":[5,34,41,51,65,85,91],"special":[6],"cases":[7],"travelling":[9],"salesman":[10],"problem.":[11,20],"Many":[12],"researchers":[13],"provided":[14],"near":[15,47],"optimal":[16,48,104],"solution":[17],"to":[18,29,33,45,63,102,177],"this":[19,100],"However,":[21],"literature":[22],"shows":[23],"that":[24,160],"tours":[25,49],"are":[26,97],"mainly":[27],"recommended":[28],"specific":[30],"persons":[31],"not":[32,120],"group":[35,52,86,119,150],"people.":[37,54],"This":[38],"paper":[39],"provides":[40],"different":[42],"algorithmic":[43,95],"approaches":[44],"give":[46],"for":[50,118],"For":[55],"such":[56],"type":[57],"problem,":[59],"it":[60],"essential":[62],"find":[64,103],"point":[66],"interest":[68],"(POI)":[69],"each":[71,133,146],"person":[72,134,147],"in":[73,99,148,154],"a":[74,141,149,155],"group.":[75],"The":[76],"problem":[77],"quite":[79],"intricate":[80],"because":[81],"all":[82],"people":[83],"should":[87],"be":[88],"satisfied":[89],"from":[90,135,151],"tour":[92,117,136],"obtained.":[93,137],"Four":[94],"implications":[96],"adopted":[98],"work":[101],"tours-exhaustive":[105],"search,":[106],"greedy":[107],"algorithm,":[108],"dynamic":[109],"programming":[110],"and":[111,172],"ant":[112],"colony":[113],"optimization":[114],"(ACO).":[115],"Optimal":[116],"only":[121],"means":[122],"shortest":[123],"length":[124],"path":[125],"(total":[126],"cost)":[127],"but":[128],"also":[129],"satisfaction":[130,173],"value":[131,139,171,174],"Satisfaction":[138],"like":[142],"or":[143],"dislike":[144],"POIs":[152],"considered":[153],"tour.":[156],"It":[157],"was":[158],"observed":[159],"ACO":[161],"provide":[162],"better":[163,166],"results":[164],"i.e.":[165],"combination":[167],"total":[169],"cost":[170],"as":[175],"compared":[176],"other":[178],"algorithms.":[179]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}