Matheuristics for the single-path design-balanced service network design problem
详细信息 查看全文
- 作者：Xiangyong Lia ; xyli@tongji.edu.cn" class="auth_mail" title="E-mail the corresponding author ; Kai Weia ; 0359weikai@tongji.edu.cn" class="auth_mail" title="E-mail the corresponding author ; Y.P. Anejab ; aneja@uwindsor.ca" class="auth_mail" title="E-mail the corresponding author ; Peng Tianc ; ptian@sjtu.edu.cn" class="auth_mail" title="E-mail the corresponding author ; Youzhi Cuid ; jcui@cn.ibm.com" class="auth_mail" title="E-mail the corresponding author
- 关键词：Service network design ; Design-balanced constraints ; Single-path constraints ; Local branching ; Relaxation induced neighborhood search
- 刊名：Computers and Operations Research
- 出版年：2017
- 出版时间：January 2017
- 年：2017
- 卷：77
- 期：Complete
- 页码：141-153
- 全文大小：726 K
文摘
- class="listitem" id="list_li0005">
- class="label">•
We introduce and study the single-path design-balanced service network design problem.
- class="label">•
We propose three matheuristics to solve the introduced problem.
- class="label">•
We design a Lagrangian relaxation method to get initial solution in the three methods.
- class="label">•
Computational results show that these approaches reach good performance.