2019
DOI: 10.1016/j.compag.2018.12.002
|View full text |Cite
|
Sign up to set email alerts
|

Routing algorithm selection for field coverage planning based on field shape and fleet size

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
10
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 36 publications
(12 citation statements)
references
References 16 publications
0
10
0
Order By: Relevance
“…Finally, the route selection for field coverage planning is also a vital function of the AAMMP. This is also a constraint that affects the work efficiency and make-span [32]. A route optimization algorithm can minimize the operating distance of a sugarcane harvester and maximize the sugarcane field harvest [27].…”
Section: Operations Assignment and Scheduling Of Multiple Machinesmentioning
confidence: 99%
“…Finally, the route selection for field coverage planning is also a vital function of the AAMMP. This is also a constraint that affects the work efficiency and make-span [32]. A route optimization algorithm can minimize the operating distance of a sugarcane harvester and maximize the sugarcane field harvest [27].…”
Section: Operations Assignment and Scheduling Of Multiple Machinesmentioning
confidence: 99%
“…The problem of fresh food distribution is essentially a VRP. Solving such problems can be achieved by a meta-heuristic optimization algorithm (Seyyedhasani et al , 2019). Karakatič and Podgorelec (2015) proposed a set of genetic algorithms designed for solving multi-depot VRP.…”
Section: Literature Reviewmentioning
confidence: 99%
“…The CARP problem was introduced by Golden et al (1983), and was shown to be an NP-hard problem by Corberan and Laporte (2015). Regarding the CARP problem, many research scholars have carried out research work; Seyyedhasani et al (2019) conducted mathematical modeling with the CARP problem for the case of multiple farm machines involved in the operation, and proposed an improved Clark-Wright algorithm and a taboo search algorithm to optimize the operation path of multiple farm machines, resulting in a 32% reduction in operation completion time. Pitakaso and Sethanan (2019) modeled the CARP problem on the sugarcane harvesting problem and used the adaptive large neighborhood search (ALNS) algorithm to solve the problem of maximizing the area of sugarcane harvested under the condition that only a certain number of sugarcane harvesters are available.…”
Section: Introductionmentioning
confidence: 99%
“…(1983) , and was shown to be an NP -hard problem by Corberan and Laporte (2015) . Regarding the CARP problem, many research scholars have carried out research work; Seyyedhasani et al. (2019) conducted mathematical modeling with the CARP problem for the case of multiple farm machines involved in the operation, and proposed an improved Clark–Wright algorithm and a taboo search algorithm to optimize the operation path of multiple farm machines, resulting in a 32% reduction in operation completion time.…”
Section: Introductionmentioning
confidence: 99%