Constraint satisfaction problems: Algorithms and applications

Brailsford, Sally C.; Potts, Chris N.; Smith, Barbara M.

doi:10.1016/s0377-2217(98)00364-6

Cited by 291 publications

(154 citation statements)

References 30 publications

Supporting

Mentioning

144

Contrasting

Unclassified

Order By: Relevance

“…One of the examples is Chan and Hu [7] who employed constraint programming to propose precast production scheduling model that incorporates the key constraints and objectives considered by production scheduler. Another work was established by Brailsford [8] who discussed and compared the advantages of constraint programming method for solving constraint satisfaction problems, such as timetabling and roistering problem. Rodriguez [9] proposed a constraint programming model for the routing and scheduling of trains running through a junction to assist operator in changing train routes or order to avoid conflicts and delays.…”

Section: Literature Reviewmentioning

confidence: 99%

“…The total budget spent in 10 years in this scenario is approximately 8.1 billion rupiahs. In Scenario 2, the model is modified by removing equation (7) and adding equation (8). This scenario aims to require all buildings must be greater than the minimum acceptable condition at the end of the period.…”

Section: Figure 2 Buildings Condition Performance Of Five Buildings Imentioning

confidence: 99%

See 1 more Smart Citation

Condition-Based Building Maintenance Strategy Selection Using Constraint Programming

Liu¹,

Ramadhan²

2017

Proceedings of the International Symposium on Automation and Robotics in Construction (IAARC)

View full text Add to dashboard Cite

Abstract-Naturally, buildings will deteriorate during its life cycle. On the other hand, sustainability of building condition is the main objective of providing service for users. Therefore, building maintenance management should be a priority to achieve that objective. In Indonesia, there are many public buildings with different conditions and some of them are not in optimal conditions demanding urgent maintenance treatment. In addition, limited budget and absence of building maintenance decisionmaking tool are among factors causing unmanaged maintenance activities. Moreover, agencies must allocate maintenance budget and prioritize buildings maintenance manually. This paper proposes an optimization mathematical model which adopts Constraint Programming (CP) formulation to assist in selecting the most cost-effective strategy for particular building and determining budget allocation each year. CP is famous on its flexibility to problem declaration that makes scenario analysis conduct effectively. This CP-based model subjects to budget constraint and required condition level. In this case, budget, maintenance strategy options, building deterioration rate, time period, and minimum acceptable building condition are set. There are four maintenance strategy options available, Light Repair, Rehabilitation, Renovation, and Restoration which have different improvement impact for each strategy. Therefore, a case study is conducted to implement the model which involves 15 buildings in a 10-year time of period and two scenarios are presented in this proposed model. The result shows that the two scenarios allocate annual maintenance budget differently depending on diversities of planner management goals.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Section: Figure 2 Buildings Condition Performance Of Five Buildings Imentioning

confidence: 99%

Condition-Based Building Maintenance Strategy Selection Using Constraint Programming

Liu¹,

Ramadhan²

2017

Proceedings of the International Symposium on Automation and Robotics in Construction (IAARC)

View full text Add to dashboard Cite

show abstract

“…A feasible solution to a CSP is the assignment of all variables with a values such that no constraint is violated [14]. If a solution can satisfy all constraints imposed on the design, the organization design may be feasible.…”

Section: Program Organizational Structure Determinationmentioning

confidence: 99%

A Feasible Program Organizational Architecture Framework

Alblawi¹,

Stracener²,

Williams³

2017

IJET

View full text Add to dashboard Cite

Abstract-A feasible program schedule and personnel allocation model may contribute to identifying the final shape of a program organization. If a program organizational design can be shown to be constructed such that it will satisfy the requirements without violating the constraints, then the design may be considered a feasible solution. This paper targets program organizations that are capable of designing and developing complex products. The approach in this paper builds upon the results of the Program Organizational Architecture Framework (POAF). We utilize constraint programming in order to extend the architecture framework and find a feasible design. Important decision variables and constraints are considered in this study. A hypothetical scenario of an ongoing program is presented to demonstrate that a given program organizational design is a feasible solution. This approach enables the program designers to support the decision-making process of implementing an effective program organizational design to manage a complex system and select the "best" program organizational structure.Index Terms-Constraint programming, complex products, systems engineering management, organizational development.

show abstract

“…The strategy of maintaining arc consistency, denoted MAC, is an intelligent search algorithm, which use the information on the value that assume variables for generating backtracking on possible range of the other variables, for more details of the MAC we refer the reader to [4,16,32,22].…”

Section: Algorithmsmentioning

confidence: 99%

A hybrid algorithm for the robust graph coloring problem

Gutiérrez¹,

Rodríguez²,

García³

et al. 2016

RMTA

View full text Add to dashboard Cite

A hybrid algorithm which combines mathematical programming techniques (Kruskal's algorithm and the strategy of maintaining arc consistency to solve constraint satisfaction problem "CSP") and heuristic methods (musical composition method and DSATUR) to resolve the robust graph coloring problem (RGCP) is proposed in this paper. Experimental result shows that this algorithm is better than the other algorithms presented on the literature.Keywords: metaheuristics; combinatorial optimization; integer programming. ResumenEn este artículo se propone un algoritmo híbrido que combina técni-cas de programación matemática (algoritmo de Kruskal y la estrategia de mantener consistencia de arcos para resolver el problema de satisfacción de restricciones) y métodos heurísticos (método de composición musical y DSATUR) para resolver el problema de coloración robusta de gráfi-cas (RGCP). Resultados experimentales muestran que este algorimo da mejores resultados que otros presentados en la literatura.

show abstract

Constraint satisfaction problems: Algorithms and applications

Cited by 291 publications

References 30 publications

Condition-Based Building Maintenance Strategy Selection Using Constraint Programming

Condition-Based Building Maintenance Strategy Selection Using Constraint Programming

A Feasible Program Organizational Architecture Framework

A hybrid algorithm for the robust graph coloring problem

Contact Info

Product

Resources

About