Skoči na glavni sadržaj

Izvorni znanstveni članak

Using Coevolution Genetic Algorithm with Pareto Principles to Solve Project Scheduling Problem under Duration and Cost Constraints

Budylskiy Alexandr Victorovich ; Faculty of Informational Technologies and Communications, Astrakhan state technical university, Astrakhan, Russia
Kvyatkovskaya Irina Yuryevna orcid id orcid.org/0000-0001-7205-7231 ; Faculty of Informational Technologies and Communications, Astrakhan state technical university, Astrakhan, Russia


Puni tekst: engleski pdf 618 Kb

str. 1-9

preuzimanja: 368

citiraj


Sažetak

This article considers the multicriteria optimization approach using the modified genetic algorithm to solve the project-scheduling problem under duration and cost constraints. The work contains the list of choices for solving this problem. The multicriteria optimization approach is justified here. The study describes the Pareto principles, which are used in the modified genetic algorithm. We identify the mathematical model of the project-scheduling problem. We introduced the modified genetic algorithm, the ranking strategies, the elitism approaches. The article includes the example.

Ključne riječi

project; project management; project scheduling; multicriteria optimization; Pareto principles; genetic algorithm

Hrčak ID:

123580

URI

https://hrcak.srce.hr/123580

Datum izdavanja:

26.6.2014.

Posjeta: 1.044 *