Nozomi Hitomi

Nozomi Hitomi

Auto-generated profile, based on publicly available information

Nozomi Hitomi

Nozomi Hitomi is with the Sibley School of Mechanical and Aerospace Engineering, Cornell University, Ithaca, NY 14850 USA

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 August 2019 in Acta Astronautica
Verified
Journal Article
Closed access
PBPau Garcia Buzzi
Pau Garcia Buzzi
DSDaniel Selva
Daniel Selva
NHNozomi Hitomi
Nozomi Hitomi
WBWilliam J. Blackwell
William J. Blackwell

24 August 2016 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
NHNozomi Hitomi
Nozomi Hitomi
DSDaniel Selva
Daniel Selva
Adaptive operator selection (AOS) is a high-level controller for an optimization algorithm that monitors the performance of a set of operators with a credit assignment strategy and adaptively applies the high performing operators with an operator selection strategy. AOS can improve the overall performance of an optimization algorithm across a wide range of problems, and it has shown promise on single-objective problems where defining an appropriate credit assignment that assesses an operator’s impact is relatively straightforward. However, there is currently a lack of AOS for multiobjective problems (MOP) because defining an appropriate credit assignment is nontrivial for MOPs. To identify and examine the main factors in effective credit assignment strategies, this paper proposes a classification that groups credit assignment strategies by the sets of solutions used to assess an operator’s impact and by the fitness function used to compare those sets of solutions. Nine credit assignment strategies, which include five newly proposed ones, are compared experimentally on standard benchmarking problems. Results show that eight of the nine credit assignment strategies are effective in elevating the generality of a multiobjective evolutionary algorithm and outperforming a random operator selector.

1 May 2018 in Applied Soft Computing
Verified
Journal Article
Closed access
NHNozomi Hitomi
Nozomi Hitomi
DSDaniel Selva
Daniel Selva

21 August 2016
Verified
Conference Paper
Closed access
PDF file
NHNozomi Hitomi
Nozomi Hitomi
DSDaniel Selva
Daniel Selva
Evolutionary algorithms have shown much success in solving real-world design problems, but they are considered computationally inefficient because they rely on many objective-function evaluations instead of leveraging domain knowledge to guide the optimization. An evolutionary algorithm’s performance can be improved by utilizing operators called domain-specific heuristics that incorporate domain knowledge, but existing knowledge-intensive algorithms utilize one or two domain-specific heuristics, which limits the amount of incorporated knowledge or treats all knowledge as equally effective. We propose a hyperheuristic approach that efficiently utilizes multiple domain-specific heuristics that incorporate knowledge from different sources by allocating computational resources to the effective ones. Furthermore, a hyperheuristic allows the simultaneous use of conventional evolutionary operators that assist in escaping local optima. This paper empirically demonstrates the efficacy of the proposed hyperheuristic approach on a multi-objective design problem for an Earth observation satellite system. Results show that the hyperheuristic approach significantly improves the search performance compared to an evolutionary algorithm that does not use any domain knowledge.