대한산업공학회지 (Journal of Korean Institute of Industrial Engineers)

  • 제31권4호
  • /
  • Pages.303-315
  • /
  • 2005
  • /
  • 1225-0988(pISSN)
  • /
  • 2234-6457(eISSN)
대한산업공학회 (Korean Institute of Industrial Engineers)
권호 표지

용량제한과 직접수송이 있는 Hub-and-Spoke 네트워크 설계: 진화알고리듬 기반의 접근법에 의해

A Design of Capacitated Hub-and-Spoke Networks with Direct Shipment: Evolutionary Algorithm based Approach

  • 이현수 (전남대학교 산업공학과) ;
  • 신경석 (전남대학교 산업공학과) ;
  • 김여근 (전남대학교 산업공학과)
  • Lee, Hyun Soo (Department of Industrial Engineering, Chonnam National University) ;
  • Shin, Kyoung Seok (Department of Industrial Engineering, Chonnam National University) ;
  • Kim, Yeo Keun (Department of Industrial Engineering, Chonnam National University)
  • 발행 : 2005.12.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

In this paper we address a design problem for hub-and-spoke networks and then consider a capacitated hub locations problem with direct shipment (CHLPwD). We determine the location of hubs, the allocation of nodes to hubs, and direct shipment paths in the network, with the objective of minimizing the total cost in the network. In this paper, CHLPwD is formulated as 0-1 integer programming. We develop an evolutionary algorithm here to solve the large sized CHLPwD. To do this, we present the representation and the genetic operators suitable for the problem and propose a heuristic method for the allocation of nodes to hubs. To enhance the search capability, problem-specific information is used in our evolutionary algorithm. The proposed algorithm is compared with the heuristic method in terms of solution quality and computation time. The experimental results show that our algorithm can provide better solutions than the heuristic.

키워드

참고문헌

  1. Aykin, T. (1994), Lagrangian relaxation based approaches to capacitated hub and spoke network design problem, European Journal of Operational Research, 79(3), 501-523 https://doi.org/10.1016/0377-2217(94)90062-0
  2. Aykin, T. (1995), The hub location and routing problem, European Journal of Operational Research, 83(1), 200-219 https://doi.org/10.1016/0377-2217(93)E0173-U
  3. Beasley J. E. (1990), OR-library: distributing test problem by electronic mail, Journal of the Operational Research, 41, 1069-1072 https://doi.org/10.1057/jors.1990.166
  4. Boland, N., Krishnamoorthy, M., Ernst, A.T. and Ebery, J. (2004), Preprocessing and cutting for multiple allocation hub location problems, European Journal of Operational Research, 155(3), 638-653 https://doi.org/10.1016/S0377-2217(03)00072-9
  5. Campbell, J.F. (1994), Integer programming formulations of discrete hub location problems, European Journal of Operational Research, 72(2), 387-405 https://doi.org/10.1016/0377-2217(94)90318-2
  6. Chung, H.Y and Kim, Y.K. (2001), Development of evolutionary algorithms for determining the k most vital arcs in shortest path problem, Journal of the Korean Operations Research and Management Science Society, 16(3), 47-58
  7. Ebery, J., Krishnamoorthy, M, Ernst, A. and Boland, N. (2000), The capacitated multiple allocation hub location problem: formulations and algorithms, European Journal of Operational Research, 120(3), 614-631 https://doi.org/10.1016/S0377-2217(98)00395-6
  8. Eiben, A. E., Raue, P. E, and Ruttkay, Zs. (1995), How to apply genetic algorithms to constrained problems. Practical Handbook of Genetic Algorithms 1 : Applications (edited by L. Chambers), 307-365. CRC Press, Boca Raton
  9. Elhedhli, S. and Hu, F.X. (2005), Hub-and-spoke network design with congestion, Computers & Operations Research, 32(6), 1615-1632 https://doi.org/10.1016/j.cor.2003.11.016
  10. Ernst, A.T. and Krishnamoorthy, M. (1999), Solution algorithms for the capacitated single allocation hub location problem, Annals of Operations Research, 86(0), 141-159 https://doi.org/10.1023/A:1018994432663
  11. Falkenauer. E., (1994), A new representation and operators for genetic algorithms applied to grouping problems. Evolutionary Computation, 2, 123-144 https://doi.org/10.1162/evco.1994.2.2.123
  12. Goldberg, D.E.(1989), Genetic Algorithms in Search, Optimization, and Machine Learning, Addison Wesley, Reading, Massachusetts
  13. Hasan, P. and Vaidyanathan, J. (1998), A multi commodity, multi plant, capacitated facility location problem: formulation and efficient heuristic solution, Computers & Operations Research, 25(10), 869-878 https://doi.org/10.1016/S0305-0548(97)00096-8
  14. Helm, S.A. and Venkataramanan, M.A. (1998), Solution approaches to hub location problems, Annals of Operations Research, 78(0), 31-50 https://doi.org/10.1023/A:1018954217758
  15. Helm, S.A. (1998), A hybrid heuristic for the uncapacitated hub location problem, European Journal of Operational Research, 106(3), 489-499 https://doi.org/10.1016/S0377-2217(97)00286-5
  16. Kim, Y. K., Hyun, C. J. (1994), Genetic Algorithms for mixed model assembly line sequencing, Journal of the Korean Institute of Industrial Engineering, 20(3), 409-428
  17. Kim, Y. K., Yun, B. S. and Lee, S. B. (1997), Metaheuristics, Yeongji Moonhwasa, Seoul, Korea
  18. Kim, Y. K, Lee, H. Y. and Kim, J. Y. (2001), An artificial adaptation model by means of endoparasitic evolution process, Journal of the Korean Institute of Industrial Engineering, 27(3), 239-249
  19. Klincewicz, J. G.(1991), Heuristics for the p hub location problem, European Journal of Operational Research, 53, 25-37 https://doi.org/10.1016/0377-2217(91)90090-I
  20. Lumsden, K., Dallari, F. and Ruggeri, R. (1999), Improving the efficiency of the hub and spoke system for the SKF European distribution network, International Journal of Physical Distribution & Logistics Management, 29(1/2), 50-64 https://doi.org/10.1108/09600039910253878
  21. Melkote, S. and Daskin, M,S. (2001), Capacitated facility location/network design problems, European Journal of Operational Research, 129(3), 481-495 https://doi.org/10.1016/S0377-2217(99)00464-6
  22. Michalewicz, Z. (1999), Genetic Algorithms + Data Structures = Evolution Programs, the forth edition, Springer Verlag
  23. O'Kelly, M.E. (1987), A quadratic integer program for the location of interacting hub facilities, European Journal of Operational Research, 32(3), 393-404 https://doi.org/10.1016/S0377-2217(87)80007-3
  24. Pagie, L., and Hogeweg, P. (1998), Evolutionary consequences of coevolving targets, Evolutionary Computation 5(4), 401-418 https://doi.org/10.1162/evco.1997.5.4.401
  25. Skorin Kapov, D. and Skorin Kapov, J. (1994), On tabu search for the location of interacting hub facilities, European Journal of Operational Research, 73(3), 502-509 https://doi.org/10.1016/0377-2217(94)90245-3
  26. Skorin Kapov, D? Skorin Kapov, J., and O'Kelly, M. (1996), Tight linear programming relaxations of uncapacitated p hub median problems, European Journal of Operational Research 94(3), 582-593 https://doi.org/10.1016/0377-2217(95)00100-X
  27. Topcuoglu, H., Corut, F., Ermis, M. and Yilmaz, G. (2005), Solving the uncapacitated hub location problem using genetic algorithms, Computer and Operations Research, 32(4), 967-984 https://doi.org/10.1016/j.cor.2003.09.008
  28. Zpfel, G. and Wasner, M. (2002), Planning and optimization of hub-and-spoke transportation network of cooperative third-party logistics providers, International Journal of Production Economics, 78(2), 207-220 https://doi.org/10.1016/S0925-5273(00)00152-3