A modified Lin-Kernighan traveling-salesman heuristic
| Autor: | Andrew J. Morton, King-Tim Mak |
|---|---|
| Rok vydání: | 1993 |
| Předmět: |
Incremental heuristic search
Heuristic (computer science) Applied Mathematics Management Science and Operations Research 2-opt Travelling salesman problem Industrial and Manufacturing Engineering Simple (abstract algebra) Search algorithm Null-move heuristic Depth-first search Algorithm Software MathematicsofComputing_DISCRETEMATHEMATICS Mathematics |
| Zdroj: | Operations Research Letters. 13:127-132 |
| ISSN: | 0167-6377 |
| DOI: | 10.1016/0167-6377(93)90001-w |
| Popis: | The classic Lin-Kernighan traveling-salesman heuristic is modified so that the scope of its depth search is widened. The modification yields a simple yet effective heuristic that can be easily coded and adapted for general OR applications. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|