Towards a Decision Support System for Optimizing the Location of Warehouses in a Supply Chain by Using the Bee Colony Algorithm

Towards a Decision Support System for Optimizing the Location of Warehouses in a Supply Chain by Using the Bee Colony Algorithm

Naima Belayachi, Khadidja Yachba, Karim Bouamrane
Copyright: © 2022 |Pages: 16
DOI: 10.4018/IJOCI.304882
OnDemand:
(Individual Articles)
Available
$37.50
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

One of the goals that a company sets is the customer's satisfaction, which is a priority item. This clearly shows that the concerns of companies are focused on the customer and how this later could be served quickly. This work addresses the problem of optimization of the location of the distribution centers of a final product to customers, in a given region. The problem addressed in this paper is the location of the position (emplacement) to build a new distribution center (warehouses), taking into account the constraint of the distance between a distribution center and the various points of sale, and the constraint of the cost of land to build a distribution center. The optimization method used for this problem is the artificial bee colony algorithm (ABC), which was initially applied to numerical function optimization problems, inspired from the behavioral model bees during foraging.
Article Preview
Top

Introduction

In an unstable economic context, under the pressure of globalization and growing competition, many companies are seeing the limits of optimizing their distribution networks, and looking for new sources of competitiveness through optimizing their logistics networks and their relationships with their partners.

Every company in a local or international market is concerned with offering a product or service that is desired by the customer, relatively quickly, reasonably priced, and more efficient than that offered by the competition. In the near future, competition will not be between different companies, but between different supply chain networks.

Several activities are performed for the production of goods, such as raw materials procurement, production, distribution, and sales. Businesses rely on Decision Support Systems (DSSs) to manage these tasks.

Managing a business is primarily about exercising or delegating decision-making or management power. A decision is taken voluntarily by one or more decision-makers, leading to a choice between several possible solutions. This is crucial for the development of the company. Therefore, millions of decisions are made each day in companies at all levels and across all departments.

There is a large amount of scientific literature on supply chain coordination. This paper focuses on optimizing a distribution network, which consists of three levels: factories at the first level, distribution centers at the second level, and customers (points of sale) at the third level.

The problem addressed by this work is to determine a location at minimum cost for the corporate distribution center (warehouse) by minimizing the distances between distribution centers (warehouses) and customers (points of sale) and also minimizing the cost of grounds. It consists of finding the best location to build a new warehouse (site) among a set of candidate sites (possible location).

The objective of this process is to identify the best location for building a new warehouse (site) from a list of possible locations (candidates sites).

One of the most important tasks in the supply chain is designing distribution systems. The problem of locating distribution centers is always one of the biggest problems in the distribution process. Nowadays, distribution centers are essential to the distribution process.

The authors of this paper suggested a method to solve the localization problem using an optimization algorithm based on an artificial bee colony (Artificial Bee Colony algorithm) to build a new warehouse at a lower cost and well situated for clients (points of sale) for a more coordinated distribution network.

The artificial bee colony algorithm is a metaheuristic optimization method. Its principle is based on the behavior of the real bees in their life.

The ABC (Artificial Bee Colony) algorithm was developed by (Karaboga, 2005; Karaboga & Basturk, 2007), by observing the behavior of real bees to find food sources, which they refer to as nectar, and to share that information with the other bees in the nest through a dance behavior (Von Frisch, 1967).

The artificial bee colony algorithm have been developed for solving difficult optimization problem. Since it's invention, the ABC algorithm has been used to solve both numerical and no numerical optimization problems. The previous studies (Aghdam et al., 2009; Perez & Behdinan, 2007; Kao & Zahara, 2008; Zhang et al., 2009) have shown that algorithms based on swarm intelligent have a great potential and have attracted the attention of much researchers . in effect, the performance of ABC algorithm has been compared with some other intelligent algorithms, such as the Genetic Algorithm, and the Differential Evolution algorithm, and the results show that ABC algorithm is better than the other methods or at least comparable to them.

The working principle of the ABC algorithm adapted according to the problematic treated in this study is described later in the following sections.

The rest of the paper is organized as follows:

Section two presents a review of the previous literature on related work. Section three describes the issue addressed in this work, followed by the presentation of the contribution in section four. Results are presented in section five, followed by a comparative study in section six. Finally, the paper ends with a conclusion and some perspectives in the seven section.

Complete Article List

Search this Journal:
Reset
Volume 14: 1 Issue (2024): Forthcoming, Available for Pre-Order
Volume 13: 1 Issue (2023)
Volume 12: 4 Issues (2022)
Volume 11: 4 Issues (2021)
Volume 10: 4 Issues (2020)
Volume 9: 4 Issues (2019)
Volume 8: 4 Issues (2018)
Volume 7: 4 Issues (2017)
Volume 6: 4 Issues (2016)
Volume 5: 4 Issues (2015)
Volume 4: 4 Issues (2014)
Volume 3: 4 Issues (2012)
Volume 2: 4 Issues (2011)
Volume 1: 4 Issues (2010)
View Complete Journal Contents Listing