A Simulated Annealing Algorithm for a two-stage fixed charge distribution problem of a Supply Chain
by A.N. Balaji, N. Jawahar
International Journal of Operational Research (IJOR), Vol. 7, No. 2, 2010

Abstract: This article considers a two-stage distribution problem of a Supply Chain that is associated with a fixed charge. Two kinds of cost are involved in this problem: a continuous cost that linearly increases with the amount transported between a source and a destination, and secondly, a fixed charge, that incurs whenever there exists a transportation of a non-zero quantity between a source and a destination. The objective criterion is the minimisation of the total cost of distribution. A Simulated Annealing Algorithm (SAA) that belongs to heuristic search method is proposed and illustrated. The proposed methodology is evaluated for its solution quality by comparing it with the approximate and lower bound solutions. Thus, the comparison reveals that the SAA generates better solution than the approximation method and is capable of providing solution either equal or closer to the lower bound solution of the problem.

Online publication date: Wed, 06-Jan-2010

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com