Management Science and Financial Engineering

  • 제10권2호
  • /
  • Pages.89-102
  • /
  • 2004
  • /
  • 2287-2043(pISSN)
  • /
  • 2287-2361(eISSN)
한국경영과학회 (The Korean Operations Research and Management Science Society)
권호 표지

A Processor Assignment Problem for ATM Switch Configuration

  • Han, Junghee (College of Business Administration, Kangwon National University) ;
  • Lee, YoungHo (Department of Industrial Systems and Information Engineering, Korea University)
  • 발행 : 2004.11.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

In this paper, we deal with a processor assignment problem that minimizes the total traffic load of an ATM switch controller by optimally assigning processors to ATM interface units. We develop an integer programming (IP) model for the problem, and devise an effective tabu search heuristic. Computational results reveal the efficacy of the proposed tabu search procedure, finding a good quality solution within 5% of optimality gap.

키워드

참고문헌

  1. CPLEX, Using the CPLEX Callable Library, Version 9.0, ILOG, Inc., 2004
  2. Adil, G. K. and J. B. Ghosh, 'Analysis of Lagrangian lower bounds for a graph partitioning problem,' Operations Research 47 (1999), 785-788 https://doi.org/10.1287/opre.47.5.785
  3. Ahuja, R. K., T. L. Magnanti, and J. B. Orlin, Network Flows, Prentice Hall, New Jersey, 1993
  4. Banos, R., C. Gil, J. Ortega and F. G. Montoya, 'A parallel multilevel metatheuristic for graph partitioning,' Journal of Heuristics 10 (2004), 315-336 https://doi.org/10.1023/B:HEUR.0000026898.11874.e7
  5. Bui, T. N. and B. R. Moon, 'Genetic algorithm and graph partitioning,' IEEE Transaction on Computers 45(1996), 841-855 https://doi.org/10.1109/12.508322
  6. Gil, C., J. Ortega, M. G. Montoya, and R. Banos, 'A mixed heuristic for circuit partitioning,' Computational Optimization and Applications 23(2002), 321-340 https://doi.org/10.1023/A:1020551011615
  7. Glover, F. and M. Laguna, Tabu Search, Kluwer Academic Publishers, Boston, 1997
  8. Kernighan, B. and S. Lin, 'An efficient heuristic procedure for partitioning graphs,' Bell Systems Technical Journal 49 (1970), 291-307 https://doi.org/10.1002/j.1538-7305.1970.tb01770.x
  9. Kim, Y. H. and B. R. Moon, 'Lock-gain based graph partitioning,' Journal of Heuristics 10 (2004), 37-57 https://doi.org/10.1023/B:HEUR.0000019985.94952.eb
  10. Kirkpatrick, S., C. D. Gelatt Jr. and M. P. Vecchi, 'Optimization by simulated annealing,' Science 220 (1983), 671-680 https://doi.org/10.1126/science.220.4598.671
  11. Minoux, M., 'On some large-scale L P relaxations for the graph partitioning problem and their optimal solutions,' Annals of Operations Research 58 (1995), 143-154 https://doi.org/10.1007/BF02032129
  12. Myung, Y. S, 'The graph partition problem,' Journal of the Korean Operations Research and Management Science Society 28 (2003), 131-143.
  13. Randall, M. and A. Abramson, 'A parallel tabu search algorithm for combinatorial optimization problems,' In Proceedings of 6th Australasian Conference on Parallel and Real Time Systems, Springer-Verlag, (1999), 68-79
  14. Tu, C. C., C. K. Shieh, and H. Cheng, 'Algorithms for graph partitioning problems by means of eigenspace relaxations,' European Journal of Operational Research 123 (2000), 86-104 https://doi.org/10.1016/S0377-2217(99)00060-0
  15. Vigo, D. and V. Maniezzo, 'A genetic/tabu thresholding hybrid algorithm for the process allocation problem,' Journal of Heuristic 3(1997), 91-110 https://doi.org/10.1023/A:1009676913040
  16. WCDMA system architecture group, Technical description of WCDMA RNC system, LG Electronics, Inc., 2002
  17. Wiangtong, T., P. Cheung and W. Luk, 'Comparing three heuristic search methods for functional partitioning in hardware-software codesign,' Design Automation for Embedded Systems 6 (2002), 425-449 https://doi.org/10.1023/A:1016567828852
  18. 3GPP, http://www.3gpp.org/ftp/Specs/html-info/25-series.htm. 2004