An adaptive genetic algorithm for the time dependent inventory routing problem

In this paper we propose an adaptive genetic algorithm that produces good quality solutions to the time dependent inventory routing problem (TDIRP) in which inventory control and time dependent vehicle routing decisions for a set of retailers are made simultaneously over a specific planning horizon....

Full description

Saved in:
Bibliographic Details
Published in:Journal of intelligent manufacturing Vol. 25; no. 5; pp. 1025 - 1042
Main Authors: Cho, Dong Won, Lee, Young Hae, Lee, Tae Youn, Gen, Mitsuo
Format: Journal Article
Language:English
Published: Boston Springer US 01.10.2014
Springer Nature B.V
Subjects:
ISSN:0956-5515, 1572-8145
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper we propose an adaptive genetic algorithm that produces good quality solutions to the time dependent inventory routing problem (TDIRP) in which inventory control and time dependent vehicle routing decisions for a set of retailers are made simultaneously over a specific planning horizon. This work is motivated by the effect of dynamic traffic conditions in an urban context and the resulting inventory and transportation costs. We provide a mixed integer programming formulation for TDIRP. Since finding the optimal solutions for TDIRP is a NP-hard problem, an adaptive genetic algorithm is applied. We develop new genetic representation and design suitable crossover and mutation operators for the improvement phase. We use adaptive genetic operator proposed by Yun and Gen (Fuzzy Optim Decis Mak 2(2):161–175, 2003 ) for the automatic setting of the genetic parameter values. The comparison of results shows the significance of the designed AGA and demonstrates the capability of reaching solutions within 0.5 % of the optimum on sets of test problems.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0956-5515
1572-8145
DOI:10.1007/s10845-012-0727-5