{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T13:38:42Z","timestamp":1753882722274,"version":"3.41.2"},"reference-count":0,"publisher":"World Scientific Pub Co Pte Ltd","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Artif. Intell. Tools"],"published-print":{"date-parts":[[2022,3]]},"abstract":"<jats:p> The transport network and road services are the foundation for the development of human civilization. It is immensely essential to manage network congestion as well as to minimize the travel time of the growing traffic load on the road network. Traffic signals may play an important role in managing the mounting traffic. This work relies on reducing the total time lag at the traffic signals, thus reducing the overall travel period. The model is designed on a bi-level framework. The overall wait time is optimized at the traffic signals by the upper level while the User Equilibrium (UE) is estimated by the lower level. Biologically inspired metaheuristic methods like Bat Algorithm (BA), Genetic algorithms (GA), Ant Colony Optimization (ACO), and many others demonstrated optimized outcomes for bi-level problems. To improve the desirability of the metaheuristic techniques an innovative method encapsulating the desirability of both BA and GA is proposed to evaluate the traffic optimization problem (TOP). While BA helps in faster convergence GA diversifies the search space. A comparative analysis has been carried out with the parent algorithms as well as an existing ACO-GA-based model. It was observed that the proposed BA-GA method performs better than the rest of the techniques. <\/jats:p>","DOI":"10.1142\/s0218213022400048","type":"journal-article","created":{"date-parts":[[2021,11,19]],"date-time":"2021-11-19T09:52:35Z","timestamp":1637315555000},"source":"Crossref","is-referenced-by-count":1,"title":["An Innovative Hybrid Biologically Inspired Method for Traffic Optimization Problem"],"prefix":"10.1142","volume":"31","author":[{"given":"Sweta","family":"Srivastava","sequence":"first","affiliation":[{"name":"Department of CSE, ASET, Amity University, Noida, India"}]},{"given":"Thompson","family":"Stephan","sequence":"additional","affiliation":[{"name":"Department of CSE, Faculty of Engineering and Technology, M. S. Ramaiah University of Applied Sciences, Bangalore, Karnataka, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2493-3695","authenticated-orcid":false,"given":"Sudip Kumar","family":"Sahana","sequence":"additional","affiliation":[{"name":"Department of CSE, Birla Institute of Technology, Mesra, Ranchi, India"}]}],"member":"219","published-online":{"date-parts":[[2022,3,31]]},"container-title":["International Journal on Artificial Intelligence Tools"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218213022400048","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T10:54:52Z","timestamp":1648724092000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218213022400048"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3]]},"references-count":0,"journal-issue":{"issue":"02","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["10.1142\/S0218213022400048"],"URL":"https:\/\/doi.org\/10.1142\/s0218213022400048","relation":{},"ISSN":["0218-2130","1793-6349"],"issn-type":[{"type":"print","value":"0218-2130"},{"type":"electronic","value":"1793-6349"}],"subject":[],"published":{"date-parts":[[2022,3]]},"article-number":"2240004"}}