As we know rice is the main food in China. In recent years, the rapid development of agricultural decision support system provides new management methods for rice production. GA has been regarded as an effective analytic tool and stochastic search technique to solve large and complicated problems. However, traditional GA-based decision support system does not always result in good solutions and...

Many optimization problems in computer science have been proven to be NP-hard, and it is unlikely that polynomial-time algorithms that solve these problems exist unless P = NP. Alternatively, they are solved using heuristics algorithms, which provide a sub-optimal solution that, hopefully, is arbitrarily close to the optimal one. Such problems are found in a wide range of applications, includin...

It has been proved that the hardware/software partitioning problem is NP-hard. Currently we have tried a variety of computerized algorithms to resolve it, which can be divided into two major categories: accurate algorithms and heuristic algorithms. This paper will discuss accurate algorithms and heuristic algorithms respectively. Accurate algorithms take the example of a greedy algorithm. It ab...

Job shop scheduling problem (JSP) is an attractive field for researchers and production managers since it is a famous problem in many industries and a complex problem for researchers. Due to NP-hardness property of this problem, many meta-heuristics are developed to solve it. Solution representation (solution seed) is an important element for any meta-heuristic algorithm. Therefore, many resear...

differential steering of in-wheel electric vehicle provides the functions of both active steering and power assisted steering with the coupling control of force and displacement transfer characteristic of system. a collaborative optimization model of the differential power-assisted steering system of in-wheel electric vehicle is built, with steering economy as the main system optimization goal,...

We present a methodology for characterization and an approach for computing the solutions of fuzzy linear systems with LR fuzzy variables. As solutions, notions of exact and approximate solutions are considered. We transform the fuzzy linear system into a corresponding linear crisp system and a constrained least squares problem. If the corresponding crisp system is incompatible, then the fuzzy ...

an interactive heuristic approach can offer a practical solution to the problem of linear integer programming (lip) by combining an optimization technique with the decision maker’s (dm) judgment and technical supervision. this is made possible using the concept of bicriterion linear programming (blp) problem in an integer environment. this model proposes two bicriterion linear programs for iden...

The adaptive critic heuristic has been a popular algorithm in reinforcement learning (RL) and approximate dynamic programming (ADP) alike. It is one of the first RL and ADP algorithms. RL and ADP algorithms are particularly useful for solving Markov decision processes (MDPs) that suffer from the curses of dimensionality and modeling. Many real-world problems however tend to be semi-Markov decis...