Abstract
In this paper, we firstly discuss some properties with respect to the credibility constraints. After that, we construct a new class of fuzzy generalized assignment problem with credibility constraints, in which the cost and time are uncertain and assumed to be characterized by fuzzy variables with known possibility distributions. The problem is a very changeable combinational optimization and it is always different to solve the programming problems using the classical algorithms. In some special cases, we can transform the objective and the credibility constraints into the equivalent linear form by means of the results that we deduce. As a consequence, we can solve it with standard software. Finally, we present one application example encountered by the Canadian Department of Transportation to demonstrate the proposed method.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
