Abstract
A hybrid genetic algorithm is proposed to solve a coordinated production and transportation problem. The problem considered is a mixed integer linear programming problem, which coordinates the production planning of finished products and intermediate products in a process industry, also consists of transportation between the facilities that produces intermediates and finished products. The results obtained by GA are then compared with results obtained by CPLEX solver. Computational results show that as the problem size increase in terms of number of products or time periods, GA can provide a good quality feasible solution in a reasonable time. Furthermore, incorporating the feasible solution from the MIP solver into GA's initial population decreases the total cost by about 39%.
Sign-in/Register to access full text options 
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.
