The traveling salesman problem (TSP) is one of the most classical NP-hard problems in the combinatorial optimization. as many practical problems. such as scheduling problems and vehicle-routing cost allocation problems can be abstracted. The introduction of multiobjective in the TSP is a very important research topic. https://thebrickes.shop/product-category/natural-gas-conversion-kit/