.png){kind=icon}
返回
Pruning in column generation for service vehicle dispatching
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-007-0275-0.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Column generation techniques have become a widely used technique to successfully solve large (integer) linear programs. One of the keys to obtaining a practically efficient algorithm is to have a fast method to limit the pricing of new columns to a small set. We study a large scale real-world vehicle dispatching problem with soft time windows which can be modeled as an integer linear program of set partitioning type. We develop a new pruning scheme based on matchings in order to speed up the branch-and-bound enumeration in the column generation process. Computational results on real-world data illustrate the effectiveness of the new pruning scheme.
Keyword:
ROUTING PROBLEM
OPTIMIZATION ALGORITHM
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.5
论文数:
8.1K
被引数:
2.1W
机构
引用论文
An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems.png)
Networks
NetworksIF0
PREAI
分享收藏
查看更多内容