Solving the simple plant location problem by genetic algorithm
RAIRO-Oper. Res., 35 1 (2001) 127-142
Published online: 2002-08-15
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Metaheuristics
Joana Dias, M. Eugénia Captivo and João ClímacoOperations Research/Computer Science Interfaces Series, Metaheuristics 39 225 (2007)
https://doi.org/10.1007/978-0-387-71921-4_12
Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem
Pierre Hansen, Jack Brimberg, Dragan Urošević and Nenad MladenovićINFORMS Journal on Computing 19 (4) 552 (2007)
https://doi.org/10.1287/ijoc.1060.0196
Hybrid Metaheuristics
Ivana LjubićLecture Notes in Computer Science, Hybrid Metaheuristics 4771 157 (2007)
https://doi.org/10.1007/978-3-540-75514-2_12
Social Infrastructure Planning: A Location Model and Solution Methods
João F. Bigotte and António P. AntunesComputer-Aided Civil and Infrastructure Engineering 22 (8) 570 (2007)
https://doi.org/10.1111/j.1467-8667.2007.00511.x
Handbook of Research on Nature-Inspired Computing for Economics and Management
A. L. MedagliaHandbook of Research on Nature-Inspired Computing for Economics and Management 642 (2007)
https://doi.org/10.4018/978-1-59140-984-7.ch042
A fuzzy queuing location model with a genetic algorithm for congested systems
Hassan Shavandi and Hashem MahloojiApplied Mathematics and Computation 181 (1) 440 (2006)
https://doi.org/10.1016/j.amc.2005.12.058
Solving the uncapacitated facility location problem using tabu search
Minghe SunComputers & Operations Research 33 (9) 2563 (2006)
https://doi.org/10.1016/j.cor.2005.07.014
A hybrid multistart heuristic for the uncapacitated facility location problem
Mauricio G.C. Resende and Renato F. WerneckEuropean Journal of Operational Research 174 (1) 54 (2006)
https://doi.org/10.1016/j.ejor.2005.02.046
A simple filter-and-fan approach to the facility location problem
Peter Greistorfer and César RegoComputers & Operations Research 33 (9) 2590 (2006)
https://doi.org/10.1016/j.cor.2005.07.006
Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing
Vecihi Yigit, M. Emin Aydin and Orhan TurkbeyInternational Journal of Production Research 44 (22) 4773 (2006)
https://doi.org/10.1080/00207540600621003
Standortplanung für Anbieter von IT-Services
Thomas Miklitz, Peter Buxmann and Andreas RöddigerWIRTSCHAFTSINFORMATIK 48 (6) 397 (2006)
https://doi.org/10.1007/s11576-006-0092-0
1341 (2006)
https://doi.org/10.1109/CESA.2006.4281845
Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example
Juan G. Villegas, Fernando Palacios and Andrés L. MedagliaAnnals of Operations Research 147 (1) 109 (2006)
https://doi.org/10.1007/s10479-006-0061-4
Main Effect Fine-tuning of the Mutation Operator and the Neighbourhood Function for Uncapacitated Facility Location Problems
Kit Yan Chan, M. Emin Aydin and Terence C. FogartySoft Computing 10 (11) 1075 (2006)
https://doi.org/10.1007/s00500-005-0044-4
The Exact and Near Optimal Solution of the Competitive Uncapacitated Location Problem
Lubos BuznaCommunications - Scientific letters of the University of Zilina 7 (2) 9 (2005)
https://doi.org/10.26552/com.C.2005.2.9-12
Optimal proportioning of concrete aggregates using a self-adaptive genetic algorithm
Adil Amirjanov and Konstantin SobolComputers and Concrete 2 (5) 411 (2005)
https://doi.org/10.12989/cac.2005.2.5.411
A simple and deterministic competitive algorithm for online facility location
Aris Anagnostopoulos, Russell Bent, Eli Upfal and Pascal Van HentenryckInformation and Computation 194 (2) 175 (2004)
https://doi.org/10.1016/j.ic.2004.06.002
A Distributed Evolutionary Simulated Annealing Algorithm for Combinatorial Optimisation Problems
M. Emin Aydin and Terence C. FogartyJournal of Heuristics 10 (3) 269 (2004)
https://doi.org/10.1023/B:HEUR.0000026896.44360.f9
A simple tabu search for warehouse location
Laurent Michel and Pascal Van HentenryckEuropean Journal of Operational Research 157 (3) 576 (2004)
https://doi.org/10.1016/S0377-2217(03)00247-9
1972 (2004)
https://doi.org/10.1109/CEC.2004.1331138
Adaptive Computing in Design and Manufacture VI
Vecihi Yigit, M. Emin Aydin and Orhan TurkbeyAdaptive Computing in Design and Manufacture VI 185 (2004)
https://doi.org/10.1007/978-0-85729-338-1_16
A simulated annealing algorithm for multi-agent systems: a job-shop scheduling application
M. Emin Aydin and Terence C. FogartyJournal of Intelligent Manufacturing 15 (6) 805 (2004)
https://doi.org/10.1023/B:JIMS.0000042665.10086.cf
Discrete-event simulation optimization using ranking, selection, and multiple comparison procedures
James R. Swisher, Sheldon H. Jacobson and Enver YücesanACM Transactions on Modeling and Computer Simulation 13 (2) 134 (2003)
https://doi.org/10.1145/858481.858484
Placement of network resources in communication networks
Ran Giladi, Ephraim Korach and Rony OhayonComputer Networks 43 (2) 195 (2003)
https://doi.org/10.1016/S1389-1286(03)00259-7
Experimental and Efficient Algorithms
Martin HoeferLecture Notes in Computer Science, Experimental and Efficient Algorithms 2647 165 (2003)
https://doi.org/10.1007/3-540-44867-5_13
vol.6 6 (2002)
https://doi.org/10.1109/ICSMC.2002.1175562
Robust multiple comparisons under common random numbers
Barry L. NelsonACM Transactions on Modeling and Computer Simulation 3 (3) 225 (1993)
https://doi.org/10.1145/174153.174158
A sequential experimental design procedure for the estimation of first- and second-order simulation metamodels
Joan M. Donohue, Ernest C. Houck and Raymond H. MyersACM Transactions on Modeling and Computer Simulation 3 (3) 190 (1993)
https://doi.org/10.1145/174153.174156