| The orienteering problem is common and a big challenge as a special kind ofNP-hard path optimization problem in many fields of application, such as logistics, touristindustry which is made up of Traditional Orienteering Problem and Team orienteeringproblem（TOP）. It introduced the Team Orienteering Problem with two-dimensionalloading constraint（s2L-TOP） based on a review of the orienteering problem in the nationaland international literature. It introduced Genetic Algorithm Optimization based onmetaheuristic, basic thought, merits and demerits. It is the theoretical foundation of the2L-TOP.In real distributions, there is a great amount of transportation problems called the2L-TOP, in which items demanded by customers are usually fragile and needed to be packed intovehicles. This is a new problem that combines the two classical problems of the2L-TOP and thetwo-dimensional bin packing problem. After It introduced the two-dimensional bin packingproblem, due to the particularity of the problem, two-dimensional bin packing algorithm wasimproved and a new two-dimensional bin packing algorithm was designed.To solve the problem, a mathematical model were presented after an explicitproblem definition. A genetic algorithm for solving the2L-TOP model was designed. Inorder to improve the genetic algorithm global search ability, the basic crossover andmutation operator was improved.the2L-TOP was texted in the two text instances. Due to chao’s text instances wasused only in the fundamental TOP, related data was added to apply to the2L-TOP, andthe two-dimensional bin packing constraints did not work. The results of the article andchao’s text instances were compared, and proved the validity of this algorithm. Compare tothe data of chao’s text instances and Iori’s text instances, Iori’s text instances was used inthe2L-TOP. And this results demonstrated the algorithm was effective and great stabilit.The2L-TOP is not only made theory abundantly, but also supported real problem. |
PDF Full Text Request