|
| << vorige | volgende >> |
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
Details van artikel 96 van 219 gevonden artikelen
| Titel: |
HEURISTIC NONSERIAL DYNAMIC PROGRAMMING FOR LARGE PROBLEMS |
| Auteur: |
Rosenman, Michael A. Gero, John S. |
| Verschenen in: |
Engineering optimization |
| Paginering: | Jaargang 4 (1980) nr. 4 pagina's 167-178 |
| Jaar: |
1980 |
| Inhoud: |
Dynamic programming is an extremely powerful optimization approach used for the solution of problems which can be formulated to exhibit a serial stage-state structure. However, many design problems are not serial but have highly connected interdependent structures. Existing methods, for the solution of nonserial problems require the problem to possess a certain structure or limit the size of the problem due to storage and computational time requirements. The aim of this paper is to show that nonserial problems can be solved by the use of dynamic programming incorporating algorithms based on heuristics. Two such algorithms are developed using artificial intelligence concepts of estimating the likelihood of future results on present decisions. The algorithms are explained in detail, A small problem is solved and the results of testing them on large scale problems are given. The method is then used to solve a problem drawn from the literature. |
| Uitgever: |
Taylor & Francis |
| Bronbestand: |
Elektronische Wetenschappelijke Tijdschriften |
Details van artikel 96 van 219 gevonden artikelen
| << vorige | volgende >> |