{"id":"https://openalex.org/W2288431672","doi":"https://doi.org/10.1109/taai.2015.7407081","title":"The new crossover operators and a novel combination of crossover operators for solving Linear Ordering Problem","display_name":"The new crossover operators and a novel combination of crossover operators for solving Linear Ordering Problem","publication_year":2015,"publication_date":"2015-11-01","ids":{"openalex":"https://openalex.org/W2288431672","doi":"https://doi.org/10.1109/taai.2015.7407081","mag":"2288431672"},"language":"en","primary_location":{"id":"doi:10.1109/taai.2015.7407081","is_oa":false,"landing_page_url":"https://doi.org/10.1109/taai.2015.7407081","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 Conference on Technologies and Applications of Artificial Intelligence (TAAI)","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":null,"display_name":"Dinh Thanh Pham","orcid":null},"institutions":[{"id":"https://openalex.org/I4210139842","display_name":"Tay Bac University","ror":"https://ror.org/04j5g5g52","country_code":"VN","type":"education","lineage":["https://openalex.org/I4210139842"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Dinh Thanh Pham","raw_affiliation_strings":["Taybac University, Sonla, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Taybac University, Sonla, Vietnam","institution_ids":["https://openalex.org/I4210139842"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074202712","display_name":"Thi Thanh Binh Huynh","orcid":null},"institutions":[{"id":"https://openalex.org/I94518387","display_name":"Hanoi University of Science and Technology","ror":"https://ror.org/04nyv3z04","country_code":"VN","type":"education","lineage":["https://openalex.org/I94518387"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Thi Thanh Binh Huynh","raw_affiliation_strings":["Hanoi University of Science and Technology, Hanoi, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hanoi University of Science and Technology, Hanoi, Vietnam","institution_ids":["https://openalex.org/I94518387"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080327728","display_name":"Quang Manh Nguyen","orcid":null},"institutions":[{"id":"https://openalex.org/I94518387","display_name":"Hanoi University of Science and Technology","ror":"https://ror.org/04nyv3z04","country_code":"VN","type":"education","lineage":["https://openalex.org/I94518387"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Quang Manh Nguyen","raw_affiliation_strings":["Hanoi University of Science and Technology, Hanoi, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hanoi University of Science and Technology, Hanoi, Vietnam","institution_ids":["https://openalex.org/I94518387"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.10302726,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"54","issue":null,"first_page":"150","last_page":"157"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9984999895095825,"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.9984999895095825,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9569000005722046,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9345999956130981,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.9692442417144775},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5413295030593872},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5042375326156616},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4911901652812958},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46807798743247986},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4433787167072296},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.20418643951416016}],"concepts":[{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.9692442417144775},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5413295030593872},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5042375326156616},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4911901652812958},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46807798743247986},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4433787167072296},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20418643951416016}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/taai.2015.7407081","is_oa":false,"landing_page_url":"https://doi.org/10.1109/taai.2015.7407081","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 Conference on Technologies and Applications of Artificial Intelligence (TAAI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W188269987","https://openalex.org/W1512964191","https://openalex.org/W1979519377","https://openalex.org/W2001020288","https://openalex.org/W2043611919","https://openalex.org/W2045967996","https://openalex.org/W2063980384","https://openalex.org/W2072268707","https://openalex.org/W2098677716","https://openalex.org/W2139820193","https://openalex.org/W2169540172","https://openalex.org/W2264039486","https://openalex.org/W2489850449","https://openalex.org/W2511272593","https://openalex.org/W4245358595"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2347477706","https://openalex.org/W1943663474","https://openalex.org/W4299389082","https://openalex.org/W2306830238","https://openalex.org/W2110294633","https://openalex.org/W1829715381","https://openalex.org/W2962747841","https://openalex.org/W2630967916","https://openalex.org/W2014162767"],"abstract_inverted_index":{"The":[0],"Linear":[1],"Ordering":[2],"Problem":[3],"(LOP)":[4],"is":[5,67],"a":[6,27],"well-known":[7],"NP-Hard":[8],"problem":[9],"and":[10,26,46],"has":[11],"many":[12],"applications":[13],"in":[14,32],"various":[15],"fields.":[16],"In":[17],"this":[18],"paper,":[19],"we":[20],"propose":[21],"two":[22],"new":[23],"crossover":[24,30,58],"operators":[25,31],"novel":[28],"combination":[29],"Genetic":[33],"Algorithm":[34],"(GA)":[35],"for":[36],"solving":[37],"LOP.":[38],"We":[39],"experimented":[40],"on":[41,72],"LOP":[42],"instances":[43],"from":[44],"XLOLIB":[45],"compared":[47],"the":[48,51,70,73],"results":[49,61],"of":[50],"proposed":[52,65],"algorithm":[53,66],"with":[54],"GA":[55],"using":[56],"other":[57],"operators.":[59],"Experimental":[60],"show":[62],"that,":[63],"our":[64],"better":[68],"than":[69],"ones":[71],"maximum,":[74],"mean":[75],"cost":[76],"values.":[77]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}