The Process Programming Basics: Priorities, Heuristic or Genetic Algorithms? This paper analyzes methods to optimize process programming, starting with the heuristic algorithms, then reviewing the current method previously advanced by the authors, the quantitative priorities, and finally approaches the problem with an innovative and promissory concept: the genetic algorithms and the “total costs and risks” optimization criterion, which is an alternative to both optimization with constraints and optimization with Lagrange multipliers. This new method emulates natural systems, thus borrowing from their robustness and adaptability. The method proves particularly useful in a turbulent and changing environment, requiring a realistic simulation model and also parallel processing in a high power computing grid.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Volume (Year): 2(519) (2008) Issue (Month): 2(519) (February) Pages: 03-08 Download reference. The following formats are available: HTML
(with abstract),
plain text
(with abstract),
BibTeX,
RIS (EndNote, RefMan, ProCite),
ReDIF