Abstract: The Traveling Salesman Problem (TSP), a classic combinatorial optimization problem, has been extensively studied for many years. Recently, the Multi-solution Traveling Salesman Problem ...
Abstract: This paper presents a novel neural network-based optimization framework, NNDE, to solve the traveling salesman problem (TSP). The core idea is to use a radial basis function network (RBFN) ...
This project implements a genetic algorithm to optimize and reduce chemical reaction mechanisms using Cantera. The goal is to create reduced mechanisms that maintain accuracy while minimizing the ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results