In military logistics operations, the efficient utilization of available space in cargo aircraft enhances operational efficiency while reducing costs. However, the presence of loads with varying shapes, sizes, and characteristics complicates the determination of the optimal placement strategy. One-Dimensional Bin Packing Problem (1D-BPP) was addressed using the Firefly Algorithm (FA), a metaheuristic approach. Heuristic methods based on certain priority rules are considered as initial solution procedures for this problem. The proposed FA-based approach was analyzed at 5 test groups, each consisting of an average of 20 datasets with varying item counts and bin capacities. The proposed FA-based approach has been shown to yield more successful results, especially when used in combination with the First Fit initial solution. Particularly in complex problem instances, the FA-based method achieved up to 90.91% optimality and reduced the average deviation from 5.14% to 0.51%. The results of the study reveal the applicability of the FA-based approach to placement problems such as the 1D-BPP and provide a foundation for future research on its use in more complex problem types.