An improved discrete PSO for tugboat assignment problem under a hybrid scheduling rule in container terminal
From MaRDI portal
Publication:1719017
DOI10.1155/2014/714832zbMath1407.90180OpenAlexW2156465002WikidataQ59071586 ScholiaQ59071586MaRDI QIDQ1719017
Publication date: 8 February 2019
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/714832
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Cites Work
- Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances
- Crane scheduling in container yards with inter-crane interference
- Optimization of the quadratic assignment problem using an ant colony algorithm
- A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan
- Effect of block length and yard crane deployment systems on overall performance at a seaport container transshipment terminal
- Solving uncapacitated multilevel lot-sizing problems using a particle swarm optimization with flexible inertial weight
- A survey of berth allocation and quay crane scheduling problems in container terminals
- A greedy genetic algorithm for the quadratic assignment problem
- Assignment of program modules to processors: a simulated annealing approach.
- Evaluation of the multiobjective ant colony algorithm performances on biobjective quadratic assignment problems
- A crane scheduling method for port container terminals
- Yard crane scheduling in port container terminals
- Tabu Search Applied to the Quadratic Assignment Problem
- Berth allocation planning in the public berth system by genetic algorithms
This page was built for publication: An improved discrete PSO for tugboat assignment problem under a hybrid scheduling rule in container terminal
