Journal
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE
Volume 59, Issue -, Pages 131-145Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.omega.2015.05.012
Keywords
Pickup and delivery problem; Loading cost; Branch-and-price; Branch-and-cut; Healthcare transportation
Funding
- Hong Kong Research Grants Council [T32-102/14N]
Ask authors/readers for more resources
In this paper, we propose a branch-and-cut algorithm and a branch-and-price algorithm to solve the pickup and delivery problem with loading cost (PDPLC), which is a new problem derived from the classic pickup and delivery problem (POP) by considering the loading cost in the objective function. Applications of the PDPLC arise in healthcare transportation where the objective function is customer-centric or service-based. In the branch-and-price algorithm, we devise an ad hoc label-setting algorithm to solve the pricing problem and employ the bounded bidirectional search strategy to accelerate the label-setting algorithm. The proposed algorithms were tested on a set of instances generated by a common data generator in the literature. The computational results showed that the branch-and-price algorithm outperformed the branch-and-cut algorithm by a large margin, and can solve instances with 40 requests to optimality in a reasonable time frame. (c) 2015 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available