{"id":"https://openalex.org/W1970981728","doi":"https://doi.org/10.1057/palgrave.jors.2601269","title":"Local search algorithms for the min-max loop layout problem","display_name":"Local search algorithms for the min-max loop layout problem","publication_year":2002,"publication_date":"2002-10-01","ids":{"openalex":"https://openalex.org/W1970981728","doi":"https://doi.org/10.1057/palgrave.jors.2601269","mag":"1970981728"},"language":"en","primary_location":{"id":"doi:10.1057/palgrave.jors.2601269","is_oa":false,"landing_page_url":"https://doi.org/10.1057/palgrave.jors.2601269","pdf_url":null,"source":{"id":"https://openalex.org/S169988927","display_name":"Journal of the Operational Research Society","issn_l":"0160-5682","issn":["0160-5682","1476-9360"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319703","host_organization_name":"Palgrave Macmillan","host_organization_lineage":["https://openalex.org/P4310319703","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Palgrave Macmillan","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Operational Research Society","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/A5074830203","display_name":"Julia A. Bennell","orcid":"https://orcid.org/0000-0002-5338-2247"},"institutions":[{"id":"https://openalex.org/I43439940","display_name":"University of Southampton","ror":"https://ror.org/01ryk1543","country_code":"GB","type":"education","lineage":["https://openalex.org/I43439940"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"J A Bennell","raw_affiliation_strings":["University of Southampton Southampton UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Southampton Southampton UK","institution_ids":["https://openalex.org/I43439940"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110115423","display_name":"Chris N. Potts","orcid":null},"institutions":[{"id":"https://openalex.org/I43439940","display_name":"University of Southampton","ror":"https://ror.org/01ryk1543","country_code":"GB","type":"education","lineage":["https://openalex.org/I43439940"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"C N Potts","raw_affiliation_strings":["University of Southampton Southampton UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Southampton Southampton UK","institution_ids":["https://openalex.org/I43439940"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072195108","display_name":"J. D. Whitehead","orcid":null},"institutions":[{"id":"https://openalex.org/I43439940","display_name":"University of Southampton","ror":"https://ror.org/01ryk1543","country_code":"GB","type":"education","lineage":["https://openalex.org/I43439940"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"J D Whitehead","raw_affiliation_strings":["University of Southampton Southampton UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Southampton Southampton UK","institution_ids":["https://openalex.org/I43439940"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I43439940"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.15927472,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"53","issue":"10","first_page":"1109","last_page":"1117"},"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.9998000264167786,"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.9998000264167786,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9998000264167786,"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.9966999888420105,"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/tabu-search","display_name":"Tabu search","score":0.7100626230239868},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6594722270965576},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6127768158912659},{"id":"https://openalex.org/keywords/hill-climbing","display_name":"Hill climbing","score":0.6018964052200317},{"id":"https://openalex.org/keywords/iterated-local-search","display_name":"Iterated local search","score":0.5913240909576416},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5236884355545044},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.5168212056159973},{"id":"https://openalex.org/keywords/loop","display_name":"Loop (graph theory)","score":0.5039111971855164},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.5022842884063721},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.46362045407295227},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4436604380607605},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4291669726371765},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.30626583099365234},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28444305062294006}],"concepts":[{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.7100626230239868},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6594722270965576},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6127768158912659},{"id":"https://openalex.org/C135450995","wikidata":"https://www.wikidata.org/wiki/Q820272","display_name":"Hill climbing","level":2,"score":0.6018964052200317},{"id":"https://openalex.org/C124145224","wikidata":"https://www.wikidata.org/wiki/Q6094397","display_name":"Iterated local search","level":3,"score":0.5913240909576416},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5236884355545044},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.5168212056159973},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.5039111971855164},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.5022842884063721},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.46362045407295227},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4436604380607605},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4291669726371765},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.30626583099365234},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28444305062294006},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1057/palgrave.jors.2601269","is_oa":false,"landing_page_url":"https://doi.org/10.1057/palgrave.jors.2601269","pdf_url":null,"source":{"id":"https://openalex.org/S169988927","display_name":"Journal of the Operational Research Society","issn_l":"0160-5682","issn":["0160-5682","1476-9360"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319703","host_organization_name":"Palgrave Macmillan","host_organization_lineage":["https://openalex.org/P4310319703","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Palgrave Macmillan","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Operational Research Society","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:pal:jorsoc:v:53:y:2002:i:10:d:10.1057_palgrave.jors.2601269","is_oa":false,"landing_page_url":"http://link.springer.com/10.1057/palgrave.jors.2601269","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},{"id":"pmh:oai:eprints.soton.ac.uk:35781","is_oa":false,"landing_page_url":"https://eprints.soton.ac.uk/35781/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401020","display_name":"ePrints Soton (University of Southampton)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I43439940","host_organization_name":"University of Southampton","host_organization_lineage":["https://openalex.org/I43439940"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W89068525","https://openalex.org/W1517590633","https://openalex.org/W1586365479","https://openalex.org/W2014136132","https://openalex.org/W2040758941","https://openalex.org/W2079699733","https://openalex.org/W2083878823","https://openalex.org/W2086809861","https://openalex.org/W2139910732","https://openalex.org/W2339500526"],"related_works":["https://openalex.org/W4237368524","https://openalex.org/W2535266198","https://openalex.org/W1533229056","https://openalex.org/W2123829500","https://openalex.org/W90886653","https://openalex.org/W1548986920","https://openalex.org/W4252370918","https://openalex.org/W2045456468","https://openalex.org/W3003450854","https://openalex.org/W2885371939"],"abstract_inverted_index":{"In":[0],"the":[1,20,23,28,46,50,57,62,65,70,114,135],"min-max":[2],"loop":[3,13],"layout":[4],"problem,":[5],"machines":[6,21,47],"are":[7,125],"to":[8,32,41,113,134,145,168],"be":[9,169],"arranged":[10],"around":[11],"a":[12,88,104,110,117,146],"of":[14,19,25,27,35,45,53,59,61,72,76,93,100,116,148],"conveyor":[15,29],"belt.":[16],"The":[17,38,121],"ordering":[18,44],"dictates":[22],"number":[24,52],"circuits":[26,54],"belt":[30],"required":[31,55],"manufacture":[33,58],"each":[34],"several":[36],"products.":[37,63],"goal":[39],"is":[40,67,75],"find":[42],"an":[43],"that":[48,98,108,137],"minimises":[49],"maximum":[51],"for":[56],"any":[60],"Since":[64],"problem":[66],"strongly":[68],"NP-hard,":[69],"study":[71],"heuristic":[73,112],"methods":[74],"interest.":[77],"This":[78,130],"paper":[79],"proposes":[80],"iterated":[81,128,138,159],"descent":[82,139,160],"and":[83,87],"tabu":[84],"search":[85,157],"algorithms,":[86,158],"randomised":[89],"insertion":[90],"algorithm.":[91],"Results":[92],"extensive":[94],"computational":[95],"tests":[96],"show":[97],"all":[99],"our":[101],"algorithms":[102],"outperform":[103],"previously":[105],"known":[106],"algorithm":[107],"applies":[109],"greedy":[111],"solution":[115],"linear":[118],"programming":[119],"relaxation.":[120],"best":[122],"quality":[123,143],"solutions":[124,144],"obtained":[126],"with":[127],"descent.":[129],"adds":[131],"further":[132],"evidence":[133],"belief":[136],"can":[140],"produce":[141],"high":[142],"variety":[147],"combinatorial":[149],"optimisation":[150],"problems.":[151],"Moreover,":[152],"unlike":[153],"some":[154],"other":[155],"local":[156],"does":[161],"not":[162],"require":[163],"much":[164],"tuning":[165],"in":[166],"order":[167],"competitive.":[170]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-02T09:51:11.867554","created_date":"2025-10-10T00:00:00"}