Purpose-Until now,the algorithms used to compute an equilibrate route assignment do not return an integer solution.This disagreement constitutes a non-negligible drawback.In fact,it is shown in the literature that a f...Purpose-Until now,the algorithms used to compute an equilibrate route assignment do not return an integer solution.This disagreement constitutes a non-negligible drawback.In fact,it is shown in the literature that a fractional solution is not a good approximation of the integer one.The purpose of this paper is to find an integer route assignment.Design/methodology/approach-The static route assignment problem is modeled as an asymmetric network congestion game.Then,an algorithm inspired from ant supercolony behavior is constructed,in order to compute an approximation of the Pure Nash Equilibrium(PNE)of the considered game.Several variants of the algorithm,which differ by their initializing steps and/or the kind of the provided algorithm information,are proposed.Findings-An evaluation of these variants over different networks is conduced and the obtained results are encouraging.Indeed,the adaptation of ant supercolony behavior to solve the problem under consideration shows interesting results,since most of the algorithm’s variants returned high-quality approximation of PNE in more than 91 percent of the treated networks.Originality/value-The asymmetric network congestion game is used to model route assignment problem.An algorithm with several variants inspired from ant supercolony behavior is developed.Unlike the classical ant colony algorithms where there is one nest,herein,several nests are considered.The deposit pheromone of an ant from a given nest is useful for the ants of the other nests.展开更多
Supercolonies of the red fire ant Solenopsis saevissima （Smith） develop in disturbed environments and likely alter the ant community in the native range of the species. For example, in French Guiana only 8 ant speci...Supercolonies of the red fire ant Solenopsis saevissima （Smith） develop in disturbed environments and likely alter the ant community in the native range of the species. For example, in French Guiana only 8 ant species were repeatedly noted as nesting in close vicinity to its mounds. Here, we verified if a shared set of biological, ecological, and behavioral traits might explain how these 8 species are able to nest in the presence of S. saevissima. We did not find this to be the case. We did find, however, that all of them are able to live in disturbed habitats. It is likely that over the course of evolution each of these species acquired the capacity to live syntopically with S. saevissima through its own set of traits, where colony size （4 species develop large colonies）, cuticular compounds which do not trigger aggressiveness （6 species） and submissive behaviors （4 species） complement each other.展开更多
文摘Purpose-Until now,the algorithms used to compute an equilibrate route assignment do not return an integer solution.This disagreement constitutes a non-negligible drawback.In fact,it is shown in the literature that a fractional solution is not a good approximation of the integer one.The purpose of this paper is to find an integer route assignment.Design/methodology/approach-The static route assignment problem is modeled as an asymmetric network congestion game.Then,an algorithm inspired from ant supercolony behavior is constructed,in order to compute an approximation of the Pure Nash Equilibrium(PNE)of the considered game.Several variants of the algorithm,which differ by their initializing steps and/or the kind of the provided algorithm information,are proposed.Findings-An evaluation of these variants over different networks is conduced and the obtained results are encouraging.Indeed,the adaptation of ant supercolony behavior to solve the problem under consideration shows interesting results,since most of the algorithm’s variants returned high-quality approximation of PNE in more than 91 percent of the treated networks.Originality/value-The asymmetric network congestion game is used to model route assignment problem.An algorithm with several variants inspired from ant supercolony behavior is developed.Unlike the classical ant colony algorithms where there is one nest,herein,several nests are considered.The deposit pheromone of an ant from a given nest is useful for the ants of the other nests.
文摘Supercolonies of the red fire ant Solenopsis saevissima （Smith） develop in disturbed environments and likely alter the ant community in the native range of the species. For example, in French Guiana only 8 ant species were repeatedly noted as nesting in close vicinity to its mounds. Here, we verified if a shared set of biological, ecological, and behavioral traits might explain how these 8 species are able to nest in the presence of S. saevissima. We did not find this to be the case. We did find, however, that all of them are able to live in disturbed habitats. It is likely that over the course of evolution each of these species acquired the capacity to live syntopically with S. saevissima through its own set of traits, where colony size （4 species develop large colonies）, cuticular compounds which do not trigger aggressiveness （6 species） and submissive behaviors （4 species） complement each other.
