Publication Type

Conference Proceeding Article

Version

acceptedVersion

Publication Date

8-2019

Abstract

This paper studies the Multi-Vehicle Cyclic Inventory Routing Problem (MV-CIRP) as the extension of the Single-Vehicle CIRP (SV-CIRP). The objective is to minimize both distribution and inventory costs at the customers and to maximize the collected rewards simultaneously. The problem is treated as a single objective optimization problem. A subset of customers is selected for each vehicle including the quantity to be delivered to each customer. For each vehicle, a cyclic distribution plan is developed. We construct a mathematical programming model and propose a simulated annealing (SA) metaheuristic for solving both SV-CIRP and MV-CIRP. For SV-CIRP, experimental results on benchmark instances show that SA is comparable to the state-of-the-art algorithms and it is able to improve 12 best known solutions. For the MV-CIRP, the results show that SA performs better than an Iterated Local Search algorithm.

Keywords

Cyclic Inventory Routing problem, Simulated Annealing, multiple vehicles

Discipline

Operations Research, Systems Engineering and Industrial Engineering | Theory and Algorithms

Research Areas

Intelligent Systems and Optimization

Publication

2019 IEEE 15th International Conference on Automation Science and Engineering: Vancouver, Canada, August 22-26: Proceedings

First Page

691

Last Page

696

ISBN

9781728103563

Identifier

10.1109/COASE.2019.8842945

Publisher

IEEE

City or Country

Piscataway, NJ

Embargo Period

7-7-2021

Copyright Owner and License

Authors

Additional URL

https://doi.org/10.1109/COASE.2019.8842945

Download

Share

COinS