Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests
详细信息 查看全文
- 作者：Yuan Li ; yuan.li@utt.fr" class="auth_mail" title="E-mail the corresponding author ; yuan296103@gmail.com" class="auth_mail" title="E-mail the corresponding author ; Haoxun Chen haoxun.chen@utt.fr" class="auth_mail" title="E-mail the corresponding author ; Christian Prins christian.prins@utt.fr" class="auth_mail" title="E-mail the corresponding author
- 关键词：Vehicle routing problem ; Pickup and delivery problem ; Time window ; Profit ; Adaptive large neighborhood search
- 刊名：European Journal of Operational Research
- 出版年：2016
- 出版时间：1 July 2016
- 年：2016
- 卷：252
- 期：1
- 页码：27-38
- 全文大小：868 K
文摘
- class="listitem" id="list_celist0005">
- class="label">•
A new vehicle routing problem is modeled.
- class="label">•
This paper solves core sub-problem that appeared in carrier collaboration.
- class="label">•
An adaptive large neighborhood search is applied to a vehicle routing problem with profits.
- class="label">•
Request selection and routing decision are handled simultaneously by a new mechanism.