Journal
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
Volume 48, Issue 13, Pages 3957-3976Publisher
TAYLOR & FRANCIS LTD
DOI: 10.1080/00207540902922851
Keywords
supply chain network design; vehicle routing; LP-relaxation; heuristic algorithm
Categories
Funding
- Korean Ministry of Education, Science and Technology
Ask authors/readers for more resources
Recently, the multi-level and multi-facility industrial problem in supply chain management (SCM) has been widely investigated. One of the key issues, central to this problem in the current SCM research area is the interdependence among the location of facilities, the allocation of facilities, and the vehicle routing for the supply of raw materials and products. This paper studies the supply chain network design problem, which involves the location of facilities, allocation of facilities, and routing decisions. The proposed problem has some practical applications. For example, it is necessary for third party logistics (3PL) companies to manage the design of the network and to operate vehicle transportation. The purpose of this study is to determine the optimal location, allocation, and routing with minimum cost to the supply chain network. The study proposes two mixed integer programming models, one without routing and one with routing, and a heuristic algorithm based on LP-relaxation in order to solve the model with routing. The results show that a developed heuristic algorithm is able to find a good solution in a reasonable time.
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