{"id":"https://openalex.org/W1487325680","doi":"https://doi.org/10.1109/mtits.2015.7223273","title":"Compare Ant-colony and Genetic algorithm for shortest path problem and introduce their parallel implementations","display_name":"Compare Ant-colony and Genetic algorithm for shortest path problem and introduce their parallel implementations","publication_year":2015,"publication_date":"2015-06-01","ids":{"openalex":"https://openalex.org/W1487325680","doi":"https://doi.org/10.1109/mtits.2015.7223273","mag":"1487325680"},"language":"en","primary_location":{"id":"doi:10.1109/mtits.2015.7223273","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mtits.2015.7223273","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 International Conference on Models and Technologies for Intelligent Transportation Systems (MT-ITS)","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/A5084426923","display_name":"G\u00e9za Katona","orcid":null},"institutions":[{"id":"https://openalex.org/I29770179","display_name":"Budapest University of Technology and Economics","ror":"https://ror.org/02w42ss30","country_code":"HU","type":"education","lineage":["https://openalex.org/I29770179"]}],"countries":["HU"],"is_corresponding":true,"raw_author_name":"Geza Katona","raw_affiliation_strings":["Budapesti Muszaki es Gazdasagtudomanyi Egyetem, Budapest, HU","Department of Transport Technology and Economics, Budapest University of Technology and Economics, Budapest, Hungary"],"affiliations":[{"raw_affiliation_string":"Budapesti Muszaki es Gazdasagtudomanyi Egyetem, Budapest, HU","institution_ids":["https://openalex.org/I29770179"]},{"raw_affiliation_string":"Department of Transport Technology and Economics, Budapest University of Technology and Economics, Budapest, Hungary","institution_ids":["https://openalex.org/I29770179"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061725467","display_name":"Bal\u00e1zs L\u00e9n\u00e1rt","orcid":null},"institutions":[{"id":"https://openalex.org/I29770179","display_name":"Budapest University of Technology and Economics","ror":"https://ror.org/02w42ss30","country_code":"HU","type":"education","lineage":["https://openalex.org/I29770179"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Balazs Lenart","raw_affiliation_strings":["Budapesti Muszaki es Gazdasagtudomanyi Egyetem, Budapest, HU","Department of Material Handling and Logistics Systems, Budapest University of Technology and Economics, Budapest, Hungary"],"affiliations":[{"raw_affiliation_string":"Budapesti Muszaki es Gazdasagtudomanyi Egyetem, Budapest, HU","institution_ids":["https://openalex.org/I29770179"]},{"raw_affiliation_string":"Department of Material Handling and Logistics Systems, Budapest University of Technology and Economics, Budapest, Hungary","institution_ids":["https://openalex.org/I29770179"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054190910","display_name":"J\u00e1nos Juh\u00e1sz","orcid":"https://orcid.org/0000-0001-6795-4181"},"institutions":[{"id":"https://openalex.org/I29770179","display_name":"Budapest University of Technology and Economics","ror":"https://ror.org/02w42ss30","country_code":"HU","type":"education","lineage":["https://openalex.org/I29770179"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Janos Juhasz","raw_affiliation_strings":["Budapesti Muszaki es Gazdasagtudomanyi Egyetem, Budapest, HU","Department of Transport Technology and Economics, Budapest University of Technology and Economics, Budapest, Hungary"],"affiliations":[{"raw_affiliation_string":"Budapesti Muszaki es Gazdasagtudomanyi Egyetem, Budapest, HU","institution_ids":["https://openalex.org/I29770179"]},{"raw_affiliation_string":"Department of Transport Technology and Economics, Budapest University of Technology and Economics, Budapest, Hungary","institution_ids":["https://openalex.org/I29770179"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5084426923"],"corresponding_institution_ids":["https://openalex.org/I29770179"],"apc_list":null,"apc_paid":null,"fwci":1.6861,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.87255857,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"312","last_page":"319"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9883999824523926,"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/T11106","display_name":"Data Management and Algorithms","score":0.988099992275238,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/computer-science","display_name":"Computer science","score":0.7639505863189697},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6942931413650513},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.664941132068634},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.6624788045883179},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5382859706878662},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5369313359260559},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.5051313042640686},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47693365812301636},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.424930214881897},{"id":"https://openalex.org/keywords/parallel-metaheuristic","display_name":"Parallel metaheuristic","score":0.42295101284980774},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.419310986995697},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2413589358329773},{"id":"https://openalex.org/keywords/meta-optimization","display_name":"Meta-optimization","score":0.22454679012298584},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.20032474398612976},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1471903920173645},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.10739630460739136}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7639505863189697},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6942931413650513},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.664941132068634},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.6624788045883179},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5382859706878662},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5369313359260559},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.5051313042640686},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47693365812301636},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.424930214881897},{"id":"https://openalex.org/C28767586","wikidata":"https://www.wikidata.org/wiki/Q7135006","display_name":"Parallel metaheuristic","level":4,"score":0.42295101284980774},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.419310986995697},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2413589358329773},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.22454679012298584},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.20032474398612976},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1471903920173645},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.10739630460739136},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/mtits.2015.7223273","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mtits.2015.7223273","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 International Conference on Models and Technologies for Intelligent Transportation Systems (MT-ITS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5299999713897705,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1492640216","https://openalex.org/W1968791396","https://openalex.org/W1996563556","https://openalex.org/W2001771035","https://openalex.org/W2051733931","https://openalex.org/W2060351246","https://openalex.org/W2090435272","https://openalex.org/W2118573797","https://openalex.org/W2145482038","https://openalex.org/W2184609577","https://openalex.org/W2463089998","https://openalex.org/W6663639580","https://openalex.org/W6686594559","https://openalex.org/W6719446479"],"related_works":["https://openalex.org/W2353880500","https://openalex.org/W2462483068","https://openalex.org/W4283826969","https://openalex.org/W2070079705","https://openalex.org/W2900531744","https://openalex.org/W2162125251","https://openalex.org/W2394153495","https://openalex.org/W2038644949","https://openalex.org/W2388217074","https://openalex.org/W2153418729"],"abstract_inverted_index":{"There":[0],"are":[1,12,69,75],"several":[2],"algorithms":[3],"which":[4],"calculates":[5],"shortest":[6],"path,":[7],"but":[8,93],"most":[9],"of":[10,64],"them":[11],"not":[13],"enough":[14],"fast,":[15],"effective":[16,77],"and":[17,43,54,78],"they":[18],"provide":[19],"only":[20],"one":[21,29],"solution.":[22],"Therefore":[23],"our":[24],"investigation":[25],"tries":[26],"to":[27,59,81],"find":[28,60],"alternative":[30],"algorithm":[31,46],"for":[32,50],"this":[33,36],"problem.":[34],"In":[35],"paper":[37],"it":[38,94],"is":[39],"described":[40],"how":[41],"Ant-colony":[42],"the":[44,61],"Genetic":[45],"can":[47],"be":[48,97],"applied":[49],"multimodal":[51],"transportation":[52],"systems":[53],"tests":[55],"have":[56],"been":[57,87],"made":[58],"best":[62],"parameters":[63],"these":[65,73],"methods.":[66],"Parallel":[67],"methods":[68,74],"being":[70],"introduced,":[71],"as":[72],"more":[76,79],"applicable":[80],"Cloud":[82],"based":[83],"systems.":[84],"It":[85],"has":[86],"simulated":[88],"in":[89,99],"a":[90,100],"multi-threaded":[91],"server":[92],"could":[95],"also":[96],"used":[98],"distributed":[101],"computing":[102],"system.":[103]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}