Publication Type
Conference Proceeding Article
Version
publishedVersion
Publication Date
7-2019
Abstract
This paper studies the Single-Vehicle Cyclic Inventory Routing Problem (SV-CIRP) with the objective of simultaneously minimizing distribution and inventory costs for the customers and maximizing the collected rewards. A subset of customers is selected for the vehicle, including the quantity to be delivered to them. Simulated Annealing (SA) is proposed for solving the problem. Experimental results on 50 benchmark instances show that SA is comparable to the state-of-the-art algorithms. It is able to obtain 12 new best known solutions.
Keywords
Theory of computation, Approximation algorithms analysis, Simulated annealing
Discipline
Artificial Intelligence and Robotics | Theory and Algorithms
Research Areas
Intelligent Systems and Optimization
Publication
GECCO '19: Proceedings of the Genetic and Evolutionary Computation Conference Companion, Prague, Czech Republic, 2019 July 13-17
First Page
1
Last Page
2
ISBN
9781450367486
Identifier
10.1145/3319619.3321888
Publisher
ACM
City or Country
Prague, Czech Republic
Citation
GUNAWAN, Aldy; YU, Vincent F.; WIDJAJA, Audrey T.; and VANSTEENWEGEN, Pieter..
Simulated annealing for the single-vehicle cyclic inventory routing problem. (2019). GECCO '19: Proceedings of the Genetic and Evolutionary Computation Conference Companion, Prague, Czech Republic, 2019 July 13-17. 1-2.
Available at: https://ink.library.smu.edu.sg/sis_research/4473
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Additional URL
https://doi.org/10.1145/3319619.3321888