Vehicle routing scheduling for cross-docking in the supply chain
- Title
- Vehicle routing scheduling for cross-docking in the supply chain
- Author
- 이영해
- Keywords
- supply chain management (SCM); cross-docking; vehicle routing scheduling; tabu search algorithm
- Issue Date
- 2006-10
- Publisher
- PERGAMON-ELSEVIER SCIENCE LTD
- Citation
- COMPUTERS & INDUSTRIAL ENGINEERING, v. 51, No. 2, Page. 247-256
- Abstract
- One of the most important factors in implementing supply chain management is to efficiently control the physical flow of the supply chain. Due to its importance, many companies are trying to develop efficient methods to increase customer satisfaction and reduce costs. In various methods, cross-docking is considered a good method to reduce inventory and improve responsiveness to various customer demands. However, previous studies have dealt mostly with the conceptual advantages of cross-docking or actual issues from the strategic viewpoint. It is also necessary, however, to considering cross-docking from an operational viewpoint in order to find the optimal vehicle routing schedule. Thus, an integrated model considering both cross-docking and vehicle routing scheduling is treated in this study. Since this problem is known as NP-hard, a heuristic algorithm based on a tabu search algorithm is proposed. In the numerical example, our proposed algorithm found a good solution whose average percentage error was less than 5% within a reasonable amount of time. (c) 2006 Elsevier Ltd. All rights reserved.
- URI
- https://www.sciencedirect.com/science/article/pii/S036083520600091Xhttps://repository.hanyang.ac.kr/handle/20.500.11754/108733
- ISSN
- 0360-8352; 1879-0550
- DOI
- 10.1016/j.cie.2006.02.006
- Appears in Collections:
- COLLEGE OF ENGINEERING SCIENCES[E](공학대학) > INDUSTRIAL AND MANAGEMENT ENGINEERING(산업경영공학과) > Articles
- Files in This Item:
There are no files associated with this item.
- Export
- RIS (EndNote)
- XLS (Excel)
- XML