Population based ant colony optimization for inventory routing problem
The inventory routing problem presented in this study is a one-to-many distribution network consisting of a manufacturer that produces multi products to be transported to many geographically dispersed customers. We consider a finite horizon where a fleet of capacitated homogeneous vehicles, housed a...
Saved in:
Main Authors: | , |
---|---|
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2014
|
Subjects: | |
Online Access: | http://eprints.um.edu.my/11400/1/cie44-imss14-full-paper-MOIN_ACO.pdf http://eprints.um.edu.my/11400/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Universiti Malaya |
Language: | English |
id |
my.um.eprints.11400 |
---|---|
record_format |
eprints |
spelling |
my.um.eprints.114002021-01-27T06:40:34Z http://eprints.um.edu.my/11400/ Population based ant colony optimization for inventory routing problem Moin, Noor Hasnah Wong, Lily QA Mathematics The inventory routing problem presented in this study is a one-to-many distribution network consisting of a manufacturer that produces multi products to be transported to many geographically dispersed customers. We consider a finite horizon where a fleet of capacitated homogeneous vehicles, housed at a depot/warehouse, transports products from the warehouse to meet the demand specified by the customers in each period. The demand for each product is deterministic and time varying and each customer request a distinct product. The inventory holding cost is product specific and is incurred at the customer sites. The objective is to determine the amount on inventory and to construct a delivery schedule that minimizes both the total transportation and inventory holding cost while ensuring each customer's demand is met over the planning horizon. The problem is formulated as a mixed integer programming problem and is solved using CPLEXto get the lower bound and upper bound (the best integer solution) for each instance considered. We proposed a population based ant colony optimization (ACO) where the ants are subdivided into subpopulations and each subpopulation represents one inventory level to construct the routes. In addition, we modify the standard ACO by including the inventory cost in the global pheromones updating and the selection of inventory updating mechanism is based on the pheromone value. ACO performs better on large instances 2014-10 Conference or Workshop Item PeerReviewed text en http://eprints.um.edu.my/11400/1/cie44-imss14-full-paper-MOIN_ACO.pdf Moin, Noor Hasnah and Wong, Lily (2014) Population based ant colony optimization for inventory routing problem. In: CIE44 & IMSS 2014 Proceedings, 14-16 October 2014, Istanbul, Turkey. (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, Noor Hasnah Wong, Lily Population based ant colony optimization for inventory routing problem |
description |
The inventory routing problem presented in this study is a one-to-many distribution network consisting of a manufacturer that produces multi products to be transported to many geographically dispersed customers. We consider a finite horizon where a fleet of capacitated homogeneous vehicles, housed at a depot/warehouse, transports products from the warehouse to meet the demand specified by the customers in each period. The demand for each product is deterministic and time varying and each customer request a distinct product. The inventory holding cost is product specific and is incurred at the customer sites. The objective is to determine the amount on inventory and to construct a delivery schedule that minimizes both the total transportation and inventory holding cost while ensuring each customer's demand is met over the planning horizon. The problem is formulated as a mixed integer programming problem and is solved using CPLEXto get the lower bound and upper
bound (the best integer solution) for each instance considered. We proposed a population based ant colony optimization (ACO) where the ants are subdivided into subpopulations and each subpopulation represents one inventory level to construct the routes. In addition, we
modify the standard ACO by including the inventory cost in the global pheromones updating and the selection of inventory updating mechanism is based on the pheromone value. ACO performs better on large instances |
format |
Conference or Workshop Item |
author |
Moin, Noor Hasnah Wong, Lily |
author_facet |
Moin, Noor Hasnah Wong, Lily |
author_sort |
Moin, Noor Hasnah |
title |
Population based ant colony optimization for inventory routing problem |
title_short |
Population based ant colony optimization for inventory routing problem |
title_full |
Population based ant colony optimization for inventory routing problem |
title_fullStr |
Population based ant colony optimization for inventory routing problem |
title_full_unstemmed |
Population based ant colony optimization for inventory routing problem |
title_sort |
population based ant colony optimization for inventory routing problem |
publishDate |
2014 |
url |
http://eprints.um.edu.my/11400/1/cie44-imss14-full-paper-MOIN_ACO.pdf http://eprints.um.edu.my/11400/ |
_version_ |
1691733412021272576 |