By Topic

Operation planning of district heating and cooling plants using genetic algorithms for mined 0-1 linear programming

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
M. Sakawa ; Fac. of Eng., Hiroshima Univ., Japan ; K. Kato ; S. Ushiro

In this paper, the authors formulate the operational planning of a district heating and cooling plant as a mixed 0-1 linear programming problem. Since the formulated problem involves hundreds of variables, they anticipate that it is difficult to obtain a strict optimal solution to the problem. Thereby, they propose an approximate solution method based on genetic algorithms. Furthermore, they investigate the efficiency and effectiveness of the proposed method by applying it and the branch-and-bound method to an operational planning problem of an actual district heating and cooling plant

Published in:

Industrial Electronics Society, 2000. IECON 2000. 26th Annual Confjerence of the IEEE  (Volume:4 )

Date of Conference:

2000