首页| JavaScript| HTML/CSS| Matlab| PHP| Python| Java| C/C++/VC++| C#| ASP| 其他|
购买积分 购买会员 激活码充值

您现在的位置是:虫虫源码 > 其他 > 为著名的多旅行商问题的遗传算法求解(m-TSP)。

为著名的多旅行商问题的遗传算法求解(m-TSP)。

资 源 简 介

General problem N tasks of variable lengths and positions + M robots of variable strengths. Assign robots to tasks in order to minimize the total duration and cost of the work. The challenge wrapped in a futuristic context In a near future, suppose you are a planet colonizer right in the midst of a new gold rush era. There are hundreds of planets to be conquered. In order for a planet to be yours, you need to build a headquarter big enough to honor the planet largeness. Since this is future, robots may give you a good hand. However, because you are not extravagantly rich yet, you only have a limited number of robots. Your goal is then to conquer as many planets as you can as fast as you can. There certainly is a time versus money tradeoff you’ll need to deal with. Becoming rich fast will necessitate big investment. For example, you may hire additional robots to achieve better work parallelization. At the opposite, you may carefully opt
VIP VIP
0.175767s