User:Studi90/sandbox

Start

Part I: Metaheuristics are used for all types of optimisation problems, ranging from continuous through mixed integer problems to combinatorial optimisation or combinations thereof. In combinatorial optimisation, an optimal solution is sought in a discrete search space.

Part II: Metaheuristics are also frequently applied to scheduling problems. A typical representative of this combinatorial task class is job shop scheduling, which involves assigning the work steps of jobs to processing stations in such a way that all jobs are completed on time and altogether in the shortest possible time. In practice, restrictions often have to be observed, e.g. by limiting the permissible sequence of work steps of a job through predefined workflows and/or with regard to resource utilisation, e.g. in the form of smoothing the energy demand.

Part III: ant colony optimization,

Part IV: Another large field of application are optimization tasks in continuous or mixed-integer search spaces. This includes, e.g., design optimization  or varoius engineering tasks. An example of the mixture of combinatorial and continuous optimization is the planning of favourable motion paths for industrial robots.