...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IFAC PapersOnLine >A Branch and Price algorithm for the electric capacitated profitable tour problem with mandatory stops
【24h】

A Branch and Price algorithm for the electric capacitated profitable tour problem with mandatory stops

机译：带有强制止损的带有电气功能的获利游览问题的分支和价格算法

获取原文
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In this paper, a generalization of the capacitated profitable tour problem is presented. Since recharging time and driver’s lunch breaks are commonly considered as an idle time, the aim is to synchronize those activities choosing restaurants where electric vehicles can be charged. Due to visiting restaurants has an associated cost, the problem can also be seen as a problem with location issues. This variant is pertinent especially in a city logistics context. A mathematical model is proposed, as well as a Branch-and-Price algorithm which is able to solve instances with up to 100 customers and 13 restaurants.
机译：在本文中，给出了获利的获利旅行问题的推广。由于充电时间和驾驶员的午休时间通常被视为空闲时间，因此，其目的是使那些选择可以向电动汽车充电的餐厅的活动同步进行。由于去餐厅有相关的费用，因此该问题也可以看作是位置问题。此变体在城市物流环境中尤其重要。提出了一个数学模型，以及一种能够解决多达100个客户和13个餐厅的实例的“分支定价”算法。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号