USING NEURAL NETWORK AND GENETIC ALGORITHMS TO SOLVE A MULTIPLE ATTRIBUTES KNAPSACK PROBLEM

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

GHAZANFARI M.; NOUJAVAN M.

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: SCIENTIA IRANICA Year:2002 | Volume:9 | Issue:3 Page(s): 255-262

Download Full-Text

View:

297

Download:

192

Cites:

Information Journal Paper

Title

USING NEURAL NETWORK AND GENETIC ALGORITHMS TO SOLVE A MULTIPLE ATTRIBUTES KNAPSACK PROBLEM

Author(s)

GHAZANFARI M. | NOUJAVAN M. | Issue Writer Certificate

Keywords

Not Registered.

Abstract

Selecting an optimum combination of items from a set of items, known as knapsack problems, is an important issue in the decision making domain. In this paper, a new approach is developed to solve a Multiple Attribute Knapsack Problem (MAKP) in which each combination of items is evaluated using some quantitative and qualitative attributes. The assumed qualitative attributes cannot be measured by a mathematical formulation but by a DM/expert. In this paper, a Genetic Algorithm (GA) model has been developed to generate different combinations as the sequential population of the GA model. To rate the qualitative attributes for each chromosome (or combination) in the population, a Neural Network (NN) model has been developed. The ratings (or scores) resulted from quantitative attributes (by NN) and qualitative attributes (by mathematical formulation) for each chromosome form a row of a decision matrix. Having the decision matrix and known weights of attributes, the combinations in each population are ranked by applying a MADM model. The ranks obtained for each chromosome shows the fitness of that chromosome. Using the GA model, the best combination is achieved. The results of conducted experiments show the capability of the proposed approach to deal with MAKP problems.

Cites

No record.

References

No record.

Cite

APA: Copy

GHAZANFARI, M., & NOUJAVAN, M.. (2002). USING NEURAL NETWORK AND GENETIC ALGORITHMS TO SOLVE A MULTIPLE ATTRIBUTES KNAPSACK PROBLEM. SCIENTIA IRANICA, 9(3), 255-262. SID. https://sid.ir/paper/289434/en

Vancouver: Copy

GHAZANFARI M., NOUJAVAN M.. USING NEURAL NETWORK AND GENETIC ALGORITHMS TO SOLVE A MULTIPLE ATTRIBUTES KNAPSACK PROBLEM. SCIENTIA IRANICA[Internet]. 2002;9(3):255-262. Available from: https://sid.ir/paper/289434/en

IEEE: Copy

M. GHAZANFARI, and M. NOUJAVAN, “USING NEURAL NETWORK AND GENETIC ALGORITHMS TO SOLVE A MULTIPLE ATTRIBUTES KNAPSACK PROBLEM,” SCIENTIA IRANICA, vol. 9, no. 3, pp. 255–262, 2002, [Online]. Available: https://sid.ir/paper/289434/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops