{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T11:54:29Z","timestamp":1762430069671},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2006,3,3]],"date-time":"2006-03-03T00:00:00Z","timestamp":1141344000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2006,9]]},"DOI":"10.1007\/s00500-005-0044-4","type":"journal-article","created":{"date-parts":[[2006,3,2]],"date-time":"2006-03-02T13:09:11Z","timestamp":1141304951000},"page":"1075-1090","source":"Crossref","is-referenced-by-count":13,"title":["Main Effect Fine-tuning of the Mutation Operator and the Neighbourhood Function for Uncapacitated Facility Location Problems"],"prefix":"10.1007","volume":"10","author":[{"given":"Kit Yan","family":"Chan","sequence":"first","affiliation":[]},{"given":"M. Emin","family":"Aydin","sequence":"additional","affiliation":[]},{"given":"Terence C.","family":"Fogarty","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,3,3]]},"reference":[{"key":"44_CR1","unstructured":"Aydin ME, Fogarty TC (2001) Simulated annealing with evolutionary process for job-shop scheduling problems. In: EUROGEN 2001 \u2013 Evolutionary methods for design, optimisation and control with applications to industrial problems, 19\u201321 September 2001, Athens, Greece"},{"key":"44_CR2","doi-asserted-by":"crossref","unstructured":"Aydin ME, Fogarty TC (2004) A distributed evolutionary simulated annealing for combinatorial optimisation problems. J Heuristics 10:3 (accepted)","DOI":"10.1023\/B:HEUR.0000026896.44360.f9"},{"key":"44_CR3","doi-asserted-by":"crossref","unstructured":"Beasley JE (1996) Obtaining test problems via Internet. J Glob Optim 8:429\u2013433, http:\/\/mscmga.ms.ic.ac.uk\/info.html","DOI":"10.1007\/BF02404002"},{"key":"44_CR4","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1016\/0377-2217(95)00159-X","volume":"94","author":"JE Beasley","year":"1994","unstructured":"Beasley JE, Chu PC (1994) A genetic algorithm for the set covering problem. Eur J Oper Res 94:392\u2013404","journal-title":"Eur J Oper Res"},{"key":"44_CR5","doi-asserted-by":"crossref","unstructured":"Chan KY, Aydin ME, Fogarty TC (2003) An epistasis measure based on the analysis of variance for the real-coded representation in genetic algorithm. In: Proceedings of the IEEE international congress on evolutionary computation, pp. 297\u2013304","DOI":"10.1109\/CEC.2003.1299588"},{"key":"44_CR6","doi-asserted-by":"crossref","unstructured":"Chan KY, Aydin ME, Fogarty TC (2004) Parameterisation of mutation in evolutionary algorithm using the estimated main effect of genes. In: Proceedings of the IEEE international congress on evolutionary computation","DOI":"10.1109\/CEC.2004.1331138"},{"key":"44_CR7","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1016\/0377-2217(95)00077-1","volume":"93","author":"S Chatterjee","year":"1995","unstructured":"Chatterjee S, Carrera C, Lynch LA (1995) Genetic algorithms and traveling salesman problems. Eur J Oper Res 93:490\u2013510","journal-title":"Eur J Oper Res"},{"issue":"1","key":"44_CR8","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/S0305-0548(96)00032-9","volume":"24","author":"PC Chu","year":"1997","unstructured":"Chu PC, Beasley JE (1997) A genetic algorithm for the generalised assignment problem. Comput Oper Res 24(1):17\u201323","journal-title":"Comput Oper Res"},{"key":"44_CR9","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032343","volume-title":"Network and discrete location: models, algorithms, and applications","author":"MS Daskin","year":"1995","unstructured":"Daskin MS (1995) Network and discrete location: models, algorithms, and applications. Wiley, New York"},{"key":"44_CR10","unstructured":"Fogarty TC (1989) Varying the probability of mutation in the genetic algorithm. In: Proceedings of the 3rd international conferences on genetic algorithms pp 104\u2013109"},{"key":"44_CR11","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD, JR., Vecchi MP (1983) Optimization by simulated annealing. Sci 220:671\u2013680","journal-title":"Sci"},{"key":"44_CR12","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1051\/ro:2001107","volume":"35","author":"J Kratica","year":"2001","unstructured":"Kratica J, Tosic D, Filipovic V, Ljubic I (2001) Solving the simple plant location problem by genetic algorithm. RAIRO Oper Res 35:127\u2013142","journal-title":"RAIRO Oper Res"},{"key":"44_CR13","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1016\/0377-2217(95)00011-E","volume":"83","author":"CKY Lin","year":"1995","unstructured":"Lin CKY, Haley KB, Sparks C (1995) A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems. Eur J Oper Res 83:330\u2013346","journal-title":"Eur J Oper Res"},{"key":"44_CR14","volume-title":"Design and analysis of experiments","author":"DC Montgomery","year":"1997","unstructured":"Montgomery DC (1997) Design and analysis of experiments. Wiley, New York"},{"key":"44_CR15","doi-asserted-by":"crossref","unstructured":"Reeves C (1994) Genetic algorithms and neighbourhood search. In: Evolutionary computing: AISB workshop, pp 115\u2013130","DOI":"10.1007\/3-540-58483-8_10"},{"issue":"3","key":"44_CR16","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1287\/ijoc.9.3.231","volume":"9","author":"C Reeves","year":"1997","unstructured":"Reeves C (1997) Genetic algorithms for operations researcher. Informs J Comput 9(3):231\u2013250","journal-title":"Informs J Comput"},{"issue":"1\u20132","key":"44_CR17","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/S0360-8352(97)00087-9","volume":"33","author":"AJ Ruiz-Torres","year":"1997","unstructured":"Ruiz-Torres AJ, Enscore EE, Barton RR (1997) Simulated annealing heuristics for the average flow-time and the number of tardy jobs bi-criteria identical parallel machine problem. Comput Ind Eng 33(1\u20132):257\u2013260","journal-title":"Comput Ind Eng"},{"key":"44_CR18","unstructured":"Syswerda G (1989) Uniform crossover in genetic algorithms. In: Proceeding of the 3rd international conference on genetic algorithms, pp 2\u20139"},{"issue":"11","key":"44_CR19","doi-asserted-by":"crossref","first-page":"1538","DOI":"10.1109\/PROC.1987.13916","volume":"75","author":"H Szu","year":"1987","unstructured":"Szu H, Hartley R (1987) Nonconvex optimization by fast simulated annealing. Proc IEEE 75(11):1538\u20131540","journal-title":"Proc IEEE"},{"key":"44_CR20","unstructured":"Vaessens RJM, Aarts EHL, Lenstra JK (1992) A local search template. In: Proceedings of parallel problem-solving from nature 2. pp 65\u201374"},{"key":"44_CR21","doi-asserted-by":"crossref","first-page":"804","DOI":"10.1057\/palgrave.jors.2600431","volume":"48","author":"JM Wilson","year":"1997","unstructured":"Wilson JM (1997) A genetic algorithm for the generalised assignment problem. J Oper Res Soc 48:804\u2013809","journal-title":"J Oper Res Soc"},{"key":"44_CR22","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1080\/00207169108804011","volume":"40","author":"X Yao","year":"1991","unstructured":"Yao X (1991) Simulated annealing with extended neighbourhood. Int J Comput Math 40:169\u2013189","journal-title":"Int J Comput Math"},{"key":"44_CR23","unstructured":"Yao X (1993) Comparison of different neighbourhood sizes in simulated annealing. In: Proceedings of 4th Australian conference on neural networks, pp 216\u2013219"},{"key":"44_CR24","doi-asserted-by":"crossref","unstructured":"Yigit V, Aydin ME, Turkbey O (2004) Evolutionary simulated annealing algorithms for uncapacitated facility location problems. In: Proceedings of adaptive computing in design and manufacture, pp 20\u201322","DOI":"10.1007\/978-0-85729-338-1_16"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-005-0044-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-005-0044-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-005-0044-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T01:38:09Z","timestamp":1559093889000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-005-0044-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,3,3]]},"references-count":24,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2006,9]]}},"alternative-id":["44"],"URL":"https:\/\/doi.org\/10.1007\/s00500-005-0044-4","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,3,3]]}}}