{"id":"https://openalex.org/W7135061062","doi":"https://doi.org/10.1109/access.2026.3672782","title":"Enhancing Scatter Search for the Linear Ordering Problem by Relaxation Adaptive Memory Programming","display_name":"Enhancing Scatter Search for the Linear Ordering Problem by Relaxation Adaptive Memory Programming","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7135061062","doi":"https://doi.org/10.1109/access.2026.3672782"},"language":"en","primary_location":{"id":"doi:10.1109/access.2026.3672782","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2026.3672782","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1109/access.2026.3672782","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5051866947","display_name":"C\u00e9sar Rego","orcid":"https://orcid.org/0000-0002-1713-2494"},"institutions":[{"id":"https://openalex.org/I368840534","display_name":"University of Mississippi","ror":"https://ror.org/02teq1165","country_code":"US","type":"education","lineage":["https://openalex.org/I368840534","https://openalex.org/I4210141039"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Cesar Rego","raw_affiliation_strings":["School of Business Administration, University of Mississippi, University, MS, USA"],"raw_orcid":"https://orcid.org/0000-0002-1713-2494","affiliations":[{"raw_affiliation_string":"School of Business Administration, University of Mississippi, University, MS, USA","institution_ids":["https://openalex.org/I368840534"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088875544","display_name":"Dorabela Gamboa","orcid":"https://orcid.org/0000-0002-8720-8597"},"institutions":[{"id":"https://openalex.org/I11193315","display_name":"Instituto Superior de Contabilidade e Administracao do Porto","ror":"https://ror.org/00wg3s094","country_code":"PT","type":"education","lineage":["https://openalex.org/I11193315"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Dorabela Gamboa","raw_affiliation_strings":["Center for Innovation and Research in Business Sciences and Information Systems (CIICESI), Escola Superior de Tecnologia e Gestão, Instituto Politécnico do Porto, Felgueiras, Portugal"],"raw_orcid":"https://orcid.org/0000-0002-8720-8597","affiliations":[{"raw_affiliation_string":"Center for Innovation and Research in Business Sciences and Information Systems (CIICESI), Escola Superior de Tecnologia e Gestão, Instituto Politécnico do Porto, Felgueiras, Portugal","institution_ids":["https://openalex.org/I11193315"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":1850,"currency":"USD","value_usd":1850},"apc_paid":{"value":1850,"currency":"USD","value_usd":1850},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.24975224,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"14","issue":null,"first_page":"43024","last_page":"43037"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.4668000042438507,"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.4668000042438507,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.15549999475479126,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.11699999868869781,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6499000191688538},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.628600001335144},{"id":"https://openalex.org/keywords/adaptive-memory","display_name":"Adaptive memory","score":0.621399998664856},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.6205999851226807},{"id":"https://openalex.org/keywords/lagrangian-relaxation","display_name":"Lagrangian relaxation","score":0.557699978351593},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.49810001254081726},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.4918000102043152},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.44679999351501465}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6848000288009644},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6499000191688538},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.628600001335144},{"id":"https://openalex.org/C30390489","wikidata":"https://www.wikidata.org/wiki/Q4680748","display_name":"Adaptive memory","level":3,"score":0.621399998664856},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.6205999851226807},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.557699978351593},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5288000106811523},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.49810001254081726},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.4918000102043152},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.44679999351501465},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4196999967098236},{"id":"https://openalex.org/C131584629","wikidata":"https://www.wikidata.org/wiki/Q4308705","display_name":"Coupling (piping)","level":2,"score":0.3695000112056732},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.3682999908924103},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.35199999809265137},{"id":"https://openalex.org/C167393769","wikidata":"https://www.wikidata.org/wiki/Q4680768","display_name":"Adaptive strategies","level":2,"score":0.34389999508857727},{"id":"https://openalex.org/C2776003309","wikidata":"https://www.wikidata.org/wiki/Q1988072","display_name":"Adaptive algorithm","level":2,"score":0.3312999904155731},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2919999957084656},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28610000014305115},{"id":"https://openalex.org/C52970973","wikidata":"https://www.wikidata.org/wiki/Q2497134","display_name":"Adaptive system","level":2,"score":0.265500009059906},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.26179999113082886},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.2581000030040741},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.25200000405311584},{"id":"https://openalex.org/C176649486","wikidata":"https://www.wikidata.org/wiki/Q2308807","display_name":"Memory management","level":3,"score":0.2506999969482422}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/access.2026.3672782","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2026.3672782","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:d22a1cf4a2e24adc8c84ce5d2669a3fc","is_oa":true,"landing_page_url":"https://doaj.org/article/d22a1cf4a2e24adc8c84ce5d2669a3fc","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","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":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Access, Vol 14, Pp 43024-43037 (2026)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1109/access.2026.3672782","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2026.3672782","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Relaxation":[0],"Adaptive":[1],"Memory":[2],"Programming":[3],"(RAMP)":[4],"provides":[5],"a":[6,25,30,41,59,87,104,132],"unified":[7],"framework":[8],"for":[9,35,173],"integrating":[10,94,174],"adaptive":[11,66,162,183],"memory":[12,163],"components":[13],"derived":[14],"from":[15,72],"both":[16,73],"primal":[17,176],"and":[18,63,96,116,127,169,177],"dual":[19,54,88,178],"searches":[20],"in":[21,58,165],"metaheuristics.":[22],"We":[23],"develop":[24],"RAMP":[26,77,111,141,159],"algorithm":[27,78,135],"to":[28,68,137,160],"enhance":[29],"state\u2011of\u2011the\u2011art":[31,134],"scatter":[32,84],"search":[33,85,89],"method":[34],"the":[36,156,181],"Linear":[37],"Ordering":[38],"Problem":[39],"(LOP),":[40],"classical":[42],"NP\u2011hard":[43],"problem":[44],"with":[45,86],"broad":[46],"practical":[47],"relevance.":[48],"Existing":[49],"LOP":[50,139],"heuristics":[51],"that":[52],"incorporate":[53],"information":[55],"use":[56],"it":[57],"fixed,":[60],"one\u2011directional":[61],"manner":[62],"lack":[64],"an":[65],"mechanism":[67],"combine":[69],"structural":[70],"insights":[71],"spaces.":[74],"The":[75],"proposed":[76],"addresses":[79],"this":[80],"limitation":[81],"by":[82],"coupling":[83],"based":[90],"on":[91],"cross\u2011parametric":[92],"relaxation,":[93],"surrogate":[95],"Lagrangian":[97],"relaxations":[98],"through":[99],"two":[100],"interacting":[101],"parameterizations.":[102],"On":[103],"standard":[105],"benchmark":[106],"library":[107],"of":[108,158],"224":[109],"instances,":[110,140],"consistently":[112],"improves":[113],"solution":[114],"quality":[115],"robustness,":[117],"producing":[118],"58":[119],"new":[120],"best":[121,145],"solutions":[122,146],"across":[123],"four":[124],"leading":[125],"algorithms":[126],"their":[128],"hybrid":[129],"variants.":[130],"Against":[131],"recent":[133],"tailored":[136],"large\u2011scale":[138],"matches":[142],"13":[143],"additional":[144],"while":[147],"requiring":[148],"substantially":[149],"less":[150],"computation":[151],"time.":[152],"These":[153],"results":[154],"demonstrate":[155],"potential":[157],"advance":[161],"strategies":[164],"complex":[166],"optimization":[167],"problems":[168],"suggest":[170],"broader":[171],"opportunities":[172],"alternative":[175],"mechanisms":[179],"within":[180],"same":[182],"bi\u2011directional":[184],"framework.":[185]},"counts_by_year":[],"updated_date":"2026-03-25T13:04:00.132906","created_date":"2026-03-13T00:00:00"}