An indirect search algorithm for solving the spatial harvest-scheduling problem
The objective of this research was to develop, evaluate, and understand a new heuristic algorithm for solving the spatial harvest-scheduling problem. The new algorithm, indirect search, is a combination of a greedy heuristic and a neighborhood search. It was developed with the intention of quickl...
| Main Author: | |
|---|---|
| Language: | English |
| Published: |
2009
|
| Online Access: | http://hdl.handle.net/2429/10579 |