Very large-scale neighborhood search
作者： Ravindra K Ahuja , James B Orlin , Dushyant Sharma , None
DOI: 10.1007/978-1-4614-6940-7_13
关键词: Rule of thumb 、 Variable neighborhood search 、 Local search (optimization) 、 Mathematical optimization 、 Search algorithm 、 Very large-scale neighborhood search 、 Mathematics 、 Spanning tree 、 Tabu search 、 Heuristics
摘要: One of the central issues in developing neighborhood search techniques is defining neighborhood. As a rule thumb, larger neighborhoods contain higher quality local optimal solutions compared to smaller neighborhoods. However, also typically require more time than A algorithm not practical if cannot be searched efficiently. Thus, rapid needed make efficient use large
springer.com
sci-hub.se 参考文章(51)
Ravindra K. Ahuja, James B. Orlin, Dushyant Sharma, Multi-Exchange Neighborhood Structures for the Capacitated Minimum Spanning Tree Problem Mathematical Programming. ,vol. 91, pp. 71- 97 ,(2001) , 10.1007/S101070100234
Anita Amberg, Wolfgang Domschke, S. Voß, Capacitated minimum spanning trees: algorithms using intelligent search Research Papers in Economics. ,(1995)
Gilles Pesant, Michel Gendreau, A Constraint Programming Framework for Local Search Methods Journal of Heuristics. ,vol. 5, pp. 255- 279 ,(1999) , 10.1023/A:1009694016861
Mutsunori Yagiura, Takashi Yamaguchi, Toshihide Ibaraki, A Variable Depth Search Algorithm for the Generalized Assignment Problem Meta-Heuristics : Advances and Trends in Local Search Paradigms for Optimization. pp. 459- 471 ,(1999) , 10.1007/978-1-4615-5775-3_31
James B. Orlin, Ravindra K. Ahuja, Dushyant Sharma, New neighborhood search structures for the capacitated minimum spanning tree problem Research Papers in Economics. ,(1998)
César Rego, Catherine Roucairol, A Parallel Tabu Search Algorithm Using Ejection Chains for the Vehicle Routing Problem Springer, Boston, MA. pp. 661- 675 ,(1996) , 10.1007/978-1-4613-1361-8_40
Ellis L. Johnson, Anuj Mehrotra, George L. Nemhauser, Min-cut clustering Mathematical Programming. ,vol. 62, pp. 133- 151 ,(1993) , 10.1007/BF01585164
Silvano Martello, Francesco Maffioli, Mauro Dell'Amico, Annotated Bibliographies in Combinatorial Optimization ,(1997)
James B. Orlin, Thomas L. Magnanti, Ravindra K. Ahuja, Network Flows: Theory, Algorithms, and Applications ,(1993)
Yazid M. Sharaiha, Michel Gendreau, Gilbert Laporte, Ibrahim H. Osman, A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem Networks. ,vol. 29, pp. 161- 171 ,(1997) , 10.1002/(SICI)1097-0037(199705)29:3<161::AID-NET4>3.0.CO;2-F