{"id":"https://openalex.org/W2767313359","doi":"https://doi.org/10.1109/tii.2017.2772314","title":"Drilling Path Optimization by Optimal Foraging Algorithm","display_name":"Drilling Path Optimization by Optimal Foraging Algorithm","publication_year":2017,"publication_date":"2017-11-10","ids":{"openalex":"https://openalex.org/W2767313359","doi":"https://doi.org/10.1109/tii.2017.2772314","mag":"2767313359"},"language":"en","primary_location":{"id":"doi:10.1109/tii.2017.2772314","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tii.2017.2772314","pdf_url":null,"source":{"id":"https://openalex.org/S184777250","display_name":"IEEE Transactions on Industrial Informatics","issn_l":"1551-3203","issn":["1551-3203","1941-0050"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Industrial Informatics","raw_type":"journal-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/A5002571994","display_name":"Weibo Zhang","orcid":"https://orcid.org/0000-0002-1850-9695"},"institutions":[{"id":"https://openalex.org/I80947539","display_name":"Fuzhou University","ror":"https://ror.org/011xvna82","country_code":"CN","type":"education","lineage":["https://openalex.org/I80947539"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Wei-Bo Zhang","raw_affiliation_strings":["School of Mechanical Engineering and Automation, Fuzhou University, Fuzhou, China"],"raw_orcid":"https://orcid.org/0000-0002-1850-9695","affiliations":[{"raw_affiliation_string":"School of Mechanical Engineering and Automation, Fuzhou University, Fuzhou, China","institution_ids":["https://openalex.org/I80947539"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002438391","display_name":"Guangyu Zhu","orcid":"https://orcid.org/0000-0002-4468-258X"},"institutions":[{"id":"https://openalex.org/I80947539","display_name":"Fuzhou University","ror":"https://ror.org/011xvna82","country_code":"CN","type":"education","lineage":["https://openalex.org/I80947539"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Guang-Yu Zhu","raw_affiliation_strings":["School of Mechanical Engineering and Automation, Fuzhou University, Fuzhou, China"],"raw_orcid":"https://orcid.org/0000-0002-4468-258X","affiliations":[{"raw_affiliation_string":"School of Mechanical Engineering and Automation, Fuzhou University, Fuzhou, China","institution_ids":["https://openalex.org/I80947539"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.0654,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.90418216,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":"14","issue":"7","first_page":"2847","last_page":"2856"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.991100013256073,"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"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.991100013256073,"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/T11451","display_name":"Advanced Machining and Optimization Techniques","score":0.9702000021934509,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T10892","display_name":"Drilling and Well Engineering","score":0.9603999853134155,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean 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/foraging","display_name":"Foraging","score":0.7160718441009521},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6354133486747742},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.6068841814994812},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5704196691513062},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.49814534187316895},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4807184040546417},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4607059061527252},{"id":"https://openalex.org/keywords/optimization-algorithm","display_name":"Optimization algorithm","score":0.45594653487205505},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4467664957046509},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.296975314617157}],"concepts":[{"id":"https://openalex.org/C165287380","wikidata":"https://www.wikidata.org/wiki/Q2916569","display_name":"Foraging","level":2,"score":0.7160718441009521},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6354133486747742},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6068841814994812},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5704196691513062},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.49814534187316895},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4807184040546417},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4607059061527252},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.45594653487205505},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4467664957046509},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.296975314617157},{"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tii.2017.2772314","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tii.2017.2772314","pdf_url":null,"source":{"id":"https://openalex.org/S184777250","display_name":"IEEE Transactions on Industrial Informatics","issn_l":"1551-3203","issn":["1551-3203","1941-0050"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Industrial Informatics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W752423611","https://openalex.org/W1573676079","https://openalex.org/W1587368679","https://openalex.org/W1658209567","https://openalex.org/W1966898133","https://openalex.org/W1969915433","https://openalex.org/W1972427458","https://openalex.org/W1978402922","https://openalex.org/W1981042566","https://openalex.org/W1982100856","https://openalex.org/W1984132513","https://openalex.org/W1994575321","https://openalex.org/W2000503930","https://openalex.org/W2012169285","https://openalex.org/W2012647368","https://openalex.org/W2024336213","https://openalex.org/W2024784427","https://openalex.org/W2043624414","https://openalex.org/W2061594663","https://openalex.org/W2073240809","https://openalex.org/W2077831477","https://openalex.org/W2079292796","https://openalex.org/W2083996043","https://openalex.org/W2087369095","https://openalex.org/W2094950826","https://openalex.org/W2115276342","https://openalex.org/W2128337573","https://openalex.org/W2130506204","https://openalex.org/W2133287603","https://openalex.org/W2166113101","https://openalex.org/W2179251960","https://openalex.org/W2187150571","https://openalex.org/W2315741365","https://openalex.org/W2319924983","https://openalex.org/W2325717136","https://openalex.org/W2335790046","https://openalex.org/W2507510427","https://openalex.org/W2560577126","https://openalex.org/W2997069243","https://openalex.org/W4292083457","https://openalex.org/W6679853806","https://openalex.org/W6703053016","https://openalex.org/W6771943047"],"related_works":["https://openalex.org/W4200081355","https://openalex.org/W2135179174","https://openalex.org/W1932300341","https://openalex.org/W2294784349","https://openalex.org/W3081944365","https://openalex.org/W2073248645","https://openalex.org/W3212179065","https://openalex.org/W2184070258","https://openalex.org/W3087997050","https://openalex.org/W2348923905"],"abstract_inverted_index":{"Drilling":[0],"path":[1],"optimization":[2,16,68,74],"(DPO)":[3],"is":[4,24,47,70,94,100,138],"a":[5,72,89,141],"crucial":[6],"issue":[7],"in":[8,107],"current":[9],"manufacturing":[10],"systems.":[11],"In":[12],"this":[13,45],"paper,":[14],"an":[15],"algorithm":[17,22],"named":[18],"the":[19,33,50,60,65,81,115,118,124,131],"optimal":[20,28,51,116],"foraging":[21,29],"(OFA)":[23],"presented":[25],"based":[26],"on":[27],"theory":[30],"to":[31,48,58],"solve":[32],"sequencing":[34],"problem":[35,69],"when":[36],"many":[37],"holes":[38],"must":[39],"be":[40],"drilled.":[41],"The":[42,96,112],"objective":[43],"of":[44,53,92,98],"study":[46],"identify":[49],"sequence":[52,67],"drilling":[54,66],"operations":[55],"using":[56],"OFA":[57,93,99,129,137],"minimize":[59],"total":[61],"processing":[62],"cost.":[63],"Since":[64],"considered":[71],"discrete":[73,90],"problem,":[75],"five":[76,109],"operators":[77],"that":[78,128],"can":[79],"address":[80],"integer-encoding":[82],"vector":[83],"are":[84],"built":[85],"for":[86,144],"OFA;":[87],"thus,":[88],"version":[91],"presented.":[95],"performance":[97],"evaluated":[101],"against":[102],"four":[103],"other":[104],"baseline":[105],"algorithms":[106],"solving":[108,145],"real-world":[110],"problems.":[111,147],"results,":[113],"including":[114],"solutions,":[117],"Kruskal-Wallis":[119],"test,":[120],"CPU":[121],"time":[122],"and":[123],"evolution":[125],"curves,":[126],"demonstrate":[127],"improves":[130],"solution":[132],"by":[133],"minimizing":[134],"nonproductive":[135],"time.":[136],"verified":[139],"as":[140],"feasible":[142],"method":[143],"DPO":[146]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}