Abstract
This chapter investigates the performance of several Multi-Objective Evolutionary Algorithms (MOEAs) in discovering solutions to the Competitive Facility Location (CFL) problem and a sensitivity analysis of the solutions related to input parameters. In terms of the optimality, the MOEAs are able to find Pareto-optimal solutions in the discrete-valued objective (captured weights) search space but show inferior Pareto-optimal solutions to the real-valued objective (facility quality). In terms of runtime complexity, the MOEAs run in polynomial time but are computationally expensive in terms of repeated executions for sensitivity analysis. The sensitivity analyses show that the mutation rate causes much of the variation in the output and requires a high probability value in order to generate CFL solutions near the Pareto-optimal front. The section on robustness examined the effects of changing the area location in finding solutions to the competitive facility location problem while preserving a small set of previously effective GA-parameter combinations. The results show that there is no single GA-parameter combination that dictates the generation of best solutions. TheMOEA in this case, is robust as long as the mutation probability and the bit-turn probability are set to a probability of more than 60 % while keeping the crossover probability low.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography
Carrizosa E. and Plastria F., (1995). On minquantile and maxcovering optimization. Mathematical Programming, 71: 101–112.
Deb K., (2001). MultiObjective Optimization Using Evolutionary Algorithms. Chichester, UK: Wiley.
Drezner T., (1994). Locating a single new facility among existing, unequally attractive facilities. Journal of Regional Science, 34 (2): 237–252.
Drezner Z., (1981). On a modified one-center problem, Management Science, 27 (7): 848–851.
Eiselt H.A. and Laporte G., (1988). Location of a new facility on a linear market in the presence of weights. Asia-Pacific Journal of Operational Research, 5: 160–165.
Eiselt H.A., Laporte G., and Thisse J.-F., (1993). Competitive Location Models: A Framework and Bibliography. Transportation Science, 27 (1): 44–54.
Eshelman L.J. and Schaffer J.D., (1993). Crossover’s niche. In Proceedings of 5th International Conference on Genetic Algorithms, Virginia, USA. pp. 9–194.
Plastria F., (2001). Static competitive facility location: an overview of optimisation approaches. European Journal of Operational Research, 129: 461–470.
Plastria, F. and E. Carrizosa (2004). Optimal location and design of a competitive facility. Mathematical Programming, 100 (2): 247–265.
Saltelli A., Chan K., and Scott M., (2000). Sensitivity Analysis. Probability and Statistics Series. New York, NY: Wiley.
Saltelli A., Tarantola S., Campolongo F., and Ratto M., (2004). Sensitivity Analysis in Practice: a Guide to assessing Scientific Models. Chichester: Wiley.
SIMLAB 2.2, (2004). Reference Manual. European Commission-ISPC.
Zitzler E. and Thiele L., (1999). Multiobjective evolutionary algorithms: a comparative study and the strength Pareto approach. IEEE Transactions on Evolutionary Computation, 3 (4): 257–271.
Zitzler E., Laumanns M., and Thiele L., (2002). SPEA2: Improving the strength Pareto evolutionary algorithm for multiobjective optimization. In Giannakoglou K., Tsahalis D., Periaux J., Papailou K., Fogarty T. (eds.), Evolutionary Methods for Design, Optimization and Control, pp. 19–26, CIMNE, Barcelona, Spain.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Atlantis Press
About this chapter
Cite this chapter
Pangilinan, J.M., Janssens, G.K., Caris, A. (2012). A Multi-Objective Evolutionary Algorithm for Finding Efficient Solutions to a Competitive Facility Location Problem. In: Kahraman, C. (eds) Computational Intelligence Systems in Industrial Engineering. Atlantis Computational Intelligence Systems, vol 6. Atlantis Press, Paris. https://doi.org/10.2991/978-94-91216-77-0_29
Download citation
DOI: https://doi.org/10.2991/978-94-91216-77-0_29
Publisher Name: Atlantis Press, Paris
Print ISBN: 978-94-91216-76-3
Online ISBN: 978-94-91216-77-0
eBook Packages: Computer ScienceComputer Science (R0)