The digital age has added a new term to the literature of information and computer sciences called as the big data in recent years. Because of the individual properties of the newly introduced term, the definitions of the data-intensive problems including optimization problems have been substantially changed and investigations about the solving capabilities of the existing techniques and then developing their specialized variants for big data optimizations have become important research topic. Artificial Bee Colony (ABC) algorithm inspired by the clever foraging characteristics of the real honey bees is one of the most successful swarm intelligence-based metaheuristics. in this study, a new ABC algorithm-based technique that is named source-linked ABC (slinkABC) was proposed by considering the properties of the optimization problems related with the big data. The slinkABC algorithm was tested on the big data optimization problems presented at the Congress on Evolutionary Computation (CEC) 2015 Big Data Optimization Competition. The results obtained from the experimental studies were compared with the different variants of the ABC algorithm including gbest-guided ABC (GABC), ABC/best/1, ABC/best/2, crossover ABC (CABC), converge-onlookers ABC (COABC), quick ABC (qABC) and modified gbest-guided ABC (MGABC) algorithms. In addition to these, the results of the proposed ABC algorithm were also compared with the results of the Differential Evolution (DE) algorithm, Genetic algorithm (GA), Firefly algorithm (FA), Phase-Based Optimization (PBO) algorithm and Particle Swarm Optimization (PSO) algorithm-based approaches. From the experimental studies, it was understood that the ABC algorithm modified by considering the unique properties of the big data optimization problems as in the slinkABC produces better solutions for most of the tested instances compared to the mentioned optimization techniques.