比賽項(xiàng)目的排序
比賽項(xiàng)目的排序
摘要: 運(yùn)動(dòng)會(huì)中, 若能根據(jù)運(yùn)動(dòng)員的報(bào)名情況建立數(shù)學(xué)模型、科學(xué)地排定比賽項(xiàng)目的順序, 使得連續(xù)參加兩項(xiàng)比賽的`運(yùn)動(dòng)員人次盡可能最少, 可對(duì)運(yùn)動(dòng)會(huì)的順利進(jìn)行提供方便�；谶@種要求,本文巧妙得將運(yùn)動(dòng)員參賽項(xiàng)目的排序問(wèn)題轉(zhuǎn)化為圖論中經(jīng)典的旅行商問(wèn)題求解。以連續(xù)參加兩項(xiàng)比賽人次最少為目標(biāo),應(yīng)用最小生成樹(shù)求解Hamilton回路的方法,得到了題目的最優(yōu)解。
關(guān)鍵詞:項(xiàng)目的排序;旅行商問(wèn)題;最小生成樹(shù)法;Hamilton回路
Array Items of Game
Abstract: In the sports meetings，if we can reduce the number of athletes who take the two games continuously by making the mathematics modelling according to the signing in condition, that will be more conveninent for sports meeting .The problem about the taxis of the competition items in sports games was transformed into the Traveling Salesman Problem in classic graph theory. In order to get the minimum times of taking part in two competitions without any interval, the minimal spanning tree algorithm to figure out a Hamilton cycle was used, In this way the Optimized answer was got.
Key words: taxis of the competition items; Hamilton cycle; Traveling Salesman Problem; minimal spanning tree
【比賽項(xiàng)目的排序】相關(guān)文章：