.png){kind=icon}
返回
A two-phase solution algorithm for the Flexible Periodic Vehicle Routing Problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.cor.2018.05.021.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The Flexible Periodic Vehicle Routing Problem is the problem of visiting a given set of customers considering a certain periodicity to attend their demands. It is a generalization of the Periodic Vehicle Routing Problem where the fixed schedule constraint is relaxed and the quantity to deliver to each customer at each visit is a decision variable. This flexibility leads to remarkable savings in total costs and this explains the interest in studying the problem and developing effective solution approaches. In this work, an iterative two-phase matheuristic is developed to solve medium and large instances of the problem. Computational tests are made on benchmark instances and on newly generated instances. The results of the matheuristic are compared to the best-known solutions, on small-size instances, and to lower bounds on larger instances. Computational results show that good quality solutions are obtained in a reasonable amount of time. (C) 2018 Elsevier Ltd. All rights reserved.
Keyword:
Flexible periodic vehicle routing
Matheuristic
Service frequency
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
Investigation of morphologies and characterization of rare earth metal samarium hexacyanoferrate and its composite with surfactant intercalated graphene oxide for sensor applications.png)
RSC Adv.
RSC Adv.IF0
PREAI
分享收藏分享收藏A diet-dependent enzyme from the human gut microbiome promotes Th17 cell accumulation and colitis
OAAI
IF0
OAAI分享收藏
查看更多内容