{"id":"https://openalex.org/W2954289276","doi":"https://doi.org/10.1145/3321707.3321764","title":"Adaptive large neighborhood search for scheduling of mobile robots","display_name":"Adaptive large neighborhood search for scheduling of mobile robots","publication_year":2019,"publication_date":"2019-07-03","ids":{"openalex":"https://openalex.org/W2954289276","doi":"https://doi.org/10.1145/3321707.3321764","mag":"2954289276"},"language":"en","primary_location":{"id":"doi:10.1145/3321707.3321764","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3321707.3321764","pdf_url":null,"source":{"id":"https://openalex.org/S4363608932","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference","raw_type":"proceedings-article"},"type":"conference-paper","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/A5074370419","display_name":"Quang-Vinh Dang","orcid":"https://orcid.org/0000-0001-9838-5073"},"institutions":[{"id":"https://openalex.org/I21449261","display_name":"Masaryk University","ror":"https://ror.org/02j46qs45","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21449261"]},{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["CZ","NL"],"is_corresponding":false,"raw_author_name":"Quang-Vinh Dang","raw_affiliation_strings":["Masaryk University, Czech Republic and Eindhoven University of Technology, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Masaryk University, Czech Republic and Eindhoven University of Technology, The Netherlands","institution_ids":["https://openalex.org/I21449261","https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063434417","display_name":"Hana Rudov\u00e1","orcid":"https://orcid.org/0000-0002-6410-4250"},"institutions":[{"id":"https://openalex.org/I21449261","display_name":"Masaryk University","ror":"https://ror.org/02j46qs45","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21449261"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Hana Rudov\u00e1","raw_affiliation_strings":["Faculty of Informatics, Masaryk University, Czech Republic"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Informatics, Masaryk University, Czech Republic","institution_ids":["https://openalex.org/I21449261"]}]},{"author_position":"last","author":{"id":null,"display_name":"Cong Thanh Nguyen","orcid":null},"institutions":[{"id":"https://openalex.org/I47265099","display_name":"Ho Chi Minh City University of Technology","ror":"https://ror.org/04qva2324","country_code":"VN","type":"education","lineage":["https://openalex.org/I123565023","https://openalex.org/I47265099"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Cong Thanh Nguyen","raw_affiliation_strings":["Ho Chi Minh City University of Technology, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ho Chi Minh City University of Technology, Vietnam","institution_ids":["https://openalex.org/I47265099"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8183,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.65762152,"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":"224","last_page":"232"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9995999932289124,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9995999932289124,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9976000189781189,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9958999752998352,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6824943423271179},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6778366565704346},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6498386263847351},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.6492205858230591},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.6422214508056641},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5965015292167664},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4644619822502136},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.44357240200042725},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.4248083233833313},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.42447420954704285},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.34159475564956665},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.15273213386535645},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11451438069343567}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6824943423271179},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6778366565704346},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6498386263847351},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.6492205858230591},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.6422214508056641},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5965015292167664},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4644619822502136},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.44357240200042725},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4248083233833313},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.42447420954704285},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.34159475564956665},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.15273213386535645},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11451438069343567},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","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},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/3321707.3321764","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3321707.3321764","pdf_url":null,"source":{"id":"https://openalex.org/S4363608932","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/6ba2d7cf-56ff-43c7-bf48-0e9a8eeceae3","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/6ba2d7cf-56ff-43c7-bf48-0e9a8eeceae3","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Dang, Q-V, Rudov\u00e1, H & Nguyen, C T 2019, Adaptive large neighborhood search for scheduling of mobile robots. in GECCO 2019 - Proceedings of the 2019 Genetic and Evolutionary Computation Conference. Association for Computing Machinery, Inc., New York, pp. 224-232, 2019 Genetic and Evolutionary Computation Conference, GECCO 2019, Prague, Czech Republic, 13/07/19. https://doi.org/10.1145/3321707.3321764","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:915814","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=915814","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null},{"id":"pmh:oai:library.tue.nl:915814","is_oa":false,"landing_page_url":"http://repository.tue.nl/915814","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null},{"id":"pmh:tue:oai:pure.tue.nl:publications/6ba2d7cf-56ff-43c7-bf48-0e9a8eeceae3","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/6ba2d7cf-56ff-43c7-bf48-0e9a8eeceae3","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"GECCO 2019 - Proceedings of the 2019 Genetic and Evolutionary Computation Conference, 224 - 232","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.4399999976158142,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W90049316","https://openalex.org/W881669294","https://openalex.org/W2018545447","https://openalex.org/W2025861353","https://openalex.org/W2030370304","https://openalex.org/W2041845222","https://openalex.org/W2049752692","https://openalex.org/W2058419034","https://openalex.org/W2064563962","https://openalex.org/W2092994132","https://openalex.org/W2105002757","https://openalex.org/W2116577034","https://openalex.org/W2131578032","https://openalex.org/W2342839992","https://openalex.org/W2462490566","https://openalex.org/W2593221340","https://openalex.org/W2605409691","https://openalex.org/W2613364463","https://openalex.org/W2754721836","https://openalex.org/W2755898715","https://openalex.org/W2793500810","https://openalex.org/W2805028331","https://openalex.org/W2888963186","https://openalex.org/W4238780727"],"related_works":["https://openalex.org/W3177062893","https://openalex.org/W3125143773","https://openalex.org/W2007032764","https://openalex.org/W803550684","https://openalex.org/W2483226803","https://openalex.org/W4352977312","https://openalex.org/W2041180560","https://openalex.org/W4206466499","https://openalex.org/W1603713238","https://openalex.org/W4213379045"],"abstract_inverted_index":{"Our":[0],"work":[1,48],"addresses":[2],"the":[3,35,39,82,88,97,107,116,126,169],"scheduling":[4],"of":[5,12,78,99,109,131,165],"mobile":[6,22,43],"robots":[7,23,44],"for":[8,58,85,91],"transportation":[9],"and":[10,24,87,111,143],"processing":[11],"operations":[13,79],"on":[14,80,125,140],"machines":[15,33],"in":[16,34,46,158,163],"a":[17,76,137],"flexible":[18],"manufacturing":[19],"system.":[20],"Both":[21],"automated":[25],"guided":[26],"vehicles":[27],"(AGVs)":[28],"can":[29,49,154],"transport":[30],"components":[31],"among":[32],"working":[36],"space.":[37],"Nevertheless,":[38],"difference":[40],"is":[41,55,96,123,134,162],"that":[42,151],"considered":[45],"this":[47],"process":[50],"specific":[51],"value-added":[52],"operations,":[53],"which":[54,161],"not":[56],"possible":[57],"AGVs.":[59],"This":[60],"new":[61],"feature":[62],"increases":[63],"complexity":[64],"as":[65,67],"well":[66],"computational":[68],"demands.":[69],"To":[70],"summarize,":[71],"we":[72],"need":[73],"to":[74,114,136],"compute":[75],"sequence":[77],"machines,":[81],"robot":[83,89],"assignments":[84,90],"transportation,":[86],"processing.":[92],"The":[93,129,148],"main":[94],"contribution":[95],"proposal":[98],"an":[100],"adaptive":[101],"large":[102],"neighborhood":[103],"search":[104],"algorithm":[105,142],"with":[106],"sets":[108],"exploration":[110],"exploitation":[112],"heuristics":[113],"solve":[115],"problem":[117],"considering":[118],"makespan":[119],"minimization.":[120],"Experimental":[121],"evaluation":[122],"presented":[124],"existing":[127],"benchmarks.":[128],"quality":[130],"our":[132,152],"solutions":[133],"compared":[135],"heuristic":[138],"based":[139],"genetic":[141],"mixed-integer":[144],"programming":[145],"proposed":[146],"recently.":[147],"comparison":[149],"shows":[150],"approach":[153],"achieve":[155],"comparable":[156],"results":[157],"real":[159],"time":[160],"order":[164],"magnitude":[166],"faster":[167],"than":[168],"earlier":[170],"heuristic.1":[171]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-08-28T12:50:07.497085","created_date":"2025-10-10T00:00:00"}