We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
你好,我将Problem2有约束的三层编码按numGentic拆开: 第一层是受灾点编码,里面点的出现次数反应了该点的灾民人数。 但是,我发现很多一个受灾点的灾民分配在第二层的避难所点很多都不一样。 第三层车量编码(运送的人数逐渐叠加)决定了在前两层哪里断开。难道一辆车一次只能运送一个灾民吗(受灾点-->避难所-->受灾点),那车的容量不是想表达一次能最多运送多少个灾民吗?所求的time_max貌似也是按这个逻辑去算的。 有点困惑希望您可以解答一下!!非常感谢!!
The text was updated successfully, but these errors were encountered:
No branches or pull requests
你好,我将Problem2有约束的三层编码按numGentic拆开:
第一层是受灾点编码,里面点的出现次数反应了该点的灾民人数。
但是,我发现很多一个受灾点的灾民分配在第二层的避难所点很多都不一样。
第三层车量编码(运送的人数逐渐叠加)决定了在前两层哪里断开。难道一辆车一次只能运送一个灾民吗(受灾点-->避难所-->受灾点),那车的容量不是想表达一次能最多运送多少个灾民吗?所求的time_max貌似也是按这个逻辑去算的。
有点困惑希望您可以解答一下!!非常感谢!!
The text was updated successfully, but these errors were encountered: