A fast optimization method based on a hierarchical strategy for the travelling salesman problem
✍ Scribed by T. Sun; P. Meakin; T. Jøssang
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 656 KB
- Volume
- 199
- Category
- Article
- ISSN
- 0378-4371
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A fast diagonal completion algorithm is developed for constructing a good initial feasible solution for travelling salesman problems. The algorithm can be combined with any tour improvement approach but is specifically considered here in conjunction with the 2-optimal method which is shown to give g
An adjoint optimization method, based on the solution of an inverse flow problem, is proposed. Given a certain performance functional, it is necessary to find its extremum with respect to a flow variable distribution on the domain boundary, for example, pressure. The adjoint formulation delivers the