Volume 19, Issue 4 (IJIE 2008)                   2008, 19(4): 107-117 | Back to browse issues page

XML Persian Abstract Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Seyedhoseini S, Noori S, Hatefi M, Ghadirian H. A NEW PROBLEM AS CONSUMER ADJACENCY PROBLEM (CAP) AND A HEURISTIC ALGORITHM TO SOLVE IT WITH DISCUSSION ABOUT ITS APPLICATION TO RANK PROJECT RISKS. Journal title 2008; 19 (4) :107-117
URL: http://ijiepm.iust.ac.ir/article-1-250-en.html
, seyedhoseini@yahoo.com
Abstract:   (8734 Views)
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.
Full-Text [PDF 495 kb]   (2283 Downloads)    
Type of Study: Research |
Received: 2010/06/28 | Published: 2008/12/15

Add your comments about this article : Your username or Email:
CAPTCHA

Send email to the article author


Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.