An approach to determine storage locations of containers at seaport terminals
Computers and Operations Research
A genetic algorithm for solving economic lot size scheduling problem
Computers and Industrial Engineering - 26th International conference on computers and industrial engineering
A genetic algorithm to solve the storage space allocation problem in a container terminal
Computers and Industrial Engineering
Recency-based storage assignment and warehouse configuration for recurrent demands
Computers and Industrial Engineering
Hybrid genetic simulated annealing algorithm (HGSAA) to solve storage container problem in port
ACIIDS'12 Proceedings of the 4th Asian conference on Intelligent Information and Database Systems - Volume Part II
A GRASP approach to transporter scheduling and routing at a shipyard
Computers and Industrial Engineering
Determination of the locations and capacities of sugar cane loading stations in Thailand
Computers and Industrial Engineering
| Hi-index | 0.00 |
This paper focuses on the planar storage location assignment problem (PSLAP) that needs to be clearly defined and newly formulated. In addition, the solving procedure should be developed. The PSLAP can be defined as the assignment of the inbound and outbound objects to the storage yard with aim of minimizing the number of obstructive object moves. The storage yard allows only planar moves of objects. The PSLAP usually occurs in the assembly block stockyard operations at a shipyard. This paper formulates the PSLAP using a mathematical programming model, but which belongs to the NP-hard problems category. Thus this paper utilizes an efficient genetic algorithm (GA) to solve the PSLAP for real-sized instances. The performance of the proposed mathematical programming model and developed GA is verified by a number of numerical experiments.