Abstract
The concept of "detailed search" near the extreme value by local search function of neighborhood search algorithm for operation optimization problem of discrete manufacturing system on train bogie is raised for the first time; the optimal solution of objective function based on process constraints genetic algorithm is taken as the initial value of neighbor function to search better solutions than it in the current neighbor, and the global optimal solution.
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.
