Improving cross-docking operations for consumer goods sector using metaheuristics
Rodrigo Andrés Gómez- Montoya, Jose Alejandro Cano, Emiro Antonio Campo, Fernando Salazar
Abstract
This paper aims to model a consumer goods cross-docking problem, which is solved using metaheuristics to minimize makespan and determine the capacity in terms of inbound and outbound docks. The consumer-goods cross-docking problem is represented through inbound and outbound docks, customer orders (products to be delivered to customers), and metaheuristics as a solution method. Simulated annealing (SA) and particle swarm optimization (PSO) are implemented to solve the cross-docking problem. Based on the results of statistical analysis, it was identified that the two-way interaction effect between inbound and outbound docks, outbound docks and items, and items and metaheuristics are the most statistically significant on the response variable. The best solution provides the minimum makespan of 973.42 minutes considering nine inbound docks and twelve outbound docks. However, this study detected that the combination of six inbound docks and nine outbound docks represents the most efficient solution for a cross-docking design since it reduces the requirement of docks by 28.6% and increases the makespan by only 4.2% when compared to the best solution, representing a favorable trade-off for the cross-docking platform design.
Keywords
Consumer goods sector; Cross-docking; Distribution center; Particle swarm optimization; Simulated annealing
DOI:
https://doi.org/10.11591/eei.v10i1.2710
Refbacks
There are currently no refbacks.
<div class="statcounter"><a title="hit counter" href="http://statcounter.com/free-hit-counter/" target="_blank"><img class="statcounter" src="http://c.statcounter.com/10241695/0/5a758c6a/0/" alt="hit counter"></a></div>
Bulletin of EEI Stats
Bulletin of Electrical Engineering and Informatics (BEEI) ISSN: 2089-3191, e-ISSN: 2302-9285 This journal is published by the Institute of Advanced Engineering and Science (IAES) in collaboration with Intelektual Pustaka Media Utama (IPMU) .