Selecting a good configuration of one-way and two-way routes using tabu searcht
暂无分享,去创建一个
[1] Fred W. Glover,et al. A study of diversification strategies for the quadratic assignment problem , 1994, Comput. Oper. Res..
[2] Thomas L. Magnanti,et al. Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..
[3] Fred W. Glover,et al. Tabu Thresholding: Improved Search by Nonmonotonic Trajectories , 1995, INFORMS J. Comput..
[4] Jadranka Skorin-Kapov,et al. Tabu Search Applied to the Quadratic Assignment Problem , 1990, INFORMS J. Comput..
[5] G. Marcoulides. Applied Location Theory Models , 1998 .
[6] Saïd Salhi,et al. A Tabu Search Approach for the Resource Constrained Project Scheduling Problem , 1998, J. Heuristics.
[7] Ibrahim H. Osman,et al. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem , 1993, Ann. Oper. Res..
[8] Roberto Battiti,et al. The Reactive Tabu Search , 1994, INFORMS J. Comput..
[9] Fred W. Glover,et al. Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..
[10] P. Marcotte. Network Optimization with Continuous Control Parameters , 1983 .
[11] Zvi Drezner,et al. Selecting an Optimum Configuration of One-Way and Two-Way Routes , 1997, Transp. Sci..
[12] Gilbert Laporte,et al. Metaheuristics: A bibliography , 1996, Ann. Oper. Res..
[13] Fred W. Glover,et al. Tabu Search - Part I , 1989, INFORMS J. Comput..
[14] S. Salhi,et al. Local Search Strategies for the Vehicle Fleet Mix Problem , 1996 .