Cover Image

Artificial bee colony for inventory routing problem with backordering

This paper addresses the inventory routing problem with backordering (IRPB) with a one-tomany distribution network, consisting of a single depot and multiple customers for a specified planning horizon. A fleet of homogeneous vehicles delivers a single product to fulfill the customers demand over th...

Full description

Saved in:
Bibliographic Details
Main Authors: Moin, N.H., Halim, H.Z.A.
Format: Conference or Workshop Item
Language:English
Published: 2014
Subjects:
QA Mathematics
Online Access:http://eprints.um.edu.my/11399/1/0001.pdf
http://eprints.um.edu.my/11399/
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.um.eprints.11399
record_format eprints
spelling my.um.eprints.113992014-12-18T04:04:15Z http://eprints.um.edu.my/11399/ Artificial bee colony for inventory routing problem with backordering Moin, N.H. Halim, H.Z.A. QA Mathematics This paper addresses the inventory routing problem with backordering (IRPB) with a one-tomany distribution network, consisting of a single depot and multiple customers for a specified planning horizon. A fleet of homogeneous vehicles delivers a single product to fulfill the customers demand over the planning horizon. We assume that the depot has sufficient supply of items that can cover all the customers' demands for all periods. The backorder situation considered here is when the backorder decision either unavoidable (insufficient vehicle capacity) or more economical (savings in the coordinated transportation cost are higher than the backorder cost). The objective of IRPBis to minimize the overall cost such that transportation cost, inventory cost and backorder cost is optimal. We propose a metaheuristic method, Artificial Bee Colony (ABC) to solve the IRPB.The ABCalgorithm is a swarm based heuristics which simulates the intelligent foraging behaviour of a honey bee swarm and sharing that information of the food sources with the bees in the nest. The bees are classified into three agents: the employed bee which carries the information about the food source, the onlooker bee watching the dance of the employed bees within the hive and making the decision to choose a food source based on the dances, and the scout bee, performing random search for the food sources. We modify the standard ABC algorithm by incorporating the inventory and backorder information and, a new inventory updating mechanism incorporating the forward and backward transfers. The modification also being made in the selection mechanism by the onlooker bees based on the waggle dance performed by the employed bees. We run the algorithm on a set of benchmark problems and the results are very encouraging. 2014-08 Conference or Workshop Item PeerReviewed application/pdf en http://eprints.um.edu.my/11399/1/0001.pdf Moin, N.H. and Halim, H.Z.A. (2014) Artificial bee colony for inventory routing problem with backordering. In: International Conference on Inventories, 18-22 Aug 2014, Budapest, Hungary. (Submitted)
institution Universiti Malaya
building UM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Malaya
content_source UM Research Repository
url_provider http://eprints.um.edu.my/
language English
topic QA Mathematics
spellingShingle QA Mathematics
Moin, N.H.
Halim, H.Z.A.
Artificial bee colony for inventory routing problem with backordering
description This paper addresses the inventory routing problem with backordering (IRPB) with a one-tomany distribution network, consisting of a single depot and multiple customers for a specified planning horizon. A fleet of homogeneous vehicles delivers a single product to fulfill the customers demand over the planning horizon. We assume that the depot has sufficient supply of items that can cover all the customers' demands for all periods. The backorder situation considered here is when the backorder decision either unavoidable (insufficient vehicle capacity) or more economical (savings in the coordinated transportation cost are higher than the backorder cost). The objective of IRPBis to minimize the overall cost such that transportation cost, inventory cost and backorder cost is optimal. We propose a metaheuristic method, Artificial Bee Colony (ABC) to solve the IRPB.The ABCalgorithm is a swarm based heuristics which simulates the intelligent foraging behaviour of a honey bee swarm and sharing that information of the food sources with the bees in the nest. The bees are classified into three agents: the employed bee which carries the information about the food source, the onlooker bee watching the dance of the employed bees within the hive and making the decision to choose a food source based on the dances, and the scout bee, performing random search for the food sources. We modify the standard ABC algorithm by incorporating the inventory and backorder information and, a new inventory updating mechanism incorporating the forward and backward transfers. The modification also being made in the selection mechanism by the onlooker bees based on the waggle dance performed by the employed bees. We run the algorithm on a set of benchmark problems and the results are very encouraging.
format Conference or Workshop Item
author Moin, N.H.
Halim, H.Z.A.
author_facet Moin, N.H.
Halim, H.Z.A.
author_sort Moin, N.H.
title Artificial bee colony for inventory routing problem with backordering
title_short Artificial bee colony for inventory routing problem with backordering
title_full Artificial bee colony for inventory routing problem with backordering
title_fullStr Artificial bee colony for inventory routing problem with backordering
title_full_unstemmed Artificial bee colony for inventory routing problem with backordering
title_sort artificial bee colony for inventory routing problem with backordering
publishDate 2014
url http://eprints.um.edu.my/11399/1/0001.pdf
http://eprints.um.edu.my/11399/
_version_ 1643689048331517952
score 13.211869

Similar Items