An effective VNS for the capacitated p-median problem
暂无分享,去创建一个
[1] Roberto Baldacci,et al. A new method for solving capacitated location problems based on a set partitioning approach , 2002, Comput. Oper. Res..
[2] John E. Beasley,et al. OR-Library: Distributing Test Problems by Electronic Mail , 1990 .
[3] K S Hindi,et al. Efficient solution of large scale, single-source, capacitated plant location problems , 1999, J. Oper. Res. Soc..
[4] Juan A. Díaz,et al. Hybrid scatter search and path relinking for the capacitated p , 2006, Eur. J. Oper. Res..
[5] Nicos Christofides,et al. Capacitated clustering problems by hybrid simulated annealing and tabu search , 1994 .
[6] Warren B. Powell,et al. Clustering algorithms for consolidation of customer orders into vehicle shipments , 1992 .
[7] Roberto Baldacci,et al. A Bionomic Approach to the Capacitated p-Median Problem , 1998, J. Heuristics.
[8] Pierre Hansen,et al. Cooperative Parallel Variable Neighborhood Search for the p-Median , 2004, J. Heuristics.
[9] Nenad Mladenovic,et al. Variable neighbourhood decomposition search for 0-1 mixed integer programs , 2009, Comput. Oper. Res..
[10] Luiz Antonio Nogueira Lorena,et al. A column generation approach to capacitated p-median problems , 2004, Comput. Oper. Res..
[11] Gilbert Laporte,et al. A tabu search heuristic and adaptive memory procedure for political districting , 2003, Eur. J. Oper. Res..
[12] Jafar Fathali,et al. Solving the p-median problem with pos/neg weights by variable neighborhood search and some results for special cases , 2006, Eur. J. Oper. Res..
[13] Hasan Pirkul,et al. Efficient algorithms for the capacitated concentrator location problem , 1987, Comput. Oper. Res..
[14] Pierre Hansen,et al. Variable Neighborhood Search , 2018, Handbook of Heuristics.
[15] P. Hansen,et al. Variable neighborhood search for the p-median , 1997 .
[16] J. Mulvey,et al. Solving capacitated clustering problems , 1984 .
[17] Samad Ahmadi,et al. Guided construction search metaheuristics for the capacitated p-median problem with single source constraint , 2007, J. Oper. Res. Soc..
[18] Samad Ahmadi,et al. Greedy random adaptive memory programming search for the capacitated clustering problem , 2005, Eur. J. Oper. Res..
[19] Pierre Hansen,et al. Variable Neighborhood Decomposition Search , 1998, J. Heuristics.
[20] Rolf Wendolsky,et al. A scatter search heuristic for the capacitated clustering problem , 2006, Eur. J. Oper. Res..
[21] Fred W. Glover,et al. A path relinking approach with ejection chains for the generalized assignment problem , 2006, Eur. J. Oper. Res..
[22] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .