Tugboat scheduling problem based on trust-based ant colony optimization

  • Authors:
  • Su Wang;Min Zhu;Jun Zheng;Kai Zheng

  • Affiliations:
  • Computer Center, East China Normal University, Shanghai, China;Computer Center, East China Normal University, Shanghai, China;Computer Center, East China Normal University, Shanghai, China;Computer Center, East China Normal University, Shanghai, China

  • Venue:
  • ICICA'12 Proceedings of the Third international conference on Information Computing and Applications
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Tugboat scheduling is an important decision problem in container terminals. This paper proposes a mathematic model of tugboat scheduling and applies an improved Trust-based Ant Colony Optimization method to get the best scheduling plan. The concept of trust value is considered as heuristic information to affect path selecting and the pheromone influence information is introduced to avoid the local optima. The results of the simulation experiment suggests that Trust-based ACO is well suited for tugboat scheduling problem in container terminals and can get better performance than basic ACO.