With the rise in popularity of river rafting, the park managers are faced with the problem of allowing more trips to travel down the river and providing wilderness experience for the visitors, with minimal contact with other groups of boats on the river as well. In this paper, the schedule of trips on the Big Long River (225 miles) is studied. The drifting vessels that can be chosen are oar-powered rubber rafts and motorized boats. By using the queuing theory, we propose several schedules, including the departure time, arriving time, duration (measured in nights on the river) and propulsion (motor or oar), based on some basic and practical assumptions. All schedules proposed here can provide visitors with a wilderness experience, with no two sets of campers occupying the same site at the same time. Based on the number of campsites, the transportation tool, the days of trip and some reasonable assumption, the paper model the above optimal schedule problem as a combinational optimization problem. We use heuristic algorithm to solve the above combinational optimization problem. First of all, we build the matrix which representing arrangement of a boat in 180 days. Secondly, we build the matrix which means the arrangement of campsites in one day. Third, we choose matrix which meet the constraint condition and have the maximized cardinal of line. The number of maximized cardinal of line is the optimal solution of the original combinational optimization problem. So we can see that the result is enormous, According to this model, we can get two-dimensional matrix, it will Simplify the results. The maximum of quantity of matrix which satisfy the conditions is optimal solution.