Title
Tugboat scheduling problem based on trust-based ant colony optimization
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.
Year
DOI
Venue
2012
10.1007/978-3-642-34062-8_49
ICICA (LNCS)
Keywords
Field
DocType
trust-based aco,best scheduling plan,trust-based ant colony optimization,tugboat scheduling problem,improved trust-based ant colony,basic aco,tugboat scheduling,pheromone influence information,important decision problem,heuristic information,container terminal,ant colony optimization
Ant colony optimization algorithms,Decision problem,Heuristic,Job shop scheduling,Scheduling (computing),Local optimum,Computer science,Operations research
Conference
Citations 
PageRank 
References 
0
0.34
7
Authors
4
Name
Order
Citations
PageRank
Su Wang112.09
Min Zhu200.34
Jun Zheng39311.27
Kai Zheng400.68