The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
City Group Optimization: An Optimizer for Continuous Problems
Abstract
City group refers to a collection of cities. Through the development and growth, these cities form a chain of metropolitan areas. In a city group, cities are divided into central cities and subordinate cities. Generally, central cities have greater chances to develop. However, subordinate cities may not have great chances to develop unless they are adjacent to central cities. Thus, a city is more likely to develop well if it is near a central city. In the process, the spatial distribution of cities changes all the time. Urbanologists call the above phenomena the evolution of city groups. In this chapter, the city group optimization algorithm is presented, which is based on urbanology and mimics the evolution of city groups. The robustness and evolutionary process of the proposed city group optimization algorithm are validated by testing it on 15 benchmark functions. The comparative results show that the proposed algorithm is effective for solving complexly continuous problems due to a stronger ability to escape from local optima.
Related Content
|
S. Karthigai Selvi, Sharmistha Dey, Siva Shankar Ramasamy, Krishan Veer Singh.
© 2025.
16 pages.
|
|
S. Sheeba Rani, M. Mohammed Yassen, Srivignesh Sadhasivam, Sharath Kumar Jaganathan.
© 2025.
22 pages.
|
|
U. Vignesh, K. Gokul Ram, Abdulkareem Sh. Mahdi Al-Obaidi.
© 2025.
22 pages.
|
|
Monica Bhutani, Monica Gupta, Ayushi Jain, Nishant Rajoriya, Gitika Singh.
© 2025.
24 pages.
|
|
U. Vignesh, Arpan Singh Parihar.
© 2025.
34 pages.
|
|
Sharmistha Dey, Krishan Veer Singh.
© 2025.
20 pages.
|
|
Kalpana Devi.
© 2025.
26 pages.
|
|
|