Abstract

This paper aims to investigate the capability of mixed-integer linear programming (MILP) method and genetic algorithm (GA) to solve binary problem (BP). A comparative study on the MILP method and GA with default and tuned setting to find out an optimal solution is presented. The mixed-integer programming library (MIPLIB 2010) is used to test and evaluate algorithms. The evaluation is shown in quality of the solution and the execution time of computation. The results show that GA is superior to MILP in execution time with inconsistent results. However, MILP is superior to GA in quality of the solution with more stable results.

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 call

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.