{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,26]],"date-time":"2025-12-26T07:13:46Z","timestamp":1766733226039},"publisher-location":"Boston, MA","reference-count":26,"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_5","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T12:26:41Z","timestamp":1186835201000},"page":"91-112","source":"Crossref","is-referenced-by-count":9,"title":["Solving the Capacitated Multi-Facility Weber Problem by Simulated Annealing, Threshold Accepting and Genetic Algorithms"],"prefix":"10.1007","author":[{"given":"Necati","family":"Aras","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sadettin","family":"Yumusak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I. Kuban","family":"Altmel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"Al-Loughani, I., 1997, Algorithmic approaches for solving the Euclidean distance location-allocation problems, PhD Dissertation, Industrial and System Engineering, Virginia Polytechnic Institute and State University, Blacksburgh, Virginia."},{"key":"5_CR2","volume-title":"Linear Programming and Network Flows","author":"M.S. Bazaraa","year":"1990","unstructured":"Bazaraa, M.S., Jarvis, J.J., and Sherali, H.D., 1990, Linear Programming and Network Flows. John Wiley and Sons Inc., Singapore."},{"key":"5_CR3","doi-asserted-by":"crossref","first-page":"1153","DOI":"10.1287\/opre.41.6.1153","volume":"41","author":"J. Brimberg","year":"1993","unstructured":"Brimberg, J. and Love, R.F., 1993, Global convergence of a generalized iterative procedure for the minisum location problem with lp distances, Operations Research 41:1153\u20131163.","journal-title":"Operations Research"},{"key":"5_CR4","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1287\/opre.20.1.94","volume":"20","author":"L. Cooper","year":"1972","unstructured":"Cooper, L., 1972, The transportation-location problem, Operations Research 20:94\u2013108.","journal-title":"Operations Research"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1111\/j.1467-9787.1976.tb00977.x","volume":"16","author":"L. Cooper","year":"1976","unstructured":"Cooper, L., 1976, An e.cient heuristic algorithm for the transportationlocation problem, Journal of Regional Science 16:309\u2013315.","journal-title":"Journal of Regional Science"},{"key":"5_CR6","unstructured":"Dongarra, J., 2006, Performance of various computers using standard linear equations software, Technical Report available online at http:\/\/ www.netlib.org\/benchmark\/performance.ps"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0021-9991(90)90201-B","volume":"90","author":"G. Dueck","year":"1990","unstructured":"Dueck, G. and Scheuer, T., 1990, Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing, Journal of Computational Physics 90:161\u2013175.","journal-title":"Journal of Computational Physics"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Eckert, C. and Gottlieb, J., 2002, Direct Representation and Variation Operators for the Fixed Charge Transportation Problem, in: Proceedings of 7th International Conference on Parallel Problem Solving from Nature \u2013 PPSN VII, Granada, Spain, pp. 77\u201387.","DOI":"10.1007\/3-540-45712-7_8"},{"key":"5_CR9","volume-title":"Facility Layout and Location: An Analytical Approach","author":"R.L. Francis","year":"1992","unstructured":"Francis R.L., McGinnis, L.F., and White, J.A., 1992, Facility Layout and Location: An Analytical Approach, 2nd edition, Prentice Hall, Upper Saddle River, NJ.","edition":"2nd edition"},{"key":"5_CR10","unstructured":"Gottlieb J. and Paulmann, L., 1998, Genetic algorithms for the .xed charge transportation problem, in: Proceedings of the 1998 IEEE International Conference on Evolutionary Computation, Anchorage, Alaska, pp. 330\u2013335."},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Gottlieb, J. and Eckert, C., 2000, A comparison of two representations for the .xed charge transportation problem, in: Proceedings of 6th International Conference on Parallel Problem Solving from Nature\u2013 PPSN VI, Berlin, Germany, pp. 345\u2013354.","DOI":"10.1007\/3-540-45356-3_34"},{"key":"5_CR12","unstructured":"Gottlieb, J., Julstrom, B., Raidl, G., and Rothlauf, F., 2001, Pr\u00fcfer numbers: A poor representation of spanning trees for evolutionary search, in: Proceedings of the 2001 Genetic and Evolutionary Computation Conference, San Francisco, California, pp. 343\u2013350."},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P. Hansen","year":"2001","unstructured":"Hansen, P. and Mladenovi\u0107, N., 2001, Variable neighborhood search: Principles and applications. European Journal of Operational Research 130:449\u2013467.","journal-title":"European Journal of Operational Research"},{"key":"5_CR14","doi-asserted-by":"crossref","first-page":"1241","DOI":"10.1287\/opre.28.5.1241","volume":"28","author":"P. Hansen","year":"1980","unstructured":"Hansen, P., Perreur, J., and Thisse, F., 1980, Location theory, dominance and convexity: Some further results, Operations Research 28:1241\u2013 1250.","journal-title":"Operations Research"},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"4598","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., and Vecchi, M.P., 1983, Optimization by simulated annealing, Science, 4598:671\u2013680.","journal-title":"Science"},{"key":"5_CR16","first-page":"239","volume":"4","author":"Y. Li","year":"1998","unstructured":"Li, Y., Gen, M., and Ida, K., 1998, Fixed charge transportation problem by spanning tree-based genetic algorithm, Beijing Mathematics 4:239\u2013249.","journal-title":"Beijing Mathematics"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Ohlmann, J.W., and Thomas, B.W., 2006, A compressed annealing approach to the traveling salesman problem with time windows, INFORMS Journal on Computing, forthcoming.","DOI":"10.1287\/ijoc.1050.0145"},{"key":"5_CR18","unstructured":"Selim, S., 1979, Biconvex programming and deterministic and stochastic location allocation problems, Ph. D. dissertation, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia."},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1287\/moor.13.1.32","volume":"13","author":"H.D. Sherali","year":"1988","unstructured":"Sherali, H.D. and Nordai, F.L., 1988, NP-hard, capacitated, balanced pmedian problems on a chain graph with a continuum of link demands, Mathematics of Operations Research 13:32\u201349.","journal-title":"Mathematics of Operations Research"},{"key":"5_CR20","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1002\/1520-6750(199206)39:4<447::AID-NAV3220390403>3.0.CO;2-O","volume":"39","author":"H.D. Sherali","year":"1992","unstructured":"Sherali, H.D. and Tun\u00e7bilek, C.H., 1992, A squared-Euclidean distance location-allocation problem. Naval Research Logistics 39:447\u2013469.","journal-title":"Naval Research Logistics"},{"key":"5_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4388-3","volume-title":"A reformulation-linearization technique for solving discrete and continuous nonconvex problems","author":"H.D. Sherali","year":"1999","unstructured":"Sherali, H.D. and Adams, W.P., 1999, A reformulation-linearization technique for solving discrete and continuous nonconvex problems, Kluwer Academic Publishers, The Netherlands."},{"key":"5_CR22","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/0166-218X(94)90218-6","volume":"49","author":"H.D. Sherali","year":"1994","unstructured":"Sherali, H.D., Ramachandran, S., and Kim, S., 1994, A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem, Discrete Applied Mathematics 49:357\u2013378.","journal-title":"Discrete Applied Mathematics"},{"key":"5_CR23","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1287\/opre.50.3.433.7739","volume":"50","author":"H.D. Sherali","year":"2002","unstructured":"Sherali, H.D., Al-Loughani, I., and Subramanian, S., 2002, Global optimization procedures for the capacitated Euclidean and l p distance multifacility location-allocation problems, Operations Research 50:433\u2013448.","journal-title":"Operations Research"},{"key":"5_CR24","first-page":"355","volume":"43","author":"E. Weiszfeld","year":"1937","unstructured":"Weiszfeld, E., 1937, Sur le point lequel la somme des distances de n points donn\u00e9 est minimum, T\u00f4hoku Mathematics Journal 43:355\u2013386.","journal-title":"T\u00f4hoku Mathematics Journal"},{"key":"5_CR25","first-page":"5","volume":"1","author":"G. Wesolowsky","year":"1993","unstructured":"Wesolowsky, G., 1993, The Weber problem: history and perspectives, Location Science 1:5\u201323.","journal-title":"Location Science"},{"key":"5_CR26","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1016\/S0377-2217(98)00270-7","volume":"117","author":"S. Yan","year":"1999","unstructured":"Yan, S. and Luo, S.C., 1999, Probabilistic local search algorithms for concave cost transportation network problems, European Journal of Operational Research 117:511\u2013521.","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_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T22:12:58Z","timestamp":1605651178000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-71921-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9780387719191"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-71921-4_5","relation":{},"subject":[]}}