Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "constraint logic programming" wg kryterium: Temat


Tytuł:
Models and tools for improving efficiency in Constraint Logic Programming
Autorzy:
Ligęza, A.
Tematy:
constraint satisfaction problem (CSP)
constraint programming
constraint logic programming
Pokaż więcej
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Powiązania:
https://bibliotekanauki.pl/articles/375886.pdf  Link otwiera się w nowym oknie
Opis:
Constraint Satisfaction Problems typically exhibit strong combinatorial explosion. In this paper we present some models and techniques aimed at improving efficiency in Constraint Logic Programming. A hypergraph model of constraints is presented and an outline of strategy planning approach focused on entropy minimization is put forward. An example cryptoaritmetic problem is explored in order to explain the proposed approach.
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Knowledge based and CP-driven approach applied to multi product small-size production flow
Autorzy:
Bach, I.
Bocewicz, G.
Banaszak, Z. A.
Muszyński, W.
Tematy:
knowledge engineering
modeling
constraint logic programming
scheduling
Pokaż więcej
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Powiązania:
https://bibliotekanauki.pl/articles/971019.pdf  Link otwiera się w nowym oknie
Opis:
Constraint Programming (CP) is an emergent software technology for declarative description and effective solving of large combinatorial problems, especially in the area of integrated production planning. In this context, CP can be considered an appropriate framework for development of decision making software, supporting scheduling of multi-robots in a multi-product job shop. The paper deals with the multi-resource problem, in which more than one shared renewable and non-renewable resource type may be required by a manufacturing operation and the availability of each type is time-windows limited. The problem is NP-complete. The aim of the paper is to present a knowledge based and CP-driven approach to multi-robot task allocation providing prompt service to a set of routine queries, stated both in direct and reverse way. Provided examples illustrate the cases with consideration of accurate and uncertain specification of robot and worker operation time.
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Towards dedicated decision support tools: CLP-based approach
Autorzy:
Banaszak, Z.
Józefczyk, J.
Tematy:
decision support
constraint logic programming
production planning
modeling
scheduling
Pokaż więcej
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Powiązania:
https://bibliotekanauki.pl/articles/118061.pdf  Link otwiera się w nowym oknie
Opis:
Constraint programming (CP) is an emergent software technology for declarative description and effective solving of large combinatorial problems especially in areas of integrated production planning. In that context, the CP can be considered as a well-suited framework for development of decision making software supporting small and medium size enterprises in the course of Production Process Planning (PPP). The problem considered regards of finding of computationally effective approach aimed at scheduling of a new project subject to constraints imposed by a multi–project environment. In other words, we are looking for an answer whether a given production order specified by its cost and completion time can be accepted in a given manufacturing system specified by available production capability, i.e., the time-constrained resources availability. The problem belongs to a class of multi-mode case project scheduling problems, where the problem of finding a feasible solution is NPcomplete. The aim of the paper is to present the CP modeling framework as well as to illustrate its application to decision making in the case of a new production order evaluation. So, the contribution emphasizes benefits derived from CPbased DSS and focuses on constraint satisfaction driven decision-making rather than on an optimal solution searching.
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
CP approach to design of steady-state flow of repetitive manufacturing processes in SME
Autorzy:
Wójcik, R.
Bocewicz, G.
Tematy:
production planning
waiting-free schedules design
constraint logic programming
Pokaż więcej
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Powiązania:
https://bibliotekanauki.pl/articles/118159.pdf  Link otwiera się w nowym oknie
Opis:
Concurrent execution of work orders in the small and medium size enterprises (SME) imposes a necessity to consider many control problems concerning systems of repetitive concurrent manufacturing processes using common resources in mutual exclusion. In many cases a production system with a given structure of the processes resource requests can be seen as composed of subsystems with n cyclic processes sharing one resource. For given sets of possible values of the processes operation execution times a problem of finding schedules guaranteeing that no process waits for access to the common resources is considered. In particular for the assigned times of the operations execution a subproblem of finding all possible starting times of work orders execution for which waiting-free schedules exist has been formulated as a constraint programming (CP) problem. The starting times derived can be used as an alternative starting times of work orders execution in case of their possible delays. A state space of the problem’s solutions has been reduced using constraints based on the necessary and sufficient conditions for existence of a waiting-free n-process steady-state schedule. An illustrative example of Mozart-based software application to the solution of constraint logic programming problem considered has been presented.
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Towards CLP-based task-oriented DSS for SME
Autorzy:
Tomczuk, I.
Bzdyra, K.
Banaszak, Z.
Tematy:
decision support
constraint logic programming
production planning
modelling
scheduling
Pokaż więcej
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Powiązania:
https://bibliotekanauki.pl/articles/118215.pdf  Link otwiera się w nowym oknie
Opis:
Decision making supported by task-oriented software tools plays a pivotal role in a modern enterprises. That is because commercially available ERP systems are not able to respond in an interactive on-line/real-time mode. It means a new generation of DSS that enable a fast prototyping of production flows in multiproject environment as well as an integrated approach to a layout planning, production routing, batch-sizing and scheduling problems is needed. In that context, the constraint logic programming techniques allowing declarative representation of a decision making problem provide a quite attractive alternative. So, some issues regarding modelling of decision making and searching strategies development are discussed in the contribution. The results obtained are implemented in a software package supporting production flow planning in the SMEs. Illustrative example of the ILOG-based software application is provided.
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
CP-based decision support package for production flow planning - an SME perspective
Autorzy:
Bzdyra, K.
Tomczuk-Piróg, I.
Tematy:
constraint logic programming
decision support
flow planning
constraint satisfaction problem (CSP)
Pokaż więcej
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Powiązania:
https://bibliotekanauki.pl/articles/1395582.pdf  Link otwiera się w nowym oknie
Opis:
Solving complex, decision-making problems requires application of decision support systems. The best solving strategy can be defined for each particular problem. The strategy refers to a sequence solving elementary subproblems. The aim of the paper is to present the evaluating criterion to estimate the efficiency of searching strategies. The criterion proposed offers a possibility to estimate the time needed to solve a constraint satisfaction problem. An illustrative example is provided.
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Two-stage approach for an optimum solution of the car assembly scheduling problem. Part 2. CLP solution and real-world example
Autorzy:
Mazur, M.
Niederliński, A.
Tematy:
car sequencing
car assembly scheduling
workstation capacity constraints
constraint logic programming
Pokaż więcej
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Powiązania:
https://bibliotekanauki.pl/articles/230028.pdf  Link otwiera się w nowym oknie
Opis:
A Constraint Logic Programming (CLP) tool for solving the problem discussed in Part 1 of the paper has been designed. It is outlined and discussed in the paper. The program has been used for solving a real-world car assembly scheduling problem.
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Modele dla potrzeb rozwiązywania zadań optymalizacji taryf
Models for solving the tariff optimization problem
Autorzy:
Pytlak, R.
Stecz, W.
Tematy:
optymalizacja taryf
programowanie z ograniczeniami
minimalizacja kosztu
tariff optimization
constraint logic programming
cost minimization
Pokaż więcej
Wydawca:
Polskie Wydawnictwo Ekonomiczne
Powiązania:
https://bibliotekanauki.pl/articles/1378189.pdf  Link otwiera się w nowym oknie
Opis:
We present the methods of telecommunication tariff optimization from a point of client’s view. A client which wants to minimize his monthly fees tries to choose a proper tariff model. In case of large companies these models are more complicated and the optimization models should be used. We describe a simple MIP models and their modifications solved with CLP solvers. All the examples were solved with ILOG and ECLiPSe MIP and CLP solvers.
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Risk assessement in multi-project environment
Autorzy:
Tomczuk-Piróg, I.
Banaszak, Z.
Tematy:
constraint logic programming
constraint satisfaction problem (CSP)
decision support system
knowledge engineering
projects management
multi-project environment
Pokaż więcej
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Powiązania:
https://bibliotekanauki.pl/articles/118295.pdf  Link otwiera się w nowym oknie
Opis:
Decision making supported by task-oriented software tools plays a pivotal role in a modern enterprise. That is because commercially available ERP systems are not able to respond in an interactive on-line/real-time mode. It opens a new generation of DSS that enable a fast prototyping of production flows in multi-project environment as well as an integrated approach to project execution evaluation. In that context our goal is to provide a knowledge base approach allowing one to be independent on a context or representation of particular data as well as allowing designing an interactive and task-oriented decision support system (DSS). The assumed knowledge base mode of specifying a production system leads to solving a logic-algebraic method (LAM) decision problem. The approach proposed complements the decision system with an additional module (evaluation module) and facilitates searching for possible solutions meeting company production programme execution evaluation criteria. The results obtained are implemented in a software package supporting project management in the SMEs. Illustrative example of the ILOG-based software application is provided.
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Implementation of a decision support model of the supply chain management in the environment of constraint logic programming
Implementacja modelu wspomagania decyzji zarzadzania łańcuchem dostaw w środowisku programowania w logice z ograniczeniami
Autorzy:
Wikarek, J.
Tematy:
zarządzanie łańcuchem dostaw
wspomaganie decyzji
programowanie w logice z ograniczeniami
Supply Chain Management (SCM)
decision support
constraint satisfaction problem (CSP)
constraint logic programming (CLP)
Pokaż więcej
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Powiązania:
https://bibliotekanauki.pl/articles/276266.pdf  Link otwiera się w nowym oknie
Opis:
The article presents the details of the implementation of the concept of a decision support model in the supply chain. To implement the model, the CLP (Constraint Logic Programming) framework called Eclipse was used. The novel way of constraints propagation is discussed, which for this class of problems improves significantly the efficiency of a search for a solution. The most important predicates implementing the model are presented and characterized. Several numerical examples are included to illustrate the implementation of the approach.
W artykule przedstawiono szczegóły implementacji koncepcji modelu wspomagania decyzji w łańcuchu dostaw. Do implementacji modelu wykorzystano środowisko CLP (Programowanie w logice z ograniczeniami) o nazwie Eclipse. Omówiono nowatorski sposób propagacji ograniczeń, który dla tej klasy problemów prowadzi do znacznej poprawy wydajności znajdowania rozwiązania. W artykule przedstawiono i scharakteryzowano najważniejsze predykaty, które służą do implementacji modelu. Jako ilustracje przyjętych założeń i rozwiązań zaprezentowano przykłady liczbowe.
Dostawca treści:
Biblioteka Nauki
Artykuł

Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies