Random start and forward search applied to solve multi-criterion planning problems

Dang Thanh Tung, Baltazár Frankovič, Con Sheahan, Ivana Budinská

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper deals with multi-criterion planning problem. Beside traditional constraints, we assume that tasks can migrate between resources and they are executable by many methods with different results. The random start & forward search algorithm is proposed to solve the mentioned problem, in condition, the time for solving is limited.

Original languageEnglish
Title of host publicationProceedings of the 16th IFAC World Congress, IFAC 2005
PublisherIFAC Secretariat
Pages195-200
Number of pages6
ISBN (Print)008045108X, 9780080451084
DOIs
Publication statusPublished - 2005

Publication series

NameIFAC Proceedings Volumes (IFAC-PapersOnline)
Volume16
ISSN (Print)1474-6670

Keywords

  • Forward search
  • Multi-criterion optimization
  • Planning

Fingerprint

Dive into the research topics of 'Random start and forward search applied to solve multi-criterion planning problems'. Together they form a unique fingerprint.

Cite this