.png){kind=icon}
返回
An efficient column-generation-based algorithm for solving a pickup-and-delivery problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2011.02.009.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We introduce a new variation of the pickup-and-delivery problem. Current methods for solving this problem rely on column-generation subroutines embedded in a branch-and-bound tree. Yet, when applied to our problem, these techniques suffer from significant combinatorial explosion in the number of routes generated by the column-generation subroutine and the number of nodes explored in the branch-and-bound tree. In this paper, by exploiting the problem structure, we develop a specialized column-generation subroutine that reduces the combinatorial explosion significantly leading to a more efficient procedure to solve the problem. (C) 2011 Elsevier Ltd. All rights reserved.
Keyword:
Pickup-and-delivery problems
Column generation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
Molecular genetics and biochemistry of N-acetyltaurine degradation by Cupriavidus necator H16.png)
Microbiology
OAAI
MicrobiologyIF0
OAAI分享收藏An NMR crystallography DFT-D approach to analyse the role of intermolecular hydrogen bonding and π–π interactions in driving cocrystallisation of indomethacin and nicotinamideCrystEngComm
CrystEngCommIF0
PREAI
分享收藏
分享收藏
查看更多内容