Nested Heuristic Methods for the Location-Routeing Problem
针对位置路径问题，提出嵌套启发式方法，将路径规划作为选址的子问题，结合计算几何邻域结构和禁忌搜索，在400个客户的问题集上测试效果良好。
The concept of ‘nested methods’ is adopted to solve the location-routeing problem. Unlike the sequential and iterative approaches, in this method we treat the routeing element as a sub-problem within the larger problem of location. Efficient techniques that take into account the above concept and which use a neighbourhood structure inspired from computational geometry are presented. A simple version of tabu search is also embedded into our methods to improve the solutions further. Computational testing is carried out on five sets of problems of 400 customers with five levels of depot fixed costs, and the results obtained are encouraging.