A Novel Algorithm for Solving the Prize Collecting Traveling Salesman Problem Based on DNA Computing
Abstract: DNA computing is a new pattern of computing that combines biotechnology and information technology. As a new technology born in less than three decades, it has developed at an extremely ...
This is an optimization problem in the AtCoder Heuristic Contest (AHC) format. This problem is a very interesting one that combines two core elements: the "transportation route optimization (a type of ...
Abstract: The sparrow search algorithm (SSA) tends to fall into local optima and to have insufficient stagnation when applied to the traveling salesman problem (TSP). To address this issue, we propose ...
Simply sign up to the Hedge funds myFT Digest -- delivered directly to your inbox. Morning! After some dabbling in the genre, FT Alphaville is starting an informal series of simple Q&A interviews. The ...
1 Transportation Engineering College, Dalian Maritime University, Dalian, China. 2 School of Maritime Economics and Management, Dalian Maritime University, Dalian, China. With the development of the ...
Vehicle Routing Problem or simply VRP is a well known combinatorial optimization problem and a generalization of the travelling salesman problem. A definition of the problem is this: We have a number ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results