• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Mathematical Problems in Engineering >A Hyperheuristic for the Dial-a-Ride Problem with Time Windows
【24h】

A Hyperheuristic for the Dial-a-Ride Problem with Time Windows

机译：带有时间窗的“搭车”问题的超启发式方法

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The dial-a-ride problem with time windows (DARPTW) is a combinatorial optimization problem related to transportation, in which a set of customers must be picked up from an origin location and they have to be delivered to a destination location. A transportation schedule must be constructed for a set of available vehicles, and several constraints have to be considered, particularly time windows, which define an upper and lower time bound for each customer request in which a vehicle must arrive to perform the service. Because of the complexity of DARPTW, a number of algorithms have been proposed for solving the problem, mainly based on metaheuristics such as Genetic Algorithms and Simulated Annealing. In this work, a different approach for solving DARPTW is proposed, designed, and evaluated: hyperheuristics, which are alternative heuristic methods that operate at a higher abstraction level than metaheuristics, because rather than searching in the problem space directly, they search in a space of low-level heuristics to find the best strategy through which good solutions can be found. Although the proposed hyperheuristic uses simple and easy-to-implement operators, the experimental results demonstrate efficient and competitive performance on DARPTW when compared to other metaheuristics from the literature.
机译：带时间窗的乘车拨号问题（DARPTW）是与运输有关的组合优化问题，其中必须从始发地提取一组客户，然后将他们运送到目的地。必须为一组可用的车辆制定运输时间表，并且必须考虑几个约束条件，尤其是时间窗口，这些时间窗口定义了每个客户要求车辆到达以执行服务的上，下时限。由于DARPTW的复杂性，主要基于元启发式算法（例如遗传算法和模拟退火算法），提出了许多算法来解决该问题。在这项工作中，提出，设计和评估了解决DARPTW的另一种方法：超启发法，它是替代启发式方法，比元启发法具有更高的抽象级别，因为它们不是直接在问题空间中搜索，而是在空间中搜索低级启发式算法，以找到可以找到好的解决方案的最佳策略。尽管拟议的启发式方法使用简单且易于实现的运算符，但与文献中的其他元启发式方法相比，实验结果证明了DARPTW的高效和竞争性。

著录项

  • 来源
    《Mathematical Problems in Engineering》 |2015年第1期|707056.1-707056.12|共12页
  • 作者

    Urra Enrique; Cubillos Claudio; Cabrera-Paniagua Daniel;

  • 作者单位

    Pontificia Univ Catolica Valparaiso, Escuela Ingn Informat, Valparaiso 2340025, Chile.;

    Pontificia Univ Catolica Valparaiso, Escuela Ingn Informat, Valparaiso 2340025, Chile.;

    Univ Valparaiso, Escuela Ingn Comercial, Vina Del Mar 2531075, Chile.;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号