Base station placement in indoor wireless systems using binary integer programming

2006 ◽  
Vol 153 (5) ◽  
pp. 771 ◽  
Author(s):  
J.K.L. Wong ◽  
A.J. Mason ◽  
M.J. Neve ◽  
K.W. Sowerby
Keyword(s):  
Integer Programming ◽  
Wireless Systems ◽  
Base Station ◽  
Binary Integer Programming ◽  
Indoor Wireless ◽  
Base Station Placement

scholarly journals Reshuffle minimisation to improve storage yard operations efficiency

2021 ◽  
Vol 15 ◽  
pp. 174830262199401
Author(s):  
Hammed Bisira ◽  
Abdellah Salhi
Keyword(s):  
Integer Programming ◽  
Programming Model ◽  
Heuristic Approach ◽  
Container Terminals ◽  
Exact Method ◽  
Computational Results ◽  
Binary Integer Programming ◽  
Integer Programming Model ◽  
Compatibility Test ◽  
Storage Area

There are many ways to measure the efficiency of the storage area management in container terminals. These include minimising the need for container reshuffle especially at the yard level. In this paper, we consider the container reshuffle problem for stacking and retrieving containers. The problem was represented as a binary integer programming model and solved exactly. However, the exact method was not able to return results for large instances. We therefore considered a heuristic approach. A number of heuristics were implemented and compared on static and dynamic reshuffle problems including four new heuristics introduced here. Since heuristics are known to be instance dependent, we proposed a compatibility test to evaluate how well they work when combined to solve a reshuffle problem. Computational results of our methods on realistic instances are reported to be competitive and satisfactory.

Sign in / Sign up

Export Citation Format

Share Document