.png){kind=icon}
.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Pickup-and-delivery problems
Column generation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W