...
首页> 外文期刊>Networks >Aesthetic Considerations for the Min-Max K-Windy Rural Postman Problem
【24h】

Aesthetic Considerations for the Min-Max K-Windy Rural Postman Problem

机译:Min-Max K-Windy农村邮递员问题的美学考虑

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

The aesthetic quality of routes is a feature of route planning that is of practical importance, but receives relatively little attention in the literature. Several practitioners have pointed out that the visual appeal of a proposed set of routes can have a strong influence on the willingness of a client to accept or reject a specific routing plan. While some work has analyzed algorithmic performance relative to traditional min-sum or min-max objective functions and aesthetic objective functions, we are not aware of any work that has considered a multi-objective approach. This work considers a multi-objective variant of the Min-Max K-Vehicles Windy Rural Postman Problem, discusses several formulations of the problem, and presents computational experiments with a heuristic algorithm. After exploring several formulations, we choose to study the problem with a bi-objective function that includes contributions from the route overlap index and average task distance aesthetic measures. The heuristic extends the cluster-first procedure presented in Lum et al. (Networks 69 (2017), 290-303) by incorporating the new objective function into the improvement phase and adding a perturbation routine. © 2017 Wiley Periodicals, Inc. NETWORKS, Vol. 70(3), 216-232 2017
机译:路线的美学品质是路线规划的一项功能,具有实际重要性,但在文献中却很少受到关注。几位从业者指出,拟议路线的视觉吸引力可能会对客户接受或拒绝特定路线计划的意愿产生重大影响。尽管有些工作已经分析了相对于传统的最小和或最小-最大目标函数和美学目标函数的算法性能,但我们还没有发现任何考虑了多目标方法的工作。这项工作考虑了Min-Max K-Vehicles Windy Rural Postman问题的多目标变体,讨论了该问题的几种公式,并提出了一种启发式算法的计算实验。在探索了几种公式之后,我们选择使用双目标函数来研究问题,该函数包括来自路径重叠指数和平均任务距离美学度量的贡献。启发式方法扩展了Lum等人提出的簇优先程序。 (Networks 69(2017),290-303),将新的目标函数纳入改进阶段并添加了扰动例程。 ©2017 Wiley Periodicals,Inc.网络,卷。 70(3),216-232 2017

著录项

  • 来源
    《Networks》 |2017年第3期|216-232|共17页
  • 作者单位

    Dept. de Estadfstica e Investigation Operativa, Universitat de Valencia (Spain), Valencia, Spain;

    R.H. Smith School of Business, University of Maryland, College Park;

    Dept. Applied Mathematics and Scientific Computation, University of Maryland, College Park;

    Dept. Matematicas para la Economia y la Empresa, Universitat de Valencia (Spain), Valencia, Spain;

    Dept. de Matematica Aplicada, Universidad Politecnica de Valencia (Spain), Valencia, Spain;

  • 收录信息 美国《科学引文索引》(SCI);美国《工程索引》(EI);
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    arc routing problems; min-max objective; aesthetic objective; multi-objective problems;

    机译:电弧布线问题;最小最大目标审美目标多目标问题;

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号