Using second-generation biomass and biofuel deal with environmental pollution and CO2 emissions. Therefore, this paper design an integrated multi-period bi-objective biofuel supply chain network using support vector machine (SVM) and economic analysis to reduce the cost of generating biofuels and CO2 emissions. The economic analysis consists of three scenarios for supplyin...

Distributed Constraint Optimization Problems (DCOPs) are an important subclass of combinatorial optimization problems, where information and controls distributed among multiple autonomous agents. Previously, Machine Learning (ML) has been largely applied to solve problems by learning effective heuristics. However, existing ML-based heuristic methods often not generalizable different search algo...

critical path method (cpm) is one of the most popular techniques used by construction practitioners for construction project scheduling since the 1950s. despite its popularity, cpm has a major shortcoming, as it is schedule based on two impractical acceptance that the project deadline is not bounded and that resources are unlimited. the analytical competency and computing capability of cpm thus...

Constraint satisfaction techniques provide powerful inference algorithms that can prune choices during search. Constraint-based approaches provide a useful complement to heuristic search optimal planners. We develop a constraint-based model for cost-optimal planning that uses global constraints to improve the inference in planning. The key novelty in our approach is in a transformation of the S...

We consider reasoning in an algebra of cyclic time intervals recently known in the literature; the algebra, CZ.A, is somehow the cyclic time counterpart of Allen’s algebra of linear time intervals, 1277.A. A composition table has been built for C2¢4; the table can be used by a path consistency algorithm, such as Alien’s, to propagate knowledge expressed in the algebra as a constraint satisfacti...

For planning to come of age, plans must be judged by a measure of quality, such as the total cost of actions. This report describes an optimal-cost planner which guarantees global optimality whenever the planning problem has a solution. We code the extraction of an optimal plan, from a planning graph with a fixed number k of levels, as a weighted constraint satisfaction problem (WCSP). The spec...