Industrial Engineering and Management Systems

  • 제8권1호
  • /
  • Pages.29-36
  • /
  • 2009
  • /
  • 1598-7248(pISSN)
  • /
  • 2234-6473(eISSN)
대한산업공학회 (Korean Institute of Industrial Engineers)
권호 표지

Multi-Exchange Neighborhood Search Heuristics for the Multi-Source Capacitated Facility Location Problem

  • Chyu, Chiuh-Cheng (Department of Industrial Engineering and Management Yuan-Ze University) ;
  • Chang, Wei-Shung (Department of Industrial Engineering and Management Yuan-Ze University)
  • 투고 : 2008.07.17
  • 심사 : 2008.09.08
  • 발행 : 2009.03.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

We present two local-search based metaheuristics for the multi-source capacitated facility location problem. In such a problem, each customer's demand can be supplied by one or more facilities. The problem is NP-hard and the number of locations in the optimal solution is unknown. To keep the search process effective, the proposed methods adopt the following features: (1) a multi-exchange neighborhood structure, (2) a tabu list that keeps track of recently visited solutions, and (3) a multi-start to enhance the diversified search paths. The transportation simplex method is applied in an efficient manner to obtain the optimal solutions to neighbors of the current solution under the algorithm framework. Two in-and-out selection rules are also proposed in the algorithms with the purpose of finding promising solutions in a short computational time. Our computational results for some of the benchmark instances, as well as some instances generated using a method in the literature, have demonstrated the effectiveness of this approach.

키워드

참고문헌

  1. Aart, E. H. L. and Korst, J. H. M. (1991), Simulated annealing Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing. John Wiley, Chichester
  2. Ahuja, R. K., Liu, J., Orlin, J. B., Goodstein, J., and Mukherjee, A. (2004). A neighborhood search algorithm for the combined through and fleet assignment model with time windows, Networks, 44(2), 160-171 https://doi.org/10.1002/net.20026
  3. Arostegui, Jr., M. A., Kadipasaoglu, S. N., and Khumawala, B. M. (2006), An empirical comparison of tabu search, simulated annealing, and genetic algorithms for facilities location problems, International Journal of Production Economics, 103(2), 742-754 https://doi.org/10.1016/j.ijpe.2005.08.010
  4. Barahona, F., Anbil, R. (2000), The volume algorithm: Producing primal solutions with a subgradient method, Mathematical Programming, Series B 87(3), 385-399 https://doi.org/10.1007/s101070050002
  5. Barahona, F. and Chudak, F. A. (2005), Near-optimal solutions to large-scale facility location problems, Discrete Optimization, 2(1), 35-50 https://doi.org/10.1016/j.disopt.2003.03.001
  6. Beasley, J. E. (1993), Lagrangian heuristics for location problems, European Journal of Operational Research, 65(3), 383-399 https://doi.org/10.1016/0377-2217(93)90118-7
  7. Cortinhal, M. J., Captivo, M. E. (2003), Upper and lower bounds for the single source capacitated location problem, European Journal of Operational Research, 151(2), 333-351 https://doi.org/10.1016/S0377-2217(02)00829-9
  8. Holmberg, K., Rönnqvist, M., and Yuan, D. (1999), An exact algorithm for the capacitated facility location problems with single sourcing, European Journal of Operational Research, 113(3), 544-559 https://doi.org/10.1016/S0377-2217(98)00008-3
  9. Klose, A. and Drexl, A., (2005), Lower bounds for the capacitated facility location problem based on column generation, Management Science, 51(11), 1689-1705 https://doi.org/10.1287/mnsc.1050.0410
  10. Korupolu, M. R., Plaxton, C. G., Rajaraman, R. (2000), Analysis of a local search heuristic for facility location problems, Journal of Algorithms, 37(1), 146-188 https://doi.org/10.1006/jagm.2000.1100
  11. Lenstra, J. K., Rinnooy Kan, A. H. G. (1978), Complexity of scheduling under precedence constraints, Operations Research, 26(1), 22-35 https://doi.org/10.1287/opre.26.1.22
  12. Pirkul, H. (1987), Efficient algorithms for capacitated concentrator location problem, computers and operations Research, 14(3), 197-208 https://doi.org/10.1016/0305-0548(87)90022-0
  13. Sridharan, R. (1993), A Lagrangian heuristic for the capacitatedplant location problem with single source constraints, European Journal of Operational Research, 66(3), 305-312 https://doi.org/10.1016/0377-2217(93)90219-D
  14. Sridharan R. (1995), The capacitated plant location problem, European Journal of Operational Research, 87 (2), 203-213 https://doi.org/10.1016/0377-2217(95)00042-O
  15. Teitz, M. B. and Bart, P. (1968), Heuristic methods for estimating the generalized vertex median of a weighted graph, Operations Research, 16(5), 955-961 https://doi.org/10.1287/opre.16.5.955