A simulated annealing algorithm for a two-stage fixed charge distribution problem of a supply chain (Q961457)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A simulated annealing algorithm for a two-stage fixed charge distribution problem of a supply chain |
scientific article; zbMATH DE number 5688076
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simulated annealing algorithm for a two-stage fixed charge distribution problem of a supply chain |
scientific article; zbMATH DE number 5688076 |
Statements
A simulated annealing algorithm for a two-stage fixed charge distribution problem of a supply chain (English)
0 references
30 March 2010
0 references
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.
0 references
fixed charge distribution
0 references
heuristics
0 references
simulated annealing
0 references
supply chain management
0 references
SCM
0 references
two-stage distribution
0 references
total distribution costs
0 references