Commercial banks are trying to change customer preference from doing banking transactions through branch channels to electronic channels. Consequently, an increasing number of Automated Teller Machines (ATMs) are being setup. This paper deals with Vehicle Routing Problem (VRP) arising from an ATM routing with Simultaneous Delivery and Pick-up (SDP), a real-world routing-scheduling problem. The major goal of this research is to develop an efficient heuristic that solves the ATM routing problem, VRPSDP and produces the optimal solution with the objective of minimizing the distance travelled in a reasonable computation time. Simulated Annealing is developed as the solution methodology and compared with benchmark data-sets. The results are encouraging in terms of solution quality and computation time.
Dr. Anbuudayasankar S. P., K. Ganesh, and K. Mohandas, “Meta-heuristic Approach to Solve Mixed Vehicle Routing Problem with Backhauls in Enterprise Information System of a Service Industry”, in Edited Book “Enterprise Information Systems and Implementing IT Infrastructures: Challenges and Issues", IGI Global Publishing, USA, 2010, pp. 210-225.