请输入您要查询的英文单词:

 

单词 travelling salesman problem
释义

travelling salesman problem

noun
A mathematical problem in which one has to find which is the shortest route which passes through each of a set of points once and only once.Instead of starting with random collections of answers, such as the various routes in the travelling salesman problem, GP begins with random collections of mathematical operations and inputs: add, x, sine, multiply, y, and so on....
  • A classic example is the travelling salesman problem, which entails working out the shortest route connecting a large number of points in space so that each is visited just once.
  • These ‘ants’ are good for solving a classic algorithm problem, the so-called ‘travelling salesman problem.
随便看

 

英语词典包含243303条英英释义在线翻译词条,基本涵盖了全部常用单词的英英翻译及用法,是英语学习的有利工具。

 

Copyright © 2004-2022 Newdu.com All Rights Reserved
更新时间:2024/11/11 12:23:11