This document represents the proceedings of the 2024 XCSP3 Competition. The results of this competition of constraint solvers were presented at CP'24 (30th International Conference on Principles and Practice of Co...
详细信息
In this paper, we study the nurse rostering problem that considers multiple units and many soft time-related constraints. An efficient branch and price solution approach that relies on a fast algorithm to solve the pr...
详细信息
Optimization plays an important role in various disciplines of engineering. Multi-objective optimization is usually characterized by a Pareto front. In large scale multiobjective optimization problems, determining an ...
详细信息
ISBN:
(纸本)9781509018987
Optimization plays an important role in various disciplines of engineering. Multi-objective optimization is usually characterized by a Pareto front. In large scale multiobjective optimization problems, determining an optimal Pareto front consumes large time. Thus, parallel computing is used to speed up the search. constraint programming is one of the logic-based optimization techniques for solving combinatorial optimization problems. In our previous study, we proposed the multi-objective embarrassingly parallel search (MO-EPS) for multi-objective constraint optimization, which combines two strategies: a constraint programmingbased strategy to determine Pareto front and a parallel search for constraint programming. In this study, we propose the MO-EPS with upper bound constraints, an extended algorithm of the MO-EPS.
the problem studied in this paper is to allocate and to sequence the elective operation on operating rooms (ORs). We develop a mixed integer linear programming (MILP) model to solve this problem. Decisions in this mod...
详细信息
ISBN:
(纸本)9781509018987
the problem studied in this paper is to allocate and to sequence the elective operation on operating rooms (ORs). We develop a mixed integer linear programming (MILP) model to solve this problem. Decisions in this model include the allocation of operations to material resources and human resources, the starting time of them and the starting time for each surgeon. To show the efficiency of this model, we decide to compare it with a constraints programming (CP) approach. The performance of these models is tested using a benchmark of the literature. The results indicate the efficiency of the MILP model compared with the CP model in terms of computational time.
This article presents a method for extracting a conceptual schema from a relational database. The method is based on an analysis of data manipulation statements in the code of an application using a relational DBMS. A...
详细信息
This article presents a method for extracting a conceptual schema from a relational database. The method is based on an analysis of data manipulation statements in the code of an application using a relational DBMS. Attributes representing references between tables in the relational schema and possible keys are determined by an analysis of join conditions in queries and view definitions. Knowledge about which attributes link tables is used to investigate the database extension in a selective manner. When the keys cannot be unambiguously determined, possible solutions are generated by the system under guidance of the user. The approach makes it possible to efficiently construct a conceptual schema from only rudimentary information.
Automata, possibly with counters, allow many constraints to be expressed in a simple and high-level way. An automaton induces a decomposition into a conjunction of already implemented constraints. Generalised arc cons...
详细信息
ISBN:
(纸本)9781479929733
Automata, possibly with counters, allow many constraints to be expressed in a simple and high-level way. An automaton induces a decomposition into a conjunction of already implemented constraints. Generalised arc consistency is not generally maintained on decompositions induced by counter automata with more than one state or counter. To improve propagation of automaton-induced constraint decompositions, we use automated tools to derive loop invariants from the constraint checker corresponding to the given automaton. These loop invariants correspond to implied constraints, which can be added to the decomposition. We consider two global constraints and derive implied constraints to improve propagation even to the point of maintaining generalised arc consistency.
A nurse rostering problem(NRP) deals with the shifts arrangements of nursing staff in the daily operation of a given health care *** problem is known to be complex mainly due to its combinatorial nature that commonly ...
详细信息
A nurse rostering problem(NRP) deals with the shifts arrangements of nursing staff in the daily operation of a given health care *** problem is known to be complex mainly due to its combinatorial nature that commonly requires exponential time to be *** literature presents a large list of works devoted to solve NRPs,however most of them are focused on the performance of results of well-known NRP instances,and just a few address real *** this paper we present a study of real nurse rostering,which particularly involves a very uncommon shift pattern due to proper country legal *** introduce a new model including soft constraints that can be efficiently solved by employing reified constraints.
In this paper we present work towards automating two process steps supporting the optimization of the runnable-to-task mapping in automotive multi-core control units. We describe these steps in close relation to the A...
详细信息
ISBN:
(纸本)9781728151250
In this paper we present work towards automating two process steps supporting the optimization of the runnable-to-task mapping in automotive multi-core control units. We describe these steps in close relation to the AUTOSAR methodology to facilitate the integration with existing design processes. The first step is the automated generation of an initial configuration that balances the core utilization using constraint programming. The second step is the optimization of an existing configuration based on dynamic system behavior using an evolutionary algorithm. An abstract intermediate representation provides interoperability with existing AUTOSAR tools. We use a small case study to evaluate the feasibility of our approach.
This paper describes a development of a schedule guidance system for a slab extraction sequence from the furnace. To improve productivity, it is necessary to optimize not only the extraction sequence but also a select...
详细信息
ISBN:
(纸本)9781479978632
This paper describes a development of a schedule guidance system for a slab extraction sequence from the furnace. To improve productivity, it is necessary to optimize not only the extraction sequence but also a selection of the cooling facility. This scheduling problem is a multi-mode resource constraint project scheduling problem (multi-mode RCPSP) since it includes resource constraints and alternative processes that differ in a process time and occupied resources. The system is required to solve this problem in a short time in order to quickly redisplay a modified schedule, in which the difference between the actual and predicted process time due to an operational disturbance has been resolved. Moreover, the derived schedule from the system is expected to outperform the human operator's result in the point of productivity and have high maintainability to respond flexibly to changes in operational constraints. We investigated some methods to solve this problem. As a result, we applied constraint programming (CP) which can solve this problem in realistic time and find semi-optimal solution.
＜正＞For a Carbon-ion therapy center in the design phase,patient recruitment is one of the most important challenges that involve healthcare laws and regulations,financial management,and technical *** constraints rel...
详细信息
＜正＞For a Carbon-ion therapy center in the design phase,patient recruitment is one of the most important challenges that involve healthcare laws and regulations,financial management,and technical *** constraints related to tumor treatment protocols,priority assignment,decision making and capacity analysis should be taken into *** main objective of this research work is to identify better admission criteria that drive improved performance and optimized efficiency in the Carbon-ion therapy center.A decision support tool has been developed through constraint programming to optimize patient recruitment,which particularly belongs to online scheduling *** given periodically a list of admission demands characterized by latest beginning day,treatment priority,and number of therapy sessions with their durations,this tool is capable to generate an optimized admission list according to capacity schedule and aiming at increasing economic *** generated admission list is useful not only for planning treatment activities in the center,but also for regulating both domestic and international demands.
暂无评论