{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:26:16Z","timestamp":1725488776458},"publisher-location":"Boston, MA","reference-count":30,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387719191"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-0-387-71921-4_12","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T08:26:41Z","timestamp":1186820801000},"page":"225-244","source":"Crossref","is-referenced-by-count":0,"title":["A Memetic Algorithm for Dynamic Location Problems"],"prefix":"10.1007","author":[{"given":"Joana","family":"Dias","sequence":"first","affiliation":[]},{"given":"M. Eug\u00e9nia","family":"Captivo","sequence":"additional","affiliation":[]},{"given":"Jo\u00e3o","family":"Cl\u00edmaco","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1016\/S0377-2217(97)00286-5","volume":"106","author":"S. Abdinnour-Helm","year":"1998","unstructured":"Abdinnour-Helm, S. (1998). \u201cA Hybrid Heuristic for the Uncapacitated Hub Location Problem.\u201d European Journal of Operational Research 106: 489-499.","journal-title":"European Journal of Operational Research"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/0377-2217(95)00159-X","volume":"94","author":"J.E. Beasley","year":"1996","unstructured":"Beasley, J. E. and Chu, P. C. (1996). \u201cA Genetic Algorithm for the Set Covering Problem.\u201d European Journal of Operational Research 94: 392-404.","journal-title":"European Journal of Operational Research"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1023\/A:1012248319870","volume":"12","author":"B.K.-S. Cheung","year":"2001","unstructured":"Cheung, B. K.-S., Langevin, A. and Villeneuve, B. (2001). \u201cHigh Performing Techniques for Solving Complex Location Problems in Industrial System Design.\u201d Journal of Intelligent Manufacturing 12: 455-466.","journal-title":"Journal of Intelligent Manufacturing"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1016\/S0045-7825(01)00323-1","volume":"191","author":"C.A. Coello Coello","year":"2002","unstructured":"Coello Coello, C. A. (2002). \u201cTheoretical and Numerical Constraint-Handling Techniques used with Evolutionary Algorithms: A Survey and the State of the Art.\u201d Computer Methods in Applied Mechanics and Engineering 191: 1245-1287.","journal-title":"Computer Methods in Applied Mechanics and Engineering"},{"key":"12_CR5","unstructured":"Correa, E. S., Steiner, M. T. A., Freitas, A. A. and Carnieri, C. (2001). A Genetic Algorithm for the P-Median Problem. Proceedings 2001 Genetic and Evolutionary Computation GECCO20011268-1275."},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Cortinhal, M. J. and Captivo, M. E. (2003). Genetic Algorithms for the Single Source Capacitated Location Problem. Metaheuristics: Computer Decision-Making. M. Resende and J. P. d. Sousa, Kluwer Academic: 187-216.","DOI":"10.1007\/978-1-4757-4137-7_9"},{"key":"12_CR7","unstructured":"Deb, K. (2001). Multi-objective Optimization using Evolutionary Algorithms, John Wiley & Sons."},{"key":"12_CR8","unstructured":"Dias, J., Captivo, M. E. and Cl\u00edmaco, J. (2004). Capacitated Dynamic Location Problems with Opening, Closure and Reopening of Facilities, Inesc-Coimbra."},{"key":"12_CR9","unstructured":"Dias, J., Captivo, M. E. and Cl\u00edmaco, J. (2005a). Dynamic Multi-Level Capacitated and Uncapacitated Location Problems: an approach using primal-dual heuristics. INOC\u201905, LisbonB1.227-B1.234."},{"key":"12_CR10","unstructured":"Dias, J., Captivo, M. E. and Cl\u00edmaco, J. (2005b). \u201cEfficient Primal-Dual Heuristic for a Dynamic Location Problem.\u201d Computers & Operations Research to appear."},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Dias, J., Captivo, M. E. and Cl\u00edmaco, J. (2006). \u201cCapacitated Dynamic Location Problems with Opening, Closure and Reopening of Facilities.\u201d IMA Journal of Mathematical Management, Special Issue on Location Analysis: Applications and Models, S. Salhi e Zvi Drezner (eds) (to appear)","DOI":"10.1093\/imaman\/dpl003"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s10479-005-2043-3","volume":"136","author":"P. Dom\u00ednguez-Mar\u00edn","year":"2005","unstructured":"Dom\u00ednguez-Mar\u00edn, P., Nickel, S., Hansen, P. and Mladenovic, N. (2005). \u201cHeuristic Procedures for Solving the Discrete Ordered Median Problem.\u201d Annals of Operations Research 136: 145-173.","journal-title":"Annals of Operations Research"},{"key":"12_CR13","unstructured":"Filipovic, V., Kratica, J., Tosic, D. and Ljubic, I. (2000). Fine Grained Tornament Selection for the Simple Plant Location Problem. Proceedings of the 5th Online World Conference on Soft Computing Methods in Indsutrial Applications WSC5, September 2000152-158."},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/BF02027381","volume":"6","author":"C.M. Hosage","year":"1986","unstructured":"Hosage, C. M. and Goodchild, M. F. (1986). \u201cDiscrete Space Location-Allocation Solutions from Genetic Algorithms.\u201d Annals of Operations Research 6: 35-46.","journal-title":"Annals of Operations Research"},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1016\/0305-0548(95)00063-1","volume":"23","author":"C. Houck","year":"1996","unstructured":"Houck, C., Joines, J. and Kay, M. (1996). \u201cComparison of Genetic Algorithms, Random Restart and Two-Opt Switching for Solving Large Location-Allocation Problems.\u201d Computers & Operations Research 23: 587-596.","journal-title":"Computers & Operations Research"},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1016\/0305-0548(95)00061-5","volume":"23","author":"C. Huntley","year":"1996","unstructured":"Huntley, C. and Brown, D. (1996). \u201cParallel Genetic Algorithms with Local Search.\u201d Computers & Operations Research 23: 559-571.","journal-title":"Computers & Operations Research"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1016\/S0305-0548(01)00021-1","volume":"29","author":"J. Jaramillo","year":"2002","unstructured":"Jaramillo, J., Bhadury, J. and Batta, R. (2002). \u201cOn the Use of Genetic Algorithms to Solve Location Problems.\u201d Computers & Operations Research 29: 761-779.","journal-title":"Computers & Operations Research"},{"key":"12_CR18","unstructured":"Kratica, J. (1999). \u201cImprovement of Simple Genetic Algorithm for Solving the Uncapacitated Warehouse Location Problem.\u201d Advances in Soft Computing, Engineering Design and Manufacturing: 390-402."},{"key":"12_CR19","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1051\/ro:2001107","volume":"35","author":"J. Kratica","year":"2001","unstructured":"Kratica, J., Tosic, D., Filipovic, V. and Ljubic, I. (2001). \u201cSolving the Simple Plant Location Problem by Genetic Algorithm.\u201d RAIRO Operation Research 35: 127-142.","journal-title":"RAIRO Operation Research"},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1057\/palgrave.jors.2600380","volume":"48","author":"L. Lorena","year":"1997","unstructured":"Lorena, L. and Lopes, L. D. S. (1997). \u201cGenetic Algorithms Applied to Computationally Difficult Set Covering Problems.\u201d Journal of the Operational Research Society 48: 440-445.","journal-title":"Journal of the Operational Research Society"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Moscato, P. and Cotta, C. (2003). A Gentle Introduction to Memetic Algorithms. Handbook of Metaheuristics. F. Glover and G. Kochenberger. Boston, Kluwer Academic Publishers.","DOI":"10.1007\/0-306-48056-5_5"},{"key":"12_CR22","unstructured":"Murata, T., Ishibuchi, H. and Gen, M. (1998). \u201cNeighborhood Structures for Genetic Local Search Algorithms.\u201d IEEE Transactions on Systems Man and Cybernetics: 259-263."},{"key":"12_CR23","unstructured":"Oei, C. K., Goldberg, d. E. and Chang, S.-J. (1991). Tournament Selection, Niching and the Preservation of Diversity. Illinois Genetic Algorithms Laboratory (IlliGAL) Report."},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"Osman, I. H. and Kelly, J. P. (1996). Meta-Heuristics: Theory & Applications, Kluwer Academic Publishers.","DOI":"10.1007\/978-1-4613-1361-8"},{"key":"12_CR25","unstructured":"Reeves, C. and H\u00f6hn, C. (1996). \u201cIntegrating Local Search into Genetic Algorithms.\u201d Modern Heuristic Search Methods: 99-115."},{"key":"12_CR26","unstructured":"Reeves, C. R. (1993). Using Genetic Algorithms With Small Populations. Proceedings of the Fifth International Conference on Genetic Algorithms, Morgan Kaufmann, San Mateo, CA."},{"key":"12_CR27","unstructured":"Rothlauf, F. and Goldberg, D. (2002). Redundant Representations in Evolutionary Computation. Illinois Genetic Algorithms Laboratory (IlliGAL) Report."},{"key":"12_CR28","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1023\/A:1026131531250","volume":"123","author":"S. Salhi","year":"2003","unstructured":"Salhi, S. and Gamal, M. D. H. (2003). \u201cA Genetic Algorithm Based Approach for the Uncapacitated Continuous Location-Allocation Problem.\u201d Annals of Operations Research 123: 203-222.","journal-title":"Annals of Operations Research"},{"key":"12_CR29","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1252\/jcej.32.51","volume":"32","author":"Y. Shimizu","year":"1999","unstructured":"Shimizu, Y. (1999). \u201cMulti-Objective Optimization for Site Location Problems through Hybrid Genetic Algorithm with Neural Networks.\u201d Journal of Chemical Engineering of Japan 32: 51-58.","journal-title":"Journal of Chemical Engineering of Japan"},{"key":"12_CR30","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/0377-2217(94)00301-7","volume":"92","author":"M. Yagiura","year":"1996","unstructured":"Yagiura, M. and Ibaraki, T. (1996). \u201cThe Use of Dynamic Programming in Genetic Algorithms for Permutation Problems.\u201d European Journal of Operational Research 92: 387-401.","journal-title":"European Journal of Operational Research"}],"container-title":["Operations Research\/Computer Science Interfaces Series","Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-71921-4_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T17:12:52Z","timestamp":1605633172000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-71921-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9780387719191"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-71921-4_12","relation":{},"subject":[]}}