The hunger games search algorithm (HGS) is a newly proposed meta-heuristic algorithm that emulates hunger-driven foraging behaviors in a population. It combines fitness values to determine individual weights and updates them based on fitness value size, resulting in high adaptability and effective optimization. However, HGS faces issues like low convergence accuracy and susceptibility to local optima in complex optimization problems. To address these problems, an improved version called BDFXHGS is introduced. BDFXHGS incorporates a collaborative feeding strategy based on HGS's design advantages. Individuals approach others based on hunger degree, facilitating information exchange and resolving convergence and accuracy issues. BDFXHGS combines a disperse foraging strategy and a directional crossover strategy to enhance exploration and convergence speed. The paper conducts qualitative analysis and ablation experiments to examine the effectiveness of the strategies. Comparative experiments are performed using IEEE CEC 2017 benchmark functions to compare BDFXHGS with competitive algorithms, including previous champion algorithms in different dimensions. Additionally, BDFXHGS is evaluated on 25 constrained optimization problems from the IEEE CEC 2020 competition and 5 real engineering optimization problems. Experimental results show that BDFXHGS performs well on benchmarks and outperforms other algorithms in real-world applications.