基于部分模仿的进化策略求解优化问题
An Evolutionary Strategy based on Partial Imitation for Solving Optimization Problems
摘要:
在这项工作中,我们引入了一种进化策略来解决组合优化任务,即由离散搜索空间的问题。特别是,我们专注于旅行商问题(TSP),即一个著名的问题,其搜索空间呈指数级增长,增加城市的数量,成为NP难。TSP的解决方案可以通过城市数组进行编码,并且可以通过适应度进行评估,根据成本函数(例如路径的长度)进行计算。我们的方法是基于一个代理人口的模仿机制的演变,我们定义“部分模仿”。特别是,代理接收一个随机的解决方案,然后,他们之间的相互作用,可以模仿代理的解决方案具有较高的适应度。由于模仿机制只是部分的,代理只复制另一个数组(即解决方案)的一个条目(随机选择)。在这样做的过程中,人口收敛到一个共享的解决方案,表现得像一个自旋系统经历冷却过程,即朝着有序相驱动。我们强调,所采用的“部分模仿”机制,使人口产生的解决方案,随着时间的推移,达到最终的平衡。数值模拟的结果表明,我们的方法是能够找到,在有限的时间内,最优和次优的解决方案,这取决于所考虑的搜索空间的大小。
英文摘要:
In this work we introduce an evolutionary strategy to solve combinatorial optimization tasks, i.e. problems characterized by a discrete search space. In particular, we focus on the Traveling Salesman Problem (TSP), i.e. a famous problem whose search space grows exponentially, increasing the number of cities, up to becoming NP-hard. The solutions of the TSP can be codified by arrays of cities, and can be evaluated by fitness, computed according to a cost function (e.g. the length of a path). Our method is based on the evolution of an agent population by means of an imitative mechanism, we define `partial imitation'. In particular, agents receive a random solution and then, interacting among themselves, may imitate the solutions of agents with a higher fitness. Since the imitation mechanism is only partial, agents copy only one entry (randomly chosen) of another array (i.e. solution). In doing so, the population converges towards a shared solution, behaving like a spin system undergoing a cooling process, i.e. driven towards an ordered phase. We highlight that the adopted `partial imitation' mechanism allows the population to generate solutions over time, before reaching the final equilibrium. Results of numerical simulations show that our method is able to find, in a finite time, both optimal and suboptimal solutions, depending on the size of the considered search space.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。