A heuristic to generate input sequence for simulated annealing to solve VRP. (6th August 2010)

• Record Type: Journal Article
• Authors: Dhanalakshmi, R.; Parthiban, P.; Ghatak, Anirban
• Is Part Of: International journal of enterprise network management. Volume 4:Number 1(2010)
• Page Start: 26
• Page End: 38
• Publication Date: 2010-08-06
• Subjects: heuristics -- shrink wrap algorithm -- simulated annealing -- input sequences -- vehicle routing problem -- VRP -- automated scheduling -- logistics planning; Business logistics -- Management -- Periodicals; Business enterprises -- Management -- Periodicals; 658.7205
• Languages: English
• ISSNs: 1748-1252

Abstract

This paper addresses the issue of input sequence, which affects the results of simulated annealing (SA) for vehicle routing problem (VRP). Also, a heuristic has been proposed which improves the result by 1.7% than the well known and frequently used input sequence. With its ability to provide solutions of good quality at low computing times, the proposed heuristic has ample scope for application as an automated scheduler when implemented at the site of a logistics-planning cell.