Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10347211 | Computers & Operations Research | 2011 | 9 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Prahalad Venkateshan, Kamlesh Mathur,