| Queuing theory and packing problem in operational research are mainlyconsidered, and simulate their model with VC++6.0 and Matlab6.1. The two systemsrelate to many subjects, such as opeartion research, mathematic programming, datastructure, arithmetic analysis, computer graphics, artificial intelligence, computerinternet. The two problems exist so much in our realism, so it is very important andsignificant for us that we study their model and optimal algorithm. We set up manymathematic model and analysis their opimal algorithm through queuing thoey apply tobank service, noshery service, video-on-demand system and intranet. Especially weanalysis the video-on-demand. With the rapid performance improvements in low-costPCs, it becomes increasingly practical and cost-effective to implement large-scalevideo-on-demand systems around parellel PC severs. But these systems all reserve alarge of systems device resource. We introduce the wait tolerance characteristic withM/M/m/ model for scheduling in video systems and analyze it. We show fourparameters through simulation that the proposed schemes substantially outperform inreducing the viewer turn-away probability and propose the scheduling scheme calledMaximum Defection Probability, it is proved to be reasonable and priori. We deal with a real problem on the packing of rectangles system with theintegrated application of simulated annealing. First, we formulate the mathematicmodel on the packing of rectangles of system. Second, we give the steps of thealgorithm and compare the genetic algorithm with the simulated annealing algorithm.Finally, under the optimal model of the real data, we get the satisfactory result. In thispaper the problem of calculating optimal packing patterns of small rectangles on apallet is considered. We propose new heuristics which are based on the 4-blockstructure of packing patterns and build the mathematical model. By comparing, thesolutions of the numerical examples show the effectiveness of this approach.
|
PDF Full Text Request