Optimization of the material flow in a manufacturing plant by use of artificial bee colony algorithm

Authors:
Alejandro Alvarado-Iniesta;Jorge L. Garcia-Alcaraz;Manuel Ivan Rodriguez-Borbon;Aide Maldonado
Affiliations:
Department of Industrial and Manufacturing Engineering, Autonomous University of Ciudad Juarez, Ave. Del Charro 450 Norte, Ciudad Juarez, Chihuahua 32315, Mexico;Department of Industrial and Manufacturing Engineering, Autonomous University of Ciudad Juarez, Ave. Del Charro 450 Norte, Ciudad Juarez, Chihuahua 32315, Mexico;Department of Industrial and Manufacturing Engineering, Autonomous University of Ciudad Juarez, Ave. Del Charro 450 Norte, Ciudad Juarez, Chihuahua 32315, Mexico;Department of Industrial and Manufacturing Engineering, Autonomous University of Ciudad Juarez, Ave. Del Charro 450 Norte, Ciudad Juarez, Chihuahua 32315, Mexico
Venue:
Expert Systems with Applications: An International Journal
Year:
2013

Citing 11
Cited 1

Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem

Annals of Operations Research - Special issue on Tabu search
A tabu search heuristic for the vehicle routing problem

Management Science
A genetic algorithm for the vehicle routing problem

Computers and Operations Research
Multi-Objective Genetic Algorithms for Vehicle Routing Problem with Time Windows

Applied Intelligence
A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery

Computers and Operations Research
Particle Swarm Optimization in Solving Vehicle Routing Problem

ICICTA '09 Proceedings of the 2009 Second International Conference on Intelligent Computation Technology and Automation - Volume 01
A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service

Computers and Operations Research
A hybrid genetic algorithm for the capacitated vehicle routing problem

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Artificial bee colony algorithm for the capacitated vehicle routing problem

ECC'11 Proceedings of the 5th European conference on European computing conference
Honey bees mating optimization algorithm for the Euclidean traveling salesman problem

Information Sciences: an International Journal
An improved ant colony optimization and its application to vehicle routing problem with time windows

Neurocomputing

A case study of innovative population-based algorithms in 3D modeling: Artificial bee colony, biogeography-based optimization, harmony search

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	12.05

Visualization

Abstract

To survive in today's competitive global market, companies must perform strategic changes in order to increase productivity, eliminating wasted materials, time, and effort. This study will examine how to optimize the time and effort required to supply raw material to different production lines in a manufacturing plant in Juarez, Mexico by minimizing the distance an operator must travel to distribute material from a warehouse to a set of different production lines with corresponding demand. The core focus of this study is similar to that of the Vehicle Routing Problem in that it is treated as a combinatorial optimization problem. The artificial bee colony algorithm is applied in order to find the optimal distribution of material with the aim of establishing a standard time for this duty by examining how this is applied in a local manufacturing plant. Results show that using this approach may be convenient to set standard times in the selected company.