60 Sándor Bozóki[6] Bu<strong>de</strong>scu, D.V., Zwick, R., Rapoport, A. (1986): A comparison of the Eigenvector Method and the GeometricMean procedure for ratio scaling, Applied Psychological Measurement, 10 pp. 69-78.[7] Chu, A.T.W., Kalaba, R.E., Spingarn, K. (1979): A comparison of two methods for <strong>de</strong>termining the weightbelonging to fuzzy sets, Journal of Optimization Theory and Applications 4, pp. 531-538.[8] Cook, W.D., Kress, M. (1988): Deriving weights from pairwise comparison ratio matrices: An ax0iomaticapproach, European Journal of Operations Research, 37 pp. 355-362.[9] Crawford, G., Williams, C. (1985): A note on the analysis of subjective judgment matrices, Journal of MathematicalPsychology 29, pp. 387-405.[10] De Jong, P. (1984): A statistical approach to Saaty’s scaling methods for priorities, Journal of MathematicalPsychology 28, pp. 467-478.[11] DeGraan, J.G. (1980): Extensions of the multiple criteria analysis method of T.L. Saaty (Technical Reportm.f.a. 80-3) Leischendam, the Netherlands: National Institute for Water Supply. Presented at EURO IV, Cambridge,England, July 22-25.[12] Farkas, A., Lancaster, P., Rózsa, P. (2003): Consistency adjustment for pairwise comparison matrices, NumericalLinear Algebra with Applications, 10, pp. 689-700.[13] Farkas, A., Rózsa, P. (2004): On the Non-Uniqueness of the Solution to the Least-Squares Optimization ofPairwsie Comparison Matrices, Acta Polytechnica Hungarica, Journal of Applied Sciences at Budapest PolytechnicHungary, 1, pp. 1-20.[14] Gao, T., Li, T.Y., Wang, X. (1999): Finding isolated zeros of polynomial systems in C n with stable mixedvolumes, J. Symbolic Comput., 28, pp. 187-211.[15] Gass, S.I., Rapcsák, T. (2004): Singular value <strong>de</strong>composition in AHP, European Journal of Operations Research154 pp. 573-584.[16] Golany, B., Kress, M. (1993): A multicriteria evaluation of methods for obtaining weights from ratio-scalematrices, European Journal of Operations Research, 69 pp. 210-220.[17] Hashimoto, A. (1994): A note on <strong>de</strong>riving weights from pairwise comparison ratio matrices, European Journalof Operations Research, 73 pp. 144-149.[18] Jensen, R.E. (1983): Comparison of Eigenvector, Least squares, Chi square and Logarithmic least squaremethods of scaling a reciprocal matrix, Working Paper 153 http://www.trinity.edu/rjensen/127wp/127wp.htm[19] Jensen, R.E. (1984): An Alternative Scaling Method for Priorities in Hierarchical Structures, Journal of MathematicalPsychology 28, pp. 317-332.[20] Li, T.Y. (1997): Numerical solution of multivariate polynomial systems by homotopy continuation methods,Acta Numerica, 6 pp. 399-436.[21] Saaty, T.L. (1980): The analytic hierarchy process, McGraw-Hill, New York.[22] Saaty, T.L., Vargas, L.G. (1984): Comparison of eigenvalues, logarithmic least squares and least squares methodsin estimating ratios, Mathematical Mo<strong>de</strong>ling, 5 pp. 309-324.[23] Zahedi, F. (1986): A simulation study of estimation methods in the Analytic Hierarchy Process, Socio-Economic Planning Sciences, 20 pp. 347-354.
Proceedings of GO 2005, pp. 61 – 65.Locating Competitive Facilities via a VNS Algorithm ∗Emilio Carrizosa, 1 José Gordillo, 1 and Dolores R. Santos-Peñate 21 <strong>Universidad</strong> <strong>de</strong> Sevilla, Spain{ecarrizosa,jgordillo}@us.es2 <strong>Universidad</strong> <strong>de</strong> Las Palmas <strong>de</strong> Gran Canaria, Spaindrsantos@dmc.ulpgc.esAbstractKeywords:We consi<strong>de</strong>r the problem of locating in the time period [0, T ] q facilities in a market in which competingfirms already operate with p facilities. Locations and the entering times maximizing profitsare sought.Assuming that <strong>de</strong>mands and costs are time-<strong>de</strong>pen<strong>de</strong>nt, optimality conditions are obtained, anddifferent <strong>de</strong>mand patterns are analyzed. The problem is posed as a mixed integer nonlinear problem,heuristically solved via a VNS algorithm.Competitive location, Variable Neighborhood Search, Dynamic Demand, Covering Mo<strong>de</strong>ls, MaximalProfit.1. IntroductionThe problem of locating facilities in a competitive environment has been addressed, both at themo<strong>de</strong>lling and computational level, in a number of papers in the field of Operations Researchand Management Science, see e.g. [2, 3, 5–9, 12, 14] and the references therein.The simplest mo<strong>de</strong>ls accommodating competition are those related with covering: a firmis planning to locate a series of facilities to compete against a set of already operating facilities,in or<strong>de</strong>r to maximize its profit, usually equivalent to maximizing the market share.Different attraction rules may be (and have been) consi<strong>de</strong>red to mo<strong>de</strong>l consumer behavior,and thus to evaluate market share. For instance, with the binary attraction rule, one assumesthat consumers <strong>de</strong>mand is fully captured by the closest facility, or more generally by the mostattractive facility, where attractiveness is measured by a function <strong>de</strong>creasing in distance andprice, e.g. [1, 10, 11, 13].Serious attempts have been ma<strong>de</strong> to mo<strong>de</strong>l different metric spaces (a discrete set, a transportationnetwork or the plane), or different attraction rules (e.g. the above-mentioned binaryrule, as well as rules relying upon the assumption that consumer <strong>de</strong>mand is split into the differentfacilities, each capturing a fraction of the <strong>de</strong>mand, this <strong>de</strong>mand being <strong>de</strong>creasing in distance,. . . ). However, most mo<strong>de</strong>ls assume that consumer <strong>de</strong>mand remains constant throughthe full planning horizon, which may be a rather unrealistic assumption for new goods orhigh seasonality products. See e.g. [4, 15] for facility location mo<strong>de</strong>ls which do accommodatetime-<strong>de</strong>pen<strong>de</strong>nt <strong>de</strong>mand.In this talk we introduce a covering mo<strong>de</strong>l for locating facilities in a competitive environmentin which <strong>de</strong>mand is time-<strong>de</strong>pen<strong>de</strong>nt. This implies that, as e.g. in [4], not only the facility∗ Partially supported by projects BFM2002-04525, Ministerio <strong>de</strong> Ciencia y Tecnología, Spain, and FQM-329, Junta <strong>de</strong> Andalucía,Spain
- Page 1:
PROCEEDINGS OF THEINTERNATIONAL WOR
- Page 5 and 6:
ContentsPrefaceiiiPlenary TalksYaro
- Page 7 and 8:
ContentsviiFuh-Hwa Franklin Liu, Ch
- Page 9:
PLENARY TALKS
- Page 12 and 13:
4 Yaroslav D. Sergeyevto work with
- Page 15:
EXTENDED ABSTRACTS
- Page 18 and 19: 10 Bernardetta Addis and Sven Leyff
- Page 20 and 21: 12 Bernardetta Addis and Sven Leyff
- Page 22 and 23: 14 Bernardetta Addis and Sven Leyff
- Page 24 and 25: 16 Bernardetta Addis, Marco Locatel
- Page 26 and 27: 18 April K. Andreas and J. Cole Smi
- Page 28 and 29: 20 April K. Andreas and J. Cole Smi
- Page 30 and 31: 22 April K. Andreas and J. Cole Smi
- Page 32 and 33: 24 Charles Audet, Pierre Hansen, an
- Page 34 and 35: 26 Charles Audet, Pierre Hansen, an
- Page 36 and 37: 28 Charles Audet, Pierre Hansen, an
- Page 38 and 39: 30 János Balogh, József Békési,
- Page 40 and 41: 32 János Balogh, József Békési,
- Page 42 and 43: 34 János Balogh, József Békési,
- Page 44 and 45: 36 Balázs Bánhelyi, Tibor Csendes
- Page 47 and 48: Proceedings of GO 2005, pp. 39 - 45
- Page 49 and 50: MGA Pruning Technique 41Figure 1. A
- Page 51 and 52: MGA Pruning Technique 43O(n) = k 2
- Page 53: MGA Pruning Technique 45one), while
- Page 56 and 57: 48 Edson Tadeu Bez, Mirian Buss Gon
- Page 58 and 59: 50 Edson Tadeu Bez, Mirian Buss Gon
- Page 60 and 61: 52 Edson Tadeu Bez, Mirian Buss Gon
- Page 62 and 63: 54 R. Blanquero, E. Carrizosa, E. C
- Page 64 and 65: 56 R. Blanquero, E. Carrizosa, E. C
- Page 66 and 67: 58 Sándor Bozókiwhere for any i,
- Page 70 and 71: 62 Emilio Carrizosa, José Gordillo
- Page 72 and 73: 64 Emilio Carrizosa, José Gordillo
- Page 75 and 76: Proceedings of GO 2005, pp. 67 - 69
- Page 77: Globally optimal prototypes 69Refer
- Page 80 and 81: 72 Leocadio G. Casado, Eligius M.T.
- Page 82 and 83: 874 Leocadio G. Casado, Eligius M.T
- Page 84 and 85: 76 Leocadio G. Casado, Eligius M.T.
- Page 86 and 87: 78 András Erik Csallner, Tibor Cse
- Page 88 and 89: 80 András Erik Csallner, Tibor Cse
- Page 90 and 91: 82 Tibor Csendes, Balázs Bánhelyi
- Page 92 and 93: 84 Tibor Csendes, Balázs Bánhelyi
- Page 94 and 95: 86 Bernd DachwaldFor spacecraft wit
- Page 96 and 97: 88 Bernd Dachwaldcurrent target sta
- Page 98 and 99: 90 Bernd Dachwaldreference launch d
- Page 100 and 101: 92 Mirjam Dür and Chris TofallisMo
- Page 102 and 103: 94 Mirjam Dür and Chris Tofallis2.
- Page 104 and 105: 96 Mirjam Dür and Chris Tofallis[3
- Page 106 and 107: 98 José Fernández and Boglárka T
- Page 108 and 109: 100 José Fernández and Boglárka
- Page 110 and 111: 102 José Fernández and Boglárka
- Page 112 and 113: 104 Erika R. Frits, Ali Baharev, Zo
- Page 114 and 115: 106 Erika R. Frits, Ali Baharev, Zo
- Page 116 and 117: 108 Erika R. Frits, Ali Baharev, Zo
- Page 118 and 119:
110 Juergen Garloff and Andrew P. S
- Page 120 and 121:
112 Juergen Garloff and Andrew P. S
- Page 123 and 124:
Proceedings of GO 2005, pp. 115 - 1
- Page 125 and 126:
Global multiobjective optimization
- Page 127 and 128:
Global multiobjective optimization
- Page 129 and 130:
Proceedings of GO 2005, pp. 121 - 1
- Page 131 and 132:
Conditions for ε-Pareto Solutions
- Page 133:
Conditions for ε-Pareto Solutions
- Page 136 and 137:
128 Eligius M.T. Hendrix1.1 Effecti
- Page 138 and 139:
130 Eligius M.T. Hendrix4h(x)3.532.
- Page 140 and 141:
132 Eligius M.T. Hendrixneighbourho
- Page 142 and 143:
134 Kenneth Holmströmcomputed by R
- Page 144 and 145:
136 Kenneth Holmströmα(x) =∑i=1
- Page 146 and 147:
138 Kenneth HolmströmGL-step Phase
- Page 148 and 149:
140 Kenneth Holmströmsurrogate mod
- Page 150 and 151:
142 Dario Izzo and Mihály Csaba Ma
- Page 152 and 153:
144 Dario Izzo and Mihály Csaba Ma
- Page 154 and 155:
146 Dario Izzo and Mihály Csaba Ma
- Page 156 and 157:
148 Leo Liberti and Milan DražićV
- Page 158 and 159:
150 Leo Liberti and Milan Dražićs
- Page 161 and 162:
Proceedings of GO 2005, pp. 153 - 1
- Page 163 and 164:
Set-covering based p-center problem
- Page 165 and 166:
Set-covering based p-center problem
- Page 167 and 168:
Proceedings of GO 2005, pp. 159 - 1
- Page 169 and 170:
On the Solution of Interplanetary T
- Page 171 and 172:
On the Solution of Interplanetary T
- Page 173 and 174:
Proceedings of GO 2005, pp. 165 - 1
- Page 175 and 176:
Parametrical approach for studying
- Page 177 and 178:
Parametrical approach for studying
- Page 179 and 180:
Proceedings of GO 2005, pp. 171 - 1
- Page 181 and 182:
An Interval Branch-and-Bound Algori
- Page 183 and 184:
An Interval Branch-and-Bound Algori
- Page 185 and 186:
Proceedings of GO 2005, pp. 177 - 1
- Page 187 and 188:
A New approach to the Studyof the S
- Page 189:
A New approach to the Studyof the S
- Page 192 and 193:
184 Katharine M. Mullen, Mikas Veng
- Page 194 and 195:
186 Katharine M. Mullen, Mikas Veng
- Page 196 and 197:
188 Katharine M. Mullen, Mikas Veng
- Page 198 and 199:
190 Niels J. Olieman and Eligius M.
- Page 200 and 201:
192 Niels J. Olieman and Eligius M.
- Page 202 and 203:
194 Niels J. Olieman and Eligius M.
- Page 204 and 205:
196 Andrey V. Orlovwhere A is (m 1
- Page 206 and 207:
198 Andrey V. OrlovStep 4. Beginnin
- Page 208 and 209:
200 Blas Pelegrín, Pascual Fernán
- Page 210 and 211:
202 Blas Pelegrín, Pascual Fernán
- Page 212 and 213:
204 Blas Pelegrín, Pascual Fernán
- Page 214 and 215:
206 Blas Pelegrín, Pascual Fernán
- Page 216 and 217:
208 Deolinda M. L. D. Rasteiro and
- Page 218 and 219:
210 Deolinda M. L. D. Rasteiro and
- Page 220 and 221:
212 Deolinda M. L. D. Rasteiro and
- Page 222 and 223:
214 José-Oscar H. Sendín, Antonio
- Page 224 and 225:
216 José-Oscar H. Sendín, Antonio
- Page 226 and 227:
218 José-Oscar H. Sendín, Antonio
- Page 228 and 229:
220 Ya. D. Sergeyev and D. E. Kvaso
- Page 230 and 231:
222 Ya. D. Sergeyev and D. E. Kvaso
- Page 232 and 233:
224 Ya. D. Sergeyev and D. E. Kvaso
- Page 234 and 235:
226 J. Cole Smith, Fransisca Sudarg
- Page 236 and 237:
228 J. Cole Smith, Fransisca Sudarg
- Page 238 and 239:
230 J. Cole Smith, Fransisca Sudarg
- Page 240 and 241:
232 Fazil O. Sonmezcost of a config
- Page 242 and 243:
234 Fazil O. Sonmezhere f h is the
- Page 244 and 245:
236 Fazil O. SonmezThe optimal shap
- Page 246 and 247:
238 Alexander S. StrekalovskyDevelo
- Page 249 and 250:
Proceedings of GO 2005, pp. 241 - 2
- Page 251 and 252:
PSfrag replacementsPruning a box fr
- Page 253 and 254:
Pruning a box from Baumann point in
- Page 255 and 256:
Proceedings of GO 2005, pp. 247 - 2
- Page 257 and 258:
A Hybrid Multi-Agent Collaborative
- Page 259 and 260:
A Hybrid Multi-Agent Collaborative
- Page 261 and 262:
Proceedings of GO 2005, pp. 253 - 2
- Page 263:
Improved lower bounds for optimizat
- Page 266 and 267:
258 Graham R. Wood, Duangdaw Sirisa
- Page 268 and 269:
260 Graham R. Wood, Duangdaw Sirisa
- Page 270 and 271:
262 Graham R. Wood, Duangdaw Sirisa
- Page 272 and 273:
264 Yinfeng Xu and Wenqiang Daiopti
- Page 274 and 275:
266 Yinfeng Xu and Wenqiang DaiThe
- Page 277 and 278:
Author IndexAddis, BernardettaDipar
- Page 279:
Author Index 271Nasuto, S.J.Departm