A local search method for periodic inventory routing problem |
| |
| Affiliation: | 1. School of IOT Engineering, Jiangnan University, Wuxi 214122, China;2. Department of Electronics and Information Engineering, Chonbuk National University, Jeonju, Jeonbuk 561756, Republic of Korea;1. Department of Electrical Engineering, National Taiwan University of Science and Technology, Taipei, Taiwan;2. Department of Electrical Engineering, Chang Gung University, Taipei, Taiwan;1. Fraunhofer INT, Appelsgarten 2, D-53879 Euskirchen, Germany;2. Ghent University, Faculty of Economics and Business Administration, Tweekerkenstraat 2, B-9000 Gent, Belgium;1. College of Biomedical Engineering and Instrument Science, Zhejiang University, 310008 Zhou Yiqing Building 510, Zheda road 38#, Hangzhou, Zhejiang, China;2. Department of Information and Communication Engineering, University of Murcia, Spain;1. Institute of Elec and Information Engineering in Hunan University, Changsha 410082, China;2. INESC Porto and Faculty of Engineering, University of Porto, Porto 4099-002, Portugal;3. College of Computer Science, Beijing University of Information Science and Technology, Beijing, China |
| |
| Abstract: | Inventory routing problem considers inventory allocation and routing problems simultaneously, in which the replenishment policies and routing arrangement are determined by the supplier under the vendor managed inventory mode. What we consider here is a periodic inventory routing problem that once the delivery time, quantity and routing are determined, they will remain the same in the following periods. The problem is modeled concisely, and then it is decomposed into two subproblems, inventory problem and vehicle routing problem. The inventory problem is solved by proposing a local search method, which is achieved by four operators on delivery quantity and retailer’s demand. Insertion operator aims to insert a new replenishment point of a retailer while removal operator is to remove a replenishment point. Besides, addition operator is adopted as an assistant tool, and crossover operator is proposed for some special cases. We also propose a tabu search method to solve the routing problem. Finally, the computational results show that the method is efficient and stable. |
| |
| Keywords: | Inventory routing Local search Tabu search Supply chain |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
