TY - JOUR
ID - 26
TI - Few heuristic optimization algorithms to solve the multi-period fixed charge production-distribution problem
JO - Journal of Computational & Applied Research in Mechanical Engineering (JCARME)
JA - JCARME
LA - en
SN - 2228-7922
AU - Balaji, N.
AU - Jawahar, N.
AD - Department of Mechanical Engineering,Sri Krishna College of Engineering and Technology, Coimbatore
641 008, India
AD - Department of Mechanical Engineering, Thiagarajar College of Engineering, Madurai 625 015, India
Y1 - 2012
PY - 2012
VL - 1
IS - 2
SP - 77
EP - 87
KW - Multi-period fixed charge problem
KW - 0-1 mixed integer programming problem
KW - Genetic Algorithm
KW - Simulated annealing algorithm
KW - Equivalent variable cost
DO - 10.22061/jcarme.2012.26
N2 - This paper deals with a multi-period fixed charge production-distribution problem associated with backorder and inventories. The objective is to determine the size of the shipments from each supplier and backorder and inventories at each period, so that the total cost incurred during the entire period towards production, transportation, backorder and inventories is minimised. A 0-1 mixed integer programming problem is formulated. Genetic algorithm based population search heuristic, Simulated annealing based neighbourhood search heuristic and Equivalent variable cost based simple heuristic are proposed to solve the formulation. The proposed methodologies are evaluated by comparing their solutions with the lower bound solutions. The comparisons reveal that Genetic algorithm and Simulated annealing algorithm generate better solutions than the Equivalent variable cost solutions and are capable of providing solutions close to the lower bound value of the problems.
UR - https://jcarme.sru.ac.ir/article_26.html
L1 - https://jcarme.sru.ac.ir/article_26_39d6347bab19547bdc0f41b167bdf4c4.pdf
ER -