Abstract
This paper transfer the area target scheduling problem into maximal coverage problem based on summaring the traditional sovling problem. A MIP model is build based on problem characters; simulated anneanling problem is used to solve the problem. Four neighborhood and tow differentiation mechanisms are designed to fit the study problem, such as offset neighborhood. The relationship between coverage and overlap and division angle is analysised by test data, and algorithm validation and effective is test based on example data.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call