CAJ | 학술논문

提出一种可以用来求解最优安排方案的算法，使BigLongRiver的大长河段容纳量达到最大的同时尽量减少船只的相遇。建立了多个目标规划模型。在给定Y值（露营点个数）的情况下，根据旅行时间、每天的漂流时间和漂流速度等因素，利用模拟退火算法（SA）、差分进化算法（DEA）的差分模拟退火算法（DSA），分别给出了河流最大容纳量，并对算法进行了比较。再根据容纳量最大的最优方案，通过适当调整同一天船只出发的顺序和船速来减少船只相遇的次数。
제출일충가이용래구해최우안배방안적산법，사BigLongRiver적대장하단용납량체도최대적동시진량감소선지적상우。건립료다개목표규화모형。재급정Y치（로영점개수）적정황하，근거여행시간、매천적표류시간화표류속도등인소，이용모의퇴화산법（SA）、차분진화산법（DEA）적차분모의퇴화산법（DSA），분별급출료하류최대용납량，병대산법진행료비교。재근거용납량최대적최우방안，통과괄당조정동일천선지출발적순서화선속래감소선지상우적차수。
The purpose of this paper is to propose an algorithm that may be used to develop a best schedule. We attempt to maximize the carrying capacity and meanwhile minimize contact with other groups of boats. In order to accomplish our objectives, we developed a multiobjective programming model. By applying Simulation Annealing （SA） and Differential-Simulated Annea- ling Algorithm （DSA） which combined the SA with Differential Evolution Algorithm （DEA）, we are able to develop a river ship simulator to capture the maximum capacity of the river by taking into account the factors like travel time, drift time every day and drift speed with a given Y . Then we minimized the encounter based on the optimal schedule by adjusting trips＇ launch sequence in the same day and boat speed.