Title :
Multi-plan for optimal mix of travel routes
Author_Institution :
School of Science, China Jiliang University, Hangzhou, 31001, China
fDate :
7/1/2015 12:00:00 AM
Abstract :
In this paper, three different plans are proposed to solve the rafting scheduling problem of the Big Long River. The best schedule is developed to maximize the carrying capacity of the river. We also consider the minimal contact among boats on the river and the mixture of different trips. Three models are presented and compared. It is assumed that there are 100 campsites along the river and the maximum daily raft time is 8 hours. The carrying capacities of the three models are 1,628, 1,520 and 2,160, respectively. The average daily utilization frequencies of campsites are 0.9598, 0.8967 and 0.98, respectively. The minimal contact can be achieved in Plan I. Plan II has the worst wildness experience but provides visitors with the richest choices of travel routes. We further study how the fluctuation of the campsites number and the percentage of motorized boats influence carrying capacities of the three plans.
Conference_Titel :
Machine Learning and Cybernetics (ICMLC), 2015 International Conference on
DOI :
10.1109/ICMLC.2015.7340622