Abstract
In this work, we investigate transit time in transportation service procurement, which is conducted by shippers using auctions to purchase transportation service from carriers in the planning stage. Besides cost, we find that many shippers are most concerned with transit time in practice; shorter transit time indicates better transportation service. To minimize both the total cost and transit time, the problem faced by shippers is the biobjective transportation service procurement problem with transit time. To solve the problem, we introduce a biobjective integer programming model that can also accommodate some important business constraints. A biobjective branch-and-bound algorithm that finds all extreme supported nondominated solutions is developed. To speed up the algorithm, two fast feasibility checks, a network flow model for particular subproblems, and lower bounds from relaxation are proposed. In addition, a sophisticated heuristic is introduced to meet shipper’s requirements in some situations. Computational experiments on evaluating the performance of the algorithms are conducted on a set of test instances that are generated from practical data.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
