In this paper, we propose a structural design methodology called \textit{data-driven topology design}, which aims to obtain high-performance material distributions for a multi-objective optimization problem from the initially given material distributions in a given design domain. Its basic idea is iterating the following processes: (i) selecting the material distributions from a dataset according to Pareto optimality, (ii) generating new material distributions using a deep generative model with the selected material distributions as the training data, and (iii) integrating the generated material distributions into the dataset. Because of the nature of a deep generative model, the generated material distributions are diverse and inheriting features of the training data, which are material distributions on the Pareto front at that specific point. Therefore, it is expected that some of the generated material distributions are superior to the training data, whereas some are inferior, and the Pareto front is improved by integrating the generated material distributions into the dataset. The Pareto front is further improved by iterating the above processes. Data-driven topology design is used to enhance a support system for determining appropriate formulations of topology optimization problems, and its usefulness is demonstrated through numerical examples.

Solution-Guided Multi-Point Constructive Search (SGMPCS) is a novel constructive search technique that performs a series of resource-limited tree searches where each search begins either from an empty solution (as in randomized restart) or from a solution that has been encountered during the search. A small number of these "elite solutions is maintained during the search. We introduce the technique and perform three sets of experiments on the job shop scheduling problem. First, a systematic, fully crossed study of SGMPCS is carried out to evaluate the performance impact of various parameter settings. Second, we inquire into the diversity of the elite solution set, showing, contrary to expectations, that a less diverse set leads to stronger performance. Finally, we compare the best parameter setting of SGMPCS from the first two experiments to chronological backtracking, limited discrepancy search, randomized restart, and a sophisticated tabu search algorithm on a set of well-known benchmark problems. Results demonstrate that SGMPCS is significantly better than the other constructive techniques tested, though lags behind the tabu search.

Solution-Guided Multi-Point Constructive Search (SGMPCS) is a novel constructive search technique that performs a series of resource-limited tree searches where each search begins either from an empty solution (as in randomized restart) or from a solution that has been encountered during the search. A small number of these "elite'' solutions is maintained during the search. We introduce the technique and perform three sets of experiments on the job shop scheduling problem. First, a systematic, fully crossed study of SGMPCS is carried out to evaluate the performance impact of various parameter settings. Second, we inquire into the diversity of the elite solution set, showing, contrary to expectations, that a less diverse set leads to stronger performance. Finally, we compare the best parameter setting of SGMPCS from the first two experiments to chronological backtracking, limited discrepancy search, randomized restart, and a sophisticated tabu search algorithm on a set of well-known benchmark problems. Results demonstrate that SGMPCS is significantly better than the other constructive techniques tested, though lags behind the tabu search.