Information Systems Review (경영정보학연구)

The Korea Society of Management Information Systems (한국경영정보학회)
권호 표지

On Implementing a Hybrid Solver from Constraint Programming and Optimization

제약식프로그래밍과 최적화를 이용한 하이브리드 솔버의 구현

  • Published : 2003.12.31
Download PDF
⟨ Previous Next ⟩

Abstract

Constraint Programming and Optimization have developed in different fields to solve common problems in real world. In particular, constraint propagation and linear Programming are their own fundamental and complementary techniques with the potential for integration to benefit each other. This intersection has evoked the efforts to combine both for a solution method to combinatorial optimization problems. Attempts to combine them have mainly focused on incorporating either technique into the framework of the other with traditional models left intact. This paper argues that integrating both techniques into an old modeling fame loses advantages from another and the integration should be molded in a new framework to be able to exploit advantages from both. The paper propose a declarative modeling framework in which the structure of the constraints indicates how constraint programming and optimization solvers can interact to solve problems.

제약식 프로그래밍과 최적화 솔버는 공통된 문제를 풀기 위한 해법으로서 서로 다른 영역에서 발전되어왔다. 특히 제약식 확산법과 선형 계획법은 두 영역의 주된 기법으로서 조합 최적화 문제를 푸는데 함께 사용될 수 있는 통합가능한 보완 기법들이다. 지금까지 이를 통합하기 위한 시도는 주로 한 기법을 다른 기법의 모형 틀안에 포함시키는 것이었다. 본 논문은 둘의 통합을 통한 잇점들은 충분히 사용하기 위해서는 모형 역시 통합될 필요가 있음과 그 모형 통합의 틀을 보이고 그 틀 안에서 어떻게 두 기법의 솔버의 수준으로 통합되어 새로운 혼합 솔버를 구축할 수 있는지를 보인다.

Keywords

References

  1. Benders, J. F., 'Partitioning procedures for solving mixed-variables programming problems', Numer. Math., 4: 238-252, 1962
  2. Beringer, H. and B. De Backer, 'Combinatorial problem solving in constraint logic programming with cooperating solvers', Logic Programming: Formal Methods and Practical Applications (C. Beierle and L. Plumer eds.), Studies in Computer Science and Artificial Intelligence, Elsevier 1995
  3. Bockmayr, A. and T. Kasper, Branch-and-infer: A unifying framework for integer and finite domain constraint programming', INFORMS J. Computing, 10(3): 287-300, 1998
  4. Darby-Dowman, K. and J. Little, 'Properties of some combinatorial optimization problems and their effect on the performance of integer programming and constraint logic programming', INFORMS J. Computing, 10(3): 276-286, 1998
  5. De Backer, B. and H. Beringer, 'Intelligent backtracking for CLP languages: an application to CLP(R)', Ligic Programming, Proceedings of the 1991 International Symposium (V. Saraswat and K. Ueda eds.), 405-419, San Diego, The MIT Press 1991
  6. Dincbas, M., P. Van Hentenryek, H. Simonis, A. Aggoun and F. Berthier, 'The Constraint Logic Programming Language CHIP', Proceedings International Conference on Fifth Generation Computer Systems(FGCS- 88),693-702, Tokyo, ICOT, 1988
  7. Geoffrion, A., 'Lagrangian relaxation for integer programming', Mathematical Programming Study 2: 82-114, 1974
  8. Hajian, M., R. Rodosek and B. Richards, 'Introduction of a new class of variables to discrete and integer programming problems', Baltzer Journals, 1996
  9. Hajian, M., 'Dis-equality constraints in linear/integer programming', Technical Report, IC-Pare, 1996. Hooker, N. and M. Osorio, 'Mixed logical/linear programming', Discrete Applied Mathematics 96-97 (1-3): 395-442, 1999
  10. Hooker, N. and M. Osorio, 'Mixed logical/linear programming', Discrete Appleid Mathematics 96-97(1-3):395-442, 1999
  11. Hooker, J., H. Kim, G. Ottosson, 'A declarative modeling frameworkthat integratessolutionmethods', Annals of Operations Research, 104(1): 141-161, Baltzer Science, 2001
  12. Hooker, J., 'Logic-based methods for optimization', Principles and Practice of Constraint Programming, PPCP'94 (A. Boming ed.), Lecture Notes in Computer Science Vol. 874, S4ringer, 1994
  13. Marriott, K. and P. Stuckey, Programming with Constraints: An Introduction, MIT Press, 1998 Baltzer Journals, 1997
  14. Rodosek, R., M. Wallace and M. Hajian, 'A new approach to integrating mixed integer programming and constraint logic programming', Baltzer Journals, 1997
  15. Smith, B., S. Brailsford, P. Hubbard and H. P. Williams, 'The prograssive Party Problem: Integer Linear Progamming and Constraint Programming Compared', Proceedings 1st International Conference on Principles and Practice of Constraint Programming, CP95, 1995
  16. Tsang, E., Foundations of Constraint Satisfaction, Academic Press, 1993
  17. Swedish Institute of Computer Science, SICStus Prolog User's Manual, URL http://www.sics.se/sicstus, 1995