A heuristic to generate input sequence for simulated annealing to solve VRP

R. Dhanalakshmi, P. Parthiban and Anirban Ghatak ()

International Journal of Enterprise Network Management, 2010, vol. 4, issue 1, 26-38

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.

Keywords: heuristics; shrink wrap algorithm; simulated annealing; input sequences; vehicle routing problem; VRP; automated scheduling; logistics planning. (search for similar items in EconPapers)
Date: 2010
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=34474 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijenma:v:4:y:2010:i:1:p:26-38

Access Statistics for this article

More articles in International Journal of Enterprise Network Management from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().