This paper considers the optimal control via weighted congestion game with linear cost functions. First, the weighted congestion game is converted into a matrix form for the sake of simplicity of computation. Second, ...
详细信息
ISBN:
(纸本)9781538629185
This paper considers the optimal control via weighted congestion game with linear cost functions. First, the weighted congestion game is converted into a matrix form for the sake of simplicity of computation. Second, a system performance criteria is proposed in order to minimize individual cost, and by designing proper parameters of linear cost functions, the given system performance criterion is converted into weighted potential function of a weighted congestion game. Then the profile dynamics is expressed into an algebraic form and potential-based stability of weighted congestion game is considered by using the Lyapunov-based approaches. Finally, an example is given to illustrate the theoretical results.
The authors present a novel analog computational network for solving NP-complete constraint-satisfaction problems, i.e. job-shop scheduling. In contrast to most neural approaches to combinatorial optimization based on...
详细信息
The authors present a novel analog computational network for solving NP-complete constraint-satisfaction problems, i.e. job-shop scheduling. In contrast to most neural approaches to combinatorial optimization based on quadratic energy costfunctions, the authors propose to use linear cost functions. As a result, the network complexity (number of neurons and the number of resistive interconnections) grows only linearly with problem size, and large-scale implementations become possible. It is shown how to map a job-shop scheduling problem onto a simple neural net, where the number of neural processors equals the number of subjobs (operations) and the number of interconnections grows linearly with the total number of operations. Simulations show that the proposed approach produces better solutions than the traveling-salesman-problem-type Hopfield approach and the integer linear programming approach of Y.P. Foo and Y. Takefuji (1988) in terms of the quality of the solution and the network complexity
暂无评论