Simulated annealing for the single-vehicle cyclic inventory routing problem

• Main Authors: GUNAWAN, Aldy, YU, Vincent F., WIDJAJA, Audrey T., VANSTEENWEGEN, Pieter.
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2019
• Subjects: Theory of computation; Approximation algorithms analysis; Simulated annealing; Artificial Intelligence and Robotics; Theory and Algorithms
• Online Access: https://ink.library.smu.edu.sg/sis_research/4473; https://ink.library.smu.edu.sg/context/sis_research/article/5476/viewcontent/Simulated_Annealing_for_the_Single_Vehicle_Cyclic_Inventory_Routing_Problem.pdf
• Institution: Singapore Management University

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.