Bi-ACO: A Tool for Solving Bi-Criteria Optimization

This paper deals with a hump scheduling problem in marshalling station which can be described as one machine scheduling with two objectives: minimizing the number of tardy jobs; minimizing the maximal tardiness of all the jobs. A bi-ACO algorithm aiming to solve the problem is proposed and an external collection E(P) is designed to find the approximation of frontier of the area of efficient solutions, which is used to record and update the pheromone. Meanwhile, two efficient problem-specific heuristics for each criterion have been developed. To validate the algorithm, experimental case is devoted and conclusions are discussed in the last section.