= Helena Ramalhinho Dias Lourenço
{c}
= Helena R. Lourenço
{c}
{synonym}
<Helena Ramalhinho Dias Lourenço> is a researcher in <combinatorial optimization>, scheduling and routing. Her UPF profile explicitly gives this full name and explains her earlier publication name Helena R. Lourenço.<Helena Ramalhinho profile at UPF>[Research interests; About my name]{ref} Under that earlier name, she coauthored the <iterated local search> survey with <Olivier C. Martin> and <Thomas Stützle>.<Iterated Local Search by Helena R. Lourenço and others>[Title-page byline]{ref}
One part of their framework is the <iterated local search acceptance rule>. An original abstract example shows why acceptance can change where the search reaches. Suppose three locally optimized candidates $a,b,c$ have costs $8,9,4$, and the fixed perturbation-plus-improvement map sends $a$ to $b$ and $b$ to $c$. Starting at $a$, accepting only a strictly lower cost rejects $b$ and repeats the same failed transition. Accepting every candidate instead follows $a\to b\to c$, reaching cost $4$ after two transitions. This chosen example illustrates a possibility, not a general guarantee for the always-accept rule.
The survey's actual <travelling salesman problem> comparison measured mean excess tour length over ten independent runs, each with a 120-second budget on a Pentium266MHz computer. For instance fl3795, Table3 reports excesses of $38.8$ percent for random restart, $1.87$ percent for always accepting the new locally optimized candidate and $0.58$ percent for the improving-only rule.<Iterated Local Search by Helena R. Lourenço and others>[§3.3.1, Table3 and caption]{ref} That experiment favoured the improving-only rule under its specified setup, even though the abstract example above shows why that rule can sometimes block progress. The problem, embedded search and evaluation budget all matter.
Back to article page
