A Constrained k-means and Nearest Neighbor Approach for Route Optimization : With an application to the Bale Collection Problem

@inproceedings{Zamar2016ACK,
  title={A Constrained k-means and Nearest Neighbor Approach for Route Optimization : With an application to the Bale Collection Problem},
  author={David S. Zamar},
  year={2016}
}
The bale collection problem (BCP) appears after harvest operations of agricultural crops. Its solution defines the sequence of collecting bales which lie scattered over the field. Current technology on navigation systems in autonomous agricultural vehicles and machines are able to provide accurate data for reliable bale collection planning. This paper presents a constrained k-means algorithm and nearest neighbor approach to the BCP, which minimizes travel time and hence fuel consumption. The… CONTINUE READING

Similar Papers

Loading similar papers…