{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T10:11:55Z","timestamp":1774519915147,"version":"3.50.1"},"reference-count":51,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:00:00Z","timestamp":1761609600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100005222","name":"Jyv\u00e4skyl\u00e4n Yliopisto","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100005222","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1016\/j.cor.2025.107321","type":"journal-article","created":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T07:32:01Z","timestamp":1761550321000},"page":"107321","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Linear formulations and a hybrid large neighborhood search algorithm for the tool indexing problem"],"prefix":"10.1016","volume":"186","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7492-5602","authenticated-orcid":false,"given":"Soumen","family":"Atta","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.cor.2025.107321_b1","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0166-218X(01)00338-9","article-title":"A survey of very large-scale neighborhood search techniques","volume":"123","author":"Ahuja","year":"2002","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.cor.2025.107321_b2","doi-asserted-by":"crossref","first-page":"2697","DOI":"10.1080\/00207540110051941","article-title":"Integrated scheduling and tool management in flexible manufacturing systems","volume":"39","author":"Akturk","year":"2001","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2025.107321_b3","doi-asserted-by":"crossref","first-page":"1508","DOI":"10.1016\/j.procir.2020.03.044","article-title":"Optimizing index positions on CNC tool magazines considering cutting tool life and duplicates","volume":"93","author":"Amouzgar","year":"2020","journal-title":"Procedia CIRP"},{"key":"10.1016\/j.cor.2025.107321_b4","doi-asserted-by":"crossref","first-page":"3572","DOI":"10.1080\/00207543.2021.1897174","article-title":"Multi-objective optimisation of tool indexing problem: a mathematical model and a modified genetic algorithm","volume":"59","author":"Amouzgar","year":"2021","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2025.107321_b5","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/j.disopt.2005.03.001","article-title":"A semidefinite optimization approach for the single-row layout problem with unequal dimensions","volume":"2","author":"Anjos","year":"2005","journal-title":"Discrete Optim."},{"key":"10.1016\/j.cor.2025.107321_b6","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1080\/10556780902917735","article-title":"Provably near-optimal solutions for very large single-row facility layout problems","volume":"24","author":"Anjos","year":"2009","journal-title":"Optim. Methods Softw."},{"key":"10.1016\/j.cor.2025.107321_b7","doi-asserted-by":"crossref","first-page":"1298","DOI":"10.1080\/0305215X.2023.2244907","article-title":"An improved harmony search algorithm using opposition-based learning and local search for solving the maximal covering location problem","volume":"56","author":"Atta","year":"2024","journal-title":"Eng. Optim."},{"key":"10.1016\/j.cor.2025.107321_b8","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1007\/s12065-025-01042-w","article-title":"Solving the capacitated facility location problem with service distance and outsourcing using a customized artificial bee colony algorithm","volume":"18","author":"Atta","year":"2025","journal-title":"Evol. Intell."},{"key":"10.1016\/j.cor.2025.107321_b9","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2021.115830","article-title":"A multi-objective formulation of maximal covering location problem with customers\u2019 preferences: Exploring Pareto optimality-based solutions","volume":"186","author":"Atta","year":"2021","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.cor.2025.107321_b10","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2022.108315","article-title":"Solving a new variant of the capacitated maximal covering location problem with fuzzy coverage area using metaheuristic approaches","volume":"170","author":"Atta","year":"2022","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2025.107321_b11","doi-asserted-by":"crossref","first-page":"1573","DOI":"10.1007\/s10489-019-01609-y","article-title":"Multiple allocation p-hub location problem for content placement in VoD services: a differential evolution based approach","volume":"50","author":"Atta","year":"2020","journal-title":"Appl. Intell."},{"key":"10.1016\/j.cor.2025.107321_b12","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2021.107432","article-title":"A new variant of the p-hub location problem with a ring backbone network for content placement in VoD services","volume":"159","author":"Atta","year":"2021","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2025.107321_b13","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1007\/s12046-019-1203-0","article-title":"Population-based improvement heuristic with local search for single-row facility layout problem","volume":"44","author":"Atta","year":"2019","journal-title":"S\u0101dhan\u0101"},{"key":"10.1016\/j.cor.2025.107321_b14","doi-asserted-by":"crossref","first-page":"3891","DOI":"10.1007\/s00500-017-2598-3","article-title":"Solving maximal covering location problem using genetic algorithm with local refinement","volume":"22","author":"Atta","year":"2018","journal-title":"Softw. Comput."},{"key":"10.1016\/j.cor.2025.107321_b15","doi-asserted-by":"crossref","first-page":"7407","DOI":"10.1007\/s00500-018-3385-5","article-title":"Solving tool indexing problem using harmony search algorithm with harmony refinement","volume":"23","author":"Atta","year":"2019","journal-title":"Softw. Comput."},{"key":"10.1016\/j.cor.2025.107321_b16","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1016\/0305-0548(96)00014-7","article-title":"Tool magazine arrangement and operations sequencing on CNC machines","volume":"23","author":"Avci","year":"1996","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2025.107321_b17","first-page":"1","article-title":"Performance analyses of weighted superposition attraction-repulsion algorithms in solving difficult optimization problems","author":"Baykaso\u011flu","year":"2024","journal-title":"Netw., Comput. Neural Syst."},{"key":"10.1016\/j.cor.2025.107321_b18","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1016\/j.asoc.2015.08.052","article-title":"Weighted Superposition Attraction (WSA): A swarm intelligence algorithm for optimization problems\u2013Part 2: Constrained optimization","volume":"37","author":"Baykaso\u011flu","year":"2015","journal-title":"Appl. Softw. Comput."},{"key":"10.1016\/j.cor.2025.107321_b19","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1016\/j.asoc.2015.10.036","article-title":"Weighted Superposition Attraction (WSA): A swarm intelligence algorithm for optimization problems\u2013Part 1: Unconstrained optimization","volume":"56","author":"Baykaso\u011flu","year":"2017","journal-title":"Appl. Softw. Comput."},{"key":"10.1016\/j.cor.2025.107321_b20","doi-asserted-by":"crossref","first-page":"1281","DOI":"10.1080\/00207540310001622557","article-title":"Heuristic optimization system for the determination of index positions on CNC magazines with the consideration of cutting tool duplications","volume":"42","author":"Baykasoglu","year":"2004","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2025.107321_b21","doi-asserted-by":"crossref","first-page":"742","DOI":"10.1080\/00207543.2015.1055351","article-title":"An improved approach for determination of index positions on CNC magazines with cutting tool duplications by integrating shortest path algorithm","volume":"54","author":"Baykaso\u011flu","year":"2016","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2025.107321_b22","doi-asserted-by":"crossref","first-page":"1775","DOI":"10.1007\/s00170-016-9194-z","article-title":"Minimizing tool switching and indexing times with tool duplications in automatic machines","volume":"89","author":"Baykaso\u011flu","year":"2017","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"10.1016\/j.cor.2025.107321_b23","first-page":"2555","article-title":"Weighted superposition attraction algorithm for binary optimization problems","volume":"20","author":"Baykaso\u011flu","year":"2020","journal-title":"Oper. Res."},{"key":"10.1016\/j.cor.2025.107321_b24","doi-asserted-by":"crossref","first-page":"2248","DOI":"10.1080\/00207543.2024.2399711","article-title":"Turret-index optimisation with mathematical programming and metaheuristic approaches","volume":"63","author":"Baykasoglu","year":"2025","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2025.107321_b25","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1214\/ss\/1177011077","article-title":"Simulated annealing","volume":"8","author":"Bertsimas","year":"1993","journal-title":"Statist. Sci."},{"key":"10.1016\/j.cor.2025.107321_b26","series-title":"The Quadratic Assignment Problem: Theory and Algorithms. vol. 1","author":"Cela","year":"2013"},{"key":"10.1016\/j.cor.2025.107321_b27","series-title":"Proceedings of the Second International Symposium on Intelligent Manufacturing Systems","first-page":"743","article-title":"Determination of optimal turret-index positions of cutting tools by using genetic algorithms","author":"Dereli","year":"1998"},{"key":"10.1016\/j.cor.2025.107321_b28","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0921-8890(00)00086-5","article-title":"Allocating optimal index positions on tool magazines using genetic algorithms","volume":"33","author":"Dereli","year":"2000","journal-title":"Robot. Auton. Syst."},{"key":"10.1016\/j.cor.2025.107321_b29","article-title":"Music-inspired harmony search algorithm: Theory and applications","author":"Geem","year":"2009"},{"key":"10.1016\/j.cor.2025.107321_b30","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-04317-8","article-title":"Recent advances in harmony search algorithm","author":"Geem","year":"2010"},{"key":"10.1016\/j.cor.2025.107321_b31","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1177\/003754970107600201","article-title":"A new heuristic optimization algorithm: harmony search","volume":"76","author":"Geem","year":"2001","journal-title":"Simulation"},{"key":"10.1016\/j.cor.2025.107321_b32","series-title":"Allocating Tools to Index Positions in Tool Magazines Using Tabu Search","author":"Ghosh","year":"2016"},{"key":"10.1016\/j.cor.2025.107321_b33","series-title":"Comparing Genetic Algorithm Crossover and Mutation Operators for the Indexing Problem","author":"Ghosh","year":"2016"},{"key":"10.1016\/j.cor.2025.107321_b34","series-title":"Exploring Lin Kernighan Neighborhoods for the Indexing Problem","author":"Ghosh","year":"2016"},{"key":"10.1016\/j.cor.2025.107321_b35","series-title":"Incorporating Gender and Age in Genetic Algorithms to Solve the Indexing Problem","author":"Ghosh","year":"2016"},{"key":"10.1016\/j.cor.2025.107321_b36","series-title":"A New Genetic Algorithm for the Tool Indexing Problem","author":"Ghosh","year":"2016"},{"key":"10.1016\/j.cor.2025.107321_b37","series-title":"Speeding Up Neighborhood Search for the Tool Indexing Problem","author":"Ghosh","year":"2016"},{"key":"10.1016\/j.cor.2025.107321_b38","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1080\/07408179808966514","article-title":"Heuristics for minimizing tool switches when scheduling part types on a flexible machine","volume":"30","author":"Hertz","year":"1998","journal-title":"IIE Trans."},{"key":"10.1016\/j.cor.2025.107321_b39","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"10.1016\/j.cor.2025.107321_b40","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1016\/j.ejor.2005.09.032","article-title":"A survey for the quadratic assignment problem","volume":"176","author":"Loiola","year":"2007","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2025.107321_b41","doi-asserted-by":"crossref","first-page":"1818","DOI":"10.1016\/j.engappai.2013.05.008","article-title":"A survey on applications of the harmony search algorithm","volume":"26","author":"Manjarres","year":"2013","journal-title":"Eng. Appl. Artif. Intell."},{"key":"10.1016\/j.cor.2025.107321_b42","article-title":"A survey of adaptive large neighborhood search algorithms and applications","volume":"146","author":"Mara","year":"2022","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2025.107321_b43","series-title":"Optimization Essentials: Theory, Tools, and Applications","first-page":"633","article-title":"A neighborhood search algorithm for the tool indexing problem without tool duplication","author":"Mohan","year":"2024"},{"key":"10.1016\/j.cor.2025.107321_b44","series-title":"Handbook of Metaheuristics","first-page":"1","article-title":"Simulated annealing","author":"Nikolaev","year":"2010"},{"key":"10.1016\/j.cor.2025.107321_b45","series-title":"The quadratic assignment problem: A survey and recent developments","author":"Pardalos","year":"1994"},{"key":"10.1016\/j.cor.2025.107321_b46","series-title":"Handbook of Metaheuristics","first-page":"99","article-title":"Large neighborhood search","author":"Pisinger","year":"2018"},{"key":"10.1016\/j.cor.2025.107321_b47","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/trsc.1050.0135","article-title":"An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows","volume":"40","author":"Ropke","year":"2006","journal-title":"Transp. Sci."},{"key":"10.1016\/j.cor.2025.107321_b48","series-title":"Handbook of Constraint Programming","author":"Rossi","year":"2006"},{"key":"10.1016\/j.cor.2025.107321_b49","series-title":"International Conference on Principles and Practice of Constraint Programming","first-page":"417","article-title":"Using constraint programming and local search methods to solve vehicle routing problems","author":"Shaw","year":"1998"},{"key":"10.1016\/j.cor.2025.107321_b50","doi-asserted-by":"crossref","first-page":"897","DOI":"10.1080\/07408170108936882","article-title":"Sequencing, scheduling and tooling single-stage multifunctional machines in a small batch environment","volume":"33","author":"Sinriech","year":"2001","journal-title":"IIE Trans."},{"key":"10.1016\/j.cor.2025.107321_b51","first-page":"28","article-title":"The generalization of \u2018STUDENT\u2019S\u2019 problem when several different population varlances are involved","volume":"34","author":"Welch","year":"1947","journal-title":"Biometrika"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054825003508?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054825003508?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T21:45:25Z","timestamp":1763675125000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054825003508"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2]]},"references-count":51,"alternative-id":["S0305054825003508"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2025.107321","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2026,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Linear formulations and a hybrid large neighborhood search algorithm for the tool indexing problem","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2025.107321","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 The Author. Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}],"article-number":"107321"}}