• Journal of the Korea Society of Computer and Information
• /
• v.26 no.12
• /
• pp.29-43
• /
• 2021

In this paper, a new approach to solve the constrained dynamic programming is proposed by using the constraint programming. While the conventional dynamic programming scheme has the state space augmented with states on constraints, this approach, without state augmentation, represents states of constraints as domains in a contraining programming solver. It has a hybrid computational mechanism in its computation by combining solving the Bellman equation in the dynamic programming framework and exploiting the propagation and inference methods of the constraint programming. In order to portray the differences of the two approaches, this paper solves a simple version of the long-term car rental financing problem. In the conventional scheme, data structures for state on constraints are designed, and a simple inference borrowed from the constraint programming is used to the reduction of violation of constraints because no inference risks failure of a solution. In the hybrid approach, the architecture of interface of the dynamic programming solution method and the constraint programming solution method is shown. It finally discusses the advantages of the proposed method with the conventional method.

• Information Systems Review
• /
• v.5 no.2
• /
• pp.203-217
• /
• 2003

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.

• Journal of Intelligence and Information Systems
• /
• v.12 no.4
• /
• pp.73-90
• /
• 2006

When a consumer intends to purchase products through Internet stores, many difficulties are met because of limitations of the current search engines and the current web structure, and lack of tools supporting decision-makings. This paper raises an Internet shopping problem and proposes a framework of decision making process to settle it with an intelligent agent based on Semantic Web and Finite Domain Constraint. The agent uses finite domain constraint programming as modeling and solution methods for the decision problem under the Semantic Web environment.

• Journal of Intelligence and Information Systems
• /
• v.10 no.2
• /
• pp.165-187
• /
• 2004

Constraint Programming in AS and Optimization in OR started and have grown in different backgrounds to solve common decision-making problems in real world. This paper tries to integrate results from those different fields by suggesting a hybrid solver as an integration framework. Starting with an integrating modeling language, a way to implement a hybrid solver will be discussed using Warren's abstract machine and an finite domain constraint programming solver structures. This paper will also propose some issues rising when implementing the hybrid solver and provide their solutions.

• Journal of Information Technology Applications and Management
• /
• v.23 no.2
• /
• pp.61-80
• /
• 2016

The wireless mesh network (WMN) is a next-generation technology for data networking that has the advantage in cost and the flexibility in its construction because of not requiring the infra-structure such as the ethernet. This paper focuses on the optimal link scheduling problem under the wireless mesh network to effectuate real-time streaming by using the constraint programming. In particular, Under the limitation of half-duplex transmission in wireless nodes, this paper proposes a solution method to minimize the makespan in scheduling packet transmission from wireless nodes to the gateway in a WMN with no packet transmission conflicts due to the half-duplex transmission. It discusses the conflicts in packet transmission and deduces the condition of feasible schedules, which defines the model for the constraint programming. Finally it comparatively shows and discusses the results using two constraint programming solvers, Gecode and the IBM ILOG CP solver.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.9
• /
• pp.47-55
• /
• 2010

Linear constraint satisfaction optimization problem is a kind of combinatorial optimization problem involving linearly expressed objective function and complex constraints. Integer programming is known as a very effective technique for such problem but require very much time and memory until finding a suboptimal solution. In this paper, we propose a method to improve the search performance by integrating local search and integer programming. Basically, simple hill-climbing search, which is the simplest form of local search, is used to solve the given problem and integer programming is applied to generate a neighbor solution. In addition, constraint programming is used to generate an initial solution. Through the experimental results using N-Queens maximization problems, we confirmed that the proposed method can produce far better solutions than any other search methods.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.6
• /
• pp.26-32
• /
• 2016

Usually, there are many uncertainties regarding the error of an assumed load, material properties, member size, and structure analysis in a structure, and it may have a direct influence on the qualities of optimal design of structures. Probabilistic analysis has developed rapidly into a desirable process and structural reliability analysis is an increasingly important tool that assists engineers to consider uncertainties during the design, construction and life of a structure to calculate its probability of failure. This study deals with the applications of two optimization techniques to solve the reliability-based optimization problem of structures. The reliability-based optimization problem was formulated as a minimization of the structural volume subject to the constraints on the values of componential reliability index determined by the AFOSM approach. This presented method may be a useful tool for the reliability-based design optimization of structures.

• Composites Research
• /
• v.37 no.3
• /
• pp.170-178
• /
• 2024

This study proposes a hybrid composite where a thin copper film (Cu film) is embedded in carbon fiber reinforced plastic (CFRP), and quantum annealing is applied to derive the combination of Cu film placement that maximizes the through-thickness thermal conductivity. The correlation between each ply of CFRP and the Cu film is analyzed through finite element analysis, and based on the results, a combination optimization problem is formulated. A formalization process is conducted to embed the defined problem into quantum annealing, resulting in the formulation of objective functions and constraints regarding the quantity of Cu films that can be inserted into each ply of CFRP. The formulated equations are programmed using Ocean SDK (Software Development Kit) and Leap to be embedded into D-Wave quantum annealer. Through the quantum annealing process, the optimal arrangement of Cu films that satisfies the maximum through-thickness thermal conductivity is determined. The resulting arrangements exhibit simpler patterns as the quantity of insertable Cu films decreases, while more intricate arrangements are observed as the quantity increases. The optimal combinations generated according to the quantity of Cu film placement illustrate the inherent thermal conductivity pathways in the thickness direction, indicating that the transverse placement freedom of the Cu film can significantly affect the results of through-thickness thermal conductivity.