Sistema de Apoio à Decisão para o Transporte Não Urgente de Doentes em Veículo Partilhado

Oliveira, José A.; Ferreira, João Amaro Oliveira; Figueiredo, Manuel; Dias, Luís M. S.; Pereira, Guilherme

doi:10.4304/risti.13.17-33

Cited by 3 publications

(1 citation statement)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Currently, the GA [49], branch-and-cut algorithm [50], tabu search algorithm [51], simulated annealing algorithm [11,41], ant colony algorithm [38], and so forth are usually used to solve the regular TOP or extended TOP models. Through analyzing the results of solving 24 standard TOP benchmark instances using a heuristic algorithm, Ferreira et al believed that the GA's results for 60% of the benchmark instances were better than those from other heuristic algorithms [12] and proved that using GA to solve the TOP within the acceptable time can produce good results.…”

Section: Related Workmentioning

confidence: 99%

Optimization of Pesticide Spraying Tasks via Multi-UAVs Using Genetic Algorithm

Luo

Niu

Zhu

et al. 2017

Mathematical Problems in Engineering

View full text Add to dashboard Cite

Task allocation is the key factor in the spraying pesticides process using unmanned aerial vehicles (UAVs), and maximizing the effects of pesticide spraying is the goal of optimizing UAV pesticide spraying. In this study, we first introduce each UAV's kinematic constraint and extend the Euclidean distance between fields to the Dubins path distance. We then analyze the two factors affecting the pesticide spraying effects, which are the type of pesticides and the temperature during the pesticide spraying. The time window of the pesticide spraying is dynamically generated according to the temperature and is introduced to the pesticide spraying efficacy function. Finally, according to the extensions, we propose a team orienteering problem with variable time windows and variable profits model. We propose the genetic algorithm to solve the above model and give the methods of encoding, crossover, and mutation in the algorithm. The experimental results show that this model and its solution method have clear advantages over the common manual allocation strategy and can provide the same results as those of the enumeration method in small-scale scenarios. In addition, the results also show that the algorithm parameter can affect the solution, and we provide the optimal parameters configuration for the algorithm.

show abstract