基于高生存度的末世求生规划模型

An Eschatological Survival Programming Model Based on High Survivability

本文研究了虚拟游戏背景下,确保生存度尽可能高,完成区域穿越任务尽可能快的末世求生问题。通过引入等效距离,构建了基于行走的消耗矩阵,以及基于火把制作的舒适度和饱食度消耗矩阵,从而使得终点生存条件为线性约束。分途经补给点个数最少和行走总路线长度最短两种情况,以生存度最大为目标,建立了两个线性整数规划模型,并对求得的全局最优解进行生存条件检验,验证通过。本模型准确,并通过引入标识矩阵设计隐枚举过滤条件,模型简单,算法效率高,问题中共计给出补给点588个,模型求解用时不多于8秒。

This paper studies the problem of survival in the eschatology of virtual games, which ensures the survival as high as possible and completes the task of region crossing as quickly as possible. By introducing equivalent distance, the consumption matrix based on walking and the consumption matrix of comfort and satiety based on torch manufacturing are constructed, so that the terminal survival condition becomes a linear constraint. Two linear integer programming models are established for the minimum number of supply points and the shortest length of the total route. The survival condition test of the global optimal solution is carried out, and the verification is passed. The model is accurate, and the implicit enumeration filter conditions are designed by introducing the identity matrix. The model is simple and the algorithm efficiency is high. A total of 588 supply points are given, and it takes 8 seconds to find the global optimal solution.