| Nowadays more and more transportation services are outsourcing to the Third-PartyLogistics companies, since the Third-Party Logistics services have becoming professional.Logistics providers, as well as suppliers and manufacturers are all involved in thetransportation activities, while the logistics providers are playing the leading roles. In thebackground of supply chain management, optimization of the entire system is the principleof the logistics operation, rather than focus on transportation service providers. One of thecommon tasks that they are facing to, is to reduce both of the transportation cost and penaltycost of delay, while considering supply capacities of suppliers and delivery dates.3PL transportation schedule problems with the background of supply chainmanagement are studied in this paper. Constrains, such as vehicle capacity, fixed dailyoperation plan of vehicles and delivery dates are considered. The objective of this problem isto minimize the transportation cost and the earliness/tardiness penalties. In this paper, wedescribe the3PL transportation schedule model in detail. Two algorithms are proposed forsolving the problem. One of them is heuristic algorithm based on lagrangian relaxationmethod, the other is branch and bound algorithm based on heuristic algorithm. It isconcluded from simulation that the branch and bond algorithm is suitable for optimizingsmall-scale problems, and the heuristic algorithm is suitable for suboptimizing larger-scaleproblems.We also have a case study on building materials transportation problem in aninternational construction project. The3PL transportation schedule model has been expanded,and related model respectively based on vehicle resources contain and segmentedtransportation. We proposed a new heuristic algorithm, combining with the branch andbound algorithm to solve the problem. We present suggestions for the transportationoperations based on the conclusion of sensitivity analysis and comparation. |
PDF Full Text Request