摘要翻译:
本文提出了一个框架来解决用标准优化技术难以解决的丰富的车辆路径问题。我们在变邻域搜索的基础上使用局部搜索来构造解,但将这些技术嵌入到一个灵活的框架中,允许考虑问题的复杂侧约束,如时间窗、多个仓库、异构车队,尤其是多个优化准则。为了确定一个符合决策者要求的折衷方案,在问题的解决中集成了一个交互过程,允许修改决策者所表达的偏好信息。该框架在计算机系统中原型实现。首先,给出了带时间窗的多车辆段车辆路径问题的试验结果。
---
英文标题:
《A framework for the interactive resolution of multi-objective vehicle
routing problems》
---
作者:
Martin Josef Geiger, Wolf Wenger
---
最新提交年份:
2008
---
分类信息:
一级分类:Computer Science 计算机科学
二级分类:Artificial Intelligence 人工智能
分类描述:Covers all areas of AI except Vision, Robotics, Machine Learning, Multiagent Systems, and Computation and Language (Natural Language Processing), which have separate subject areas. In particular, includes Expert Systems, Theorem Proving (although this may overlap with Logic in Computer Science), Knowledge Representation, Planning, and Uncertainty in AI. Roughly includes material in ACM Subject Classes I.2.0, I.2.1, I.2.3, I.2.4, I.2.8, and I.2.11.
涵盖了人工智能的所有领域,除了视觉、机器人、机器学习、多智能体系统以及计算和语言(自然语言处理),这些领域有独立的学科领域。特别地,包括专家系统,定理证明(尽管这可能与计算机科学中的逻辑重叠),知识表示,规划,和人工智能中的不确定性。大致包括ACM学科类I.2.0、I.2.1、I.2.3、I.2.4、I.2.8和I.2.11中的材料。
--
---
英文摘要:
The article presents a framework for the resolution of rich vehicle routing problems which are difficult to address with standard optimization techniques. We use local search on the basis on variable neighborhood search for the construction of the solutions, but embed the techniques in a flexible framework that allows the consideration of complex side constraints of the problem such as time windows, multiple depots, heterogeneous fleets, and, in particular, multiple optimization criteria. In order to identify a compromise alternative that meets the requirements of the decision maker, an interactive procedure is integrated in the resolution of the problem, allowing the modification of the preference information articulated by the decision maker. The framework is prototypically implemented in a computer system. First results of test runs on multiple depot vehicle routing problems with time windows are reported.
---
PDF链接:
https://arxiv.org/pdf/0809.0610