A Heuristic-Biased GRASP for the Team Orienteering Problem

Metaheuristic planner for cooperative multi-agent wall construction with UAVs

“…Constraint (8) forces that each visited node has a robot that enters it. Variables x r ij and z ij are joined together through constraint (9). Constraint (10) ensures continuity with sufficient travel time allocated for each robot, with constant M defined as M = T max + max t i + max |e ij |.…”

“…Based on the defined problem formulation, each iteration compares the improved solution with the current best found solution until the defined criterion is met. The most related versions of the GRASP algorithm are the ones for the variants of TOP in [9,31,33,34,35]. Yet the proposed variant is mostly based on the vanilla GRASP with RCL introduced in [30] and described above.…”

A GRASP Approach for The Minimum Spanning Tree Under Conflict Constraints

“…Bresina (1996) propôs um método de enviesamento baseado no ordenamento dos candidatos de acordo com o critério guloso, em outras palavras, o i-ésimo melhor candidato teria como enviesamento uma função de i. Posteriormente, Binato et al (2000) aplicaram o método de Bresina (1996) na etapa construtiva do GRASP. Outros trabalhos, como Expósito et al (2016), também aplicaram a mesma estratégia com sucesso. Neste trabalho, diferente da estratégia de Bresina (1996), o enviesamento não será calculado em função do ordenamento, e sim, em função da memória adaptativa.…”