Research Article | OPEN ACCESS
Solving Optimal Pricing Model for Perishable Commodities with Imperialist Competitive Algorithm
Bo-Wen Liu
International Business School,
Mathematical Modeling Innovative Practice Base, Zhuhai Campus, Jinan University, Zhuhai, 519070, China
Research Journal of Applied Sciences, Engineering and Technology 2013 2:458-464
Received: May 08, 2012 | Accepted: June 29, 2012 | Published: January 11, 2013
Abstract
The pricing problem for perishable commodities is important in manufacturing enterprise. In this study, a new model based on the profit maximization principle and a discrete demand function which is a negative binomial demand distribution is proposed. This model is used to find out the best combination for price and discount price. The computational results show that the optimal discount price equals the cost of the product. Because the demand functions which involves several different distributions is so complex that the model is hard to solve with normal numerical method. Thus we combine the model with exterior penalty function and applied a novel evolution algorithm-Imperialist Competitive Algorithm (ICA) to solve the problem. Particle Swarm algorithm (PSO) is also applied to solve the problem for comparison. The result shows that ICA has higher convergence rate and execution speed.
Keywords:
Imperialist competitive algorithm, particle swarm algorithm, perishable commodities, pricing model,
Competing interests
The authors have no competing interests.
Open Access Policy
This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
Copyright
The authors have no competing interests.
|
|
|
ISSN (Online): 2040-7467
ISSN (Print): 2040-7459 |
|
Information |
|
|
|
Sales & Services |
|
|
|