Abstract
The definition of local optimum solution of the discrete optimization is first given, and then a comprehensive combinatorial algorithm is proposed in this paper. Two-level optimum method is used in the algorithm. In the first level optimization, an approximate local optimum solution is found by using the heuristic algorithm, relative difference quotient algorithm, with high computational efficiency and high performance demonstrated by the performance test of random samples. In the second level, a mathematical model of (-1, 0, 1) programming is established first, and then it is changed into (0, 1) programming model. The local optimum solution X* will be from the (0, 1) programming by using the delimitative and combinatorial algorithm or the relative difference quotient algorithm. By this algorithm, the local optimum solution can be obtained certainly, and a method is provided to judge whether or not the approximate optimum solution obtained by heuristic algorithm is an optimum solution. The above comprehensive combinatorial algorithm has higher computational efficiency.
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.
