Abstract
In this paper, we propose a new method for generating the efficient solutions in multiobjective linear programming (MOLP) problems. An exact tree-based method is proposed to generate all the pareto set by adopting a bottom-up approach. This method is suitable for small-and medium-sized problems. For large-scaled problems, we develop a tabu search-based heuristic combined with a dichotomic exploration of the efficient set. This method generates potentially maximal efficient faces. The two methods are empirically compared. Experimental results show that the tree-based method ensures finding the entire efficient set in a reasonable central processing unit (CPU) time. Furthermore, the dichotomic TS method has a significant advantage for solving large-scaled instances of MOLP problems. It features good compromise between the central processing unit (CPU) time and the size of the generated efficient set.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.