Journal
JOURNAL OF MANUFACTURING SYSTEMS
Volume 30, Issue 2, Pages 83-92Publisher
ELSEVIER SCI LTD
DOI: 10.1016/j.jmsy.2011.04.005
Keywords
Vehicle routing problem; Competitive situation; Transportation; Simulated annealing
Categories
Funding
- University of Tehran [8106043/1/14]
Ask authors/readers for more resources
This paper presents an extension of a competitive vehicle routing problem with time windows (VRPTW) to find short routes with the minimum travel cost and maximum sale by providing good services to customers before delivering the products by other rival distributors. In distribution of the products with short life time that customers need special device for keeping them, reaching time to customers influences on the sales amount which the classical VRPs are unable to handle these kinds of assumptions. Hence, a new mathematical model is developed for the proposed problem and for solving the problem, a simulated annealing (SA) approach is used. Then some small test problems are solved by the SA and the results are compared with obtained results from Lingo 8.0. For large-scale problems, the, Solomon's benchmark instances with additional assumption are used. The results show that the proposed SA algorithm can find good solutions in reasonable time. (C) 2011 The Society of Manufacturing Engineers. Published by Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available