The Chain-Interchange Heuristic Method
Yugoslav journal of operations research, Tome 6 (1996) no. 1.
Voir la notice de l'article dans eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
This paper describes a new Tabu search-like technique for solving
combinatorial optimization problems . The chain-interchange move is introduced,
which is an extension of the well -known 1-interchange move. Instead of interchanging
one solution attribute that is in the solution with one that is not, four attributes are
interchanged. In that way the Tabu search recency-based memory is easily obtained,
i.e., the possibility of getting out of the local optimum trap can be achieved without
additional efforts . Some location-allocation problems that could be solved by the same
chain-interchange algorithm by only changing the objective function are listed.
Moreover, most of the problems listed are suggested for the first time to be solved by
Tabu search method (TS). Computer results are reported.
@article{YJOR_1996_6_1_a3, author = {Nenad Mladenovi\'c and Jos\'e A. Moreno and J. Marcos Moreno-Vega}, title = {The {Chain-Interchange} {Heuristic} {Method}}, journal = {Yugoslav journal of operations research}, pages = {41 - 54}, publisher = {mathdoc}, volume = {6}, number = {1}, year = {1996}, url = {https://geodesic-test.mathdoc.fr/item/YJOR_1996_6_1_a3/} }
TY - JOUR AU - Nenad Mladenović AU - José A. Moreno AU - J. Marcos Moreno-Vega TI - The Chain-Interchange Heuristic Method JO - Yugoslav journal of operations research PY - 1996 SP - 41 EP - 54 VL - 6 IS - 1 PB - mathdoc UR - https://geodesic-test.mathdoc.fr/item/YJOR_1996_6_1_a3/ ID - YJOR_1996_6_1_a3 ER -
Nenad Mladenović; José A. Moreno; J. Marcos Moreno-Vega. The Chain-Interchange Heuristic Method. Yugoslav journal of operations research, Tome 6 (1996) no. 1. https://geodesic-test.mathdoc.fr/item/YJOR_1996_6_1_a3/