There has been a massive development of metaheuristic algorithms in the latest decade where swarm intelligence becomes the fundamental approach. Meanwhile, there is still no ideal metaheuristic that can solve all problems superiorly, as declared in the no-free-lunch (NFL) theory. This work introduces a novel swarm-based metaheuristic named as migration-crossover algorithm (MCA). In MCA, the swarm intelligence is enriched with the crossover technique and the neighbourhood search with unbalanced local search space. The global finest solution becomes the reference in the first step while the middle between two stochastically chosen solutions becomes the reference in the second step. The neighbourhood search is performed in the third step. The collection of 23 functions become the use case during the evaluation of MCA. In the first evaluation, MCA is compared with five new metaheuristics: total interaction algorithm (TIA), osprey optimization algorithm (OOA), migration algorithm (MA), coati optimization algorithm (COA), and walrus optimization algorithm (WaOA). The result reveals that MCA is finer than TIA, OOA, MA, COA, and WaOA in 20,19,17,20,and 17 functions subsequently. The result of the second evaluation reveals that the global finest solution becomes the dominant contributor in the high dimension functions while the middle between two stochastically chosen solutions becomes the dominant contributor in the fixed dimension functions.