•  English
    • Persian
    • English
  •   Login
  • Ferdowsi University of Mashhad
  • |
  • Information Center and Central Library
    • Persian
    • English
  • Home
  • Source Types
    • Journal Paper
    • Ebook
    • Conference Paper
    • Standard
    • Protocol
    • Thesis
  • Use Help
View Item 
  •   FUM Digital Library
  • Fum
  • Articles
  • ProfDoc
  • View Item
  •   FUM Digital Library
  • Fum
  • Articles
  • ProfDoc
  • View Item
  • All Fields
  • Title
  • Author
  • Year
  • Publisher
  • Subject
  • Publication Title
  • ISSN
  • DOI
  • ISBN
Advanced Search
JavaScript is disabled for your browser. Some features of this site may not work without it.

Multi-Objective Resource Allocation Problem with Simulated Annealing Algorithm

Author:
منصور قلعه نوی
,
M. N. Zobeydi
,
Mansour Ghalehnovi
Year
: 2012
Abstract: This paper consider on Multi-objective resource allocation problem (MORAP). To solve a hypothetical MORA problem, simulated annealing algorithm was used. Results showed that simulated annealing is very efficient to solve this problem. At the end of paper we provide results of running the algorithm in various size problems and we conclude simulated annealing can be an appropriate choice to solve a MORAP.
URI: http://libsearch.um.ac.ir:80/fum/handle/fum/3343334
Keyword(s): Simulated annealing algorithm,Multi-objective resource allocation problem,Project management
Collections :
  • ProfDoc
  • Show Full MetaData Hide Full MetaData
  • Statistics

    Multi-Objective Resource Allocation Problem with Simulated Annealing Algorithm

Show full item record

contributor authorمنصور قلعه نویen
contributor authorM. N. Zobeydien
contributor authorMansour Ghalehnovifa
date accessioned2020-06-06T13:08:43Z
date available2020-06-06T13:08:43Z
date issued2012
identifier urihttp://libsearch.um.ac.ir:80/fum/handle/fum/3343334
description abstractThis paper consider on Multi-objective resource allocation problem (MORAP). To solve a hypothetical MORA problem, simulated annealing algorithm was used. Results showed that simulated annealing is very efficient to solve this problem. At the end of paper we provide results of running the algorithm in various size problems and we conclude simulated annealing can be an appropriate choice to solve a MORAP.en
languageEnglish
titleMulti-Objective Resource Allocation Problem with Simulated Annealing Algorithmen
typeJournal Paper
contenttypeExternal Fulltext
subject keywordsSimulated annealing algorithmen
subject keywordsMulti-objective resource allocation problemen
subject keywordsProject managementen
journal titleTexas Journal of Sciencefa
pages109-113
journal volume23
journal issue5
identifier linkhttps://profdoc.um.ac.ir/paper-abstract-1028728.html
identifier articleid1028728
  • About Us
نرم افزار کتابخانه دیجیتال "دی اسپیس" فارسی شده توسط یابش برای کتابخانه های ایرانی | تماس با یابش
DSpace software copyright © 2019-2022  DuraSpace