Abstract
The equilibrium-constrained circles Packing problem with the background of satellite module layout design belongs to NP-hard problem. The authors extend scatter search (SS) to deal with this problem,and propose the improved scatter search. The authors empirically study the coordinate transformation-based diversification method and the reference set update method on the basis of two dissimilarities. The gradient descent algorithm and Nelder-Mead simplex algorithm are adopted to improve the trial solution generated at two different stages in SS,respectively. The improved scatter search can make a tradeoff between exploration and exploitation. Experiment results show the feasibility and effectiveness of the improved scatter search.
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.
