Metaheuristic approaches to grouping problems in high-throughput cryopreservation operations for fish sperm

  • Authors:

  • T. W. Liao; E Hu;T. R. Tiersch

  • Affiliations:

  • Department of Mechanical and Industrial Engineering, Louisiana State University, Baton Rouge, LA 70803, United States;Aquaculture Research Station, Louisiana Agricultural Experiment Station, Louisiana State University Agricultural Center, Baton Rouge 70803, United States;Aquaculture Research Station, Louisiana Agricultural Experiment Station, Louisiana State University Agricultural Center, Baton Rouge 70803, United States

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

Quantified Score

Hi-index 0.00

Visualization

Abstract

High-throughput cryopreservation operations of fish sperm is a technology being developed by researchers today. This paper first formulates a grouping problem in high-throughput cryopreservation operations of fish sperm and then develops a heuristic and four metaheuristic algorithms for its solution. The heuristic is modified from one originally proposed for the assembly line balancing problem. The four metaheuristic algorithms include simulated annealing (SA), tabu search (TS), ant colony optimization (ACO), and a hybrid differential evolution (hDE). For each metaheuristic algorithm, four different initialization methods were used. For both SA and TS, five different neighborhood solution generation methods were also studied. Real world data collected from a high-throughput cryopreservation operation was used to test the effectiveness of algorithms with different initialization and neighborhood solution generation methods. For comparison, a base line of grouping by processing order was also established. The results indicate that: (i) all algorithms performed better than the base line; (ii) using the result of the modified heuristic as the initial solution of metaheuristic algorithms lead to a better solution; the amount of improvement varied from algorithm to algorithm; (iii) among the five neighborhood solution generation operators, insertion operator was the best; (iv) among all algorithms tested, the hybrid differential evolution is the best, followed by tabu search in terms of average objective value.