A genetic algorithm based heuristic to the multi-period fixed charge distribution problem

  • Authors:
  • N. Jawahar;N. Balaji

  • Affiliations:
  • Department of Mechanical Engineering, Thiagarajar College of Engineering, Madurai 625 015, India;Department of Mechanical Engineering, Sri Krishna College of Engineering and Technology, Coimbatore 641 008, India

  • Venue:
  • Applied Soft Computing
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper proposes a genetic algorithm (GA) based heuristic to the multi-period fixed charge distribution problem associated with backorder and inventories. The objective is to determine the size of the shipments, backorder and inventories at each period, so that, the total cost incurred during the entire period towards transportation, backorder and inventories is minimum. The model is formulated as pure integer nonlinear programming and 0-1 mixed integer linear programming problems, and proposes a GA based heuristic to provide solution to the above problem. The proposed GA based heuristic is evaluated by comparing their solutions with lower bound, LINGO solver and approximate solutions. The comparisons reveal that the GA generates better solutions than the approximate solutions, and is capable of providing solutions equal to LINGO solutions and closer to the lower bound value of the problems.