3-opt
From Infogalactic: the planetary knowledge core
In optimization, 3-opt is a simple local search algorithm for solving the travelling salesman problem and related network optimization problems.
3-opt analysis involves deleting 3 connections (or edges) in a network (or tour), reconnecting the network in all other possible ways, and then evaluating each reconnection method to find the optimum one. This process is then repeated for a different set of 3 connections.
See also
References
- Lua error in package.lua at line 80: module 'strict' not found.
- Lua error in package.lua at line 80: module 'strict' not found. Available as PDF
- Lua error in package.lua at line 80: module 'strict' not found. Available as PDF
- Local Search Heuristics. (n.d.) Retrieved June 16, 2008, from http://www.tmsk.uitm.edu.my/~naimah/csc751/slides/LS.pdf
External links
<templatestyles src="Asbox/styles.css"></templatestyles>
.svg){kind=small} |
This combinatorics-related article is a stub. You can help Wikipedia by expanding it. |
