A simulated annealing algorithm for a two-stage fixed charge distribution problem of a supply chain
type: Item
instance of: scholarly article
title: A simulated annealing algorithm for a two-stage fixed charge distribution problem of a supply chain
zbMATH Open document ID: 1183.90054
DOI: 10.1504/IJOR.2010.030803
author: A. N. Balaji
author: N. Jawahar
published in: International Journal of Operational Research
publication date: 2010-03-30T00:00:00Z
review text: Summary: 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.
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5688076
zbMATH Keywords: fixed charge distribution
zbMATH Keywords: heuristics
zbMATH Keywords: simulated annealing
zbMATH Keywords: supply chain management
zbMATH Keywords: SCM
zbMATH Keywords: two-stage distribution
zbMATH Keywords: total distribution costs
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 5688076