Branch-and-price algorithm for the location-routing problem with time windows
详细信息 查看全文
- 作者：Sattrawut Ponboon ; sattrawut.ponboon.47n@st.kyoto-u.ac.jp" class="auth_mail" title="E-mail the corresponding author ; Ali Gul Qureshi aligul@kiban.kuciv.kyoto-u.ac.jp" class="auth_mail" title="E-mail the corresponding author ; Eiichi Taniguchi taniguchi@kiban.kuciv.kyoto-u.ac.jp" class="auth_mail" title="E-mail the corresponding author
- 关键词：Location-routing problem ; Time windows ; Branch-and-price ; Column generation ; Labeling algorithm ; Exact solution
- 刊名：Transportation Research Part E: Logistics and Transportation Review
- 出版年：2016
- 出版时间：February 2016
- 年：2016
- 卷：86
- 期：Complete
- 页码：1-19
- 全文大小：1031 K
文摘
- •
This study models the branch-and-price algorithm to solve the LRPTW to optimality.
- •
The acceleration strategies have been developed to improve computational processes.
- •
New test instances of the LRPTW, modified from literature are presented and expected to be the new benchmarks.
- •
The effects and characteristics of time windows in location-routing are highlighted.
- •
The newly developed exact algorithm can be used to solve small scale instances of the LRPTW directly.