.png){kind=icon}
返回
A new local search for continuous location problems
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2013.06.022.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a new local search approach for solving continuous location problems. The main idea is to exploit the relation between the continuous model and its discrete counterpart. A local search is first conducted in the continuous space until a local optimum is reached. It then switches to a discrete space that represents a discretisation of the continuous model to find an improved solution from there. The process continues switching between the two problem formulations until no further improvement can be found in either. Thus, we may view the procedure as a new adaption of formulation space search. The local search is applied to the multi-source Weber problem where encouraging results are obtained. This local search is also embedded within Variable Neighbourhood Search producing excellent results. (c) 2013 Elsevier B.V. All rights reserved.
Keyword:
Continuous location
Weber problem
Space search formulation
Variable neighbourhood
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
分享收藏A multi-level composite heuristic for the multi-depot vehicle fleet mix problem多车场车队混合问题的多级复合启发式
PREAI
分享收藏
查看更多内容