2012北美数学建模比赛获奖论文.docVIP

Team # 13544 Page PAGE 20 of NUMPAGES 22 PAGE Dedicated?Pipeline?for?Trip?Arrangement Summary In the problem of camping, we should set reasonable schedule which can not only increase the utilization of campsites but also meet peoples needs. Meanwhile, the carrying capacity of the river is also required. To solve the problem, this thesis will build optimization model with maximum campsites utilization and river trips as the models target function. The specific steps are as follows: step1: Determine the number of campsites Y. We use Computer Emulation Simulation to solve this problem by making full use of the given conditions that trips will spend6 to 18 nights on the river and the river is 225 miles long. We get 29 sets of data through programming, then curve fitting them by SPSS software. By comparing the value of sig. and adjusting R square and so on, the ideal number of the campsites is got . Step2: By using the number of the campsites 39 as well as the goal programming equation built in the first step, we get the number of river trips that are allowed to enter, namely the carrying capacity of the river. Step3: By using the campsites 39, we adjust the campsites of different camping program and then divide them into 4 kinds through clustering analysis using SPSS. Then we select representatives in various types of camping programs according to repetition rate and the average transfer rate. So we streamline the camping programs into the problem of goal programming for 6, 8, 11, 12, 16 nights. Step4: In those five camping programs, 39 campsites which will not repeat are distributed in 3 dedicated pipelines . The first line accounts for 12 campsites and can only be available for 6 or 12 nights trip. Each day, a couple of 6 nights trips are distributed, and the starting trip camps the campsites in turn according to the even number of the pipeline while the secondary tri