in this paper, a mathematical method is proposed to formulate a generalized ordering problem. this model is formed as a linear optimization model in which some variables are binary. the constraints of the problem have been analyzed with the emphasis on the assessment of their importance in the formulation. on the one hand, these constraints enforce conditions on an arbitrary subgraph and then g...

In this paper, a new T-S fuzzy hyperbolic delay model for a class of nonlinear systems with time-varying delay, is presented to address the problems of stability analysis and feedback control. Fuzzy controller is designed based on the parallel distributed compensation (PDC), and with a new Lyapunov function, delay dependent asymptotic stability conditions of the closed-loop system are derived v...

The impetus for this research was examining a flow shop problem in which tasks were expected to be successively carried out with no time interval (i.e., no wait time) between them. For this reason, they should be completed by specific dates or deadlines. In this regard, the efficiency of the models was evaluated based on makespan. To solve the NP-Hard problem, we developed two mathematical mode...

The KRAFT project has defined a generic agent-based architecture to support knowledge fusion — the process of locating and extracting knowledge from multiple, heterogeneous on-line sources, and transforming it so that the union of the knowledge can be applied in problem-solving. KRAFT focuses on knowledge in the form of constraints expressed against an object data model defined by a shared onto...

NP search and decision problems occur widely in AI, and a number of general-purpose methods for solving them have been developed. The dominant approaches include propositional satisfiability (SAT), constraint satisfaction problems (CSP), and answer set programming (ASP). Here, we propose a declarative constraint programming framework which we believe combines many strengths of these approaches,...

Fixed charge solid transportation problems are formulated as profit maximization problems under a budget constraint at each destination. Here item is purchased in different depots at different prices. Accordingly the item is transported to different destinations from different depots using different vehicles. Unitsare sold from different destinations to the customers at different selling prices...

We present a planner named Transition Constraints for Parallel Planning (TCPP). TCPP constructs a new constraint model from domain transition graphs (DTG) of a given planning problem. TCPP encodes the constraint model by using table constraints that allow don’t cares or wild cards as cell values. TCPP uses Minion the constraint solver to solve the constraint model and returns the parallel plan....

This paper describes an ongoing effort in developing a Multiagent System (MAS) for supply chain management. In our framework, functional agents can join in, stay, or leave the system. The Supply Chain Management System (SCMS) functionality is implemented through agent-based negotiation. When an order arrives, a virtual supply chain may emerge from the system through automated or semi-automated ...

Knowledge fusion refers to the process of locating and extracting knowledge from multiple, heterogeneous on-line sources, and transforming it so that the union of the knowledge can be applied in problem-solving. The KRAFT project has defined a generic agent-based architecture to support fusion of knowledge in the form of constraints expressed against an object data model. KRAFT employs three ki...