A NEW PROBLEM AS CONSUMER ADJACENCY PROBLEM (CAP) AND A HEURISTIC ALGORITHM TO SOLVE IT; WITH DISCUSSION ABOUT ITS APPLICATION TO RANK PROJECT RISKS

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.

SEYED HOSSEINI S.M.; NOURI SIAMAK; HATEFI MOHAMMAD ALI; GHADIRIAN H.A.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN) Year:2009 | Volume:19 | Issue:4 Page(s): 107-117

Download Full-Text

Persian Verion

View:

623

Download:

Cites:

Information Journal Paper

Title

A NEW PROBLEM AS CONSUMER ADJACENCY PROBLEM (CAP) AND A HEURISTIC ALGORITHM TO SOLVE IT; WITH DISCUSSION ABOUT ITS APPLICATION TO RANK PROJECT RISKS

Author(s)

SEYED HOSSEINI S.M. | NOURI SIAMAK | HATEFI MOHAMMAD ALI | GHADIRIAN H.A. | Issue Writer Certificate

Keywords

Not Registered.

Abstract

This paper, introduces a new problem in the field of combinatorial problems as Consumers Adjacency Problem (CAP). Assume a set of resources with specific utility values. Also assume a set of consumers that are common in the resources. Each of packing of the consumers is one of the solution space points. In a given packing, if whole consumers of a given resource are continuous adjacent, the utility value of the resource adds to the objective function. It is desired to determine the suitable pack the consumers in order to have the maximum sum of utility value of resources. To the one-dimensional problem, in this paper, a formulation based on the mathematical programming is provided and a heuristic solving method is introduced. Also, as a useful application, project risk ranking by CAP is discussed.

Cites

No record.

References

No record.

Cite

APA: Copy

SEYED HOSSEINI, S.M., NOURI, SIAMAK, HATEFI, MOHAMMAD ALI, & GHADIRIAN, H.A.. (2009). A NEW PROBLEM AS CONSUMER ADJACENCY PROBLEM (CAP) AND A HEURISTIC ALGORITHM TO SOLVE IT; WITH DISCUSSION ABOUT ITS APPLICATION TO RANK PROJECT RISKS. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN), 19(4), 107-117. SID. https://sid.ir/paper/65912/en

Vancouver: Copy

SEYED HOSSEINI S.M., NOURI SIAMAK, HATEFI MOHAMMAD ALI, GHADIRIAN H.A.. A NEW PROBLEM AS CONSUMER ADJACENCY PROBLEM (CAP) AND A HEURISTIC ALGORITHM TO SOLVE IT; WITH DISCUSSION ABOUT ITS APPLICATION TO RANK PROJECT RISKS. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN)[Internet]. 2009;19(4):107-117. Available from: https://sid.ir/paper/65912/en

IEEE: Copy

S.M. SEYED HOSSEINI, SIAMAK NOURI, MOHAMMAD ALI HATEFI, and H.A. GHADIRIAN, “A NEW PROBLEM AS CONSUMER ADJACENCY PROBLEM (CAP) AND A HEURISTIC ALGORITHM TO SOLVE IT; WITH DISCUSSION ABOUT ITS APPLICATION TO RANK PROJECT RISKS,” INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN), vol. 19, no. 4, pp. 107–117, 2009, [Online]. Available: https://sid.ir/paper/65912/en

Related Journal Papers