Premium
Solution method for multi‐product two‐stage logistics network with constraints on delivery route
Author(s) -
Ataka Shinichiro,
Gen Mitsuo
Publication year - 2009
Publication title -
electronics and communications in japan
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.131
H-Index - 13
eISSN - 1942-9541
pISSN - 1942-9533
DOI - 10.1002/ecj.10102
Subject(s) - supply chain , genetic algorithm , product (mathematics) , computer science , factory (object oriented programming) , supply chain network , supply chain management , promotion (chess) , operations research , delivery performance , reverse logistics , network planning and design , mathematical optimization , industrial engineering , engineering , business , computer network , mathematics , marketing , geometry , machine learning , politics , political science , law , programming language
The logistics network design is one of the important phases of Supply Chain Management (SCM) and it is a problem that should be optimized for long‐term promotion of efficiency of the whole supply chain. Usually a plant produces different types of products. Even if it is a factory of the same company, delivery differs according to the kind of produced product. The restrictions which this model has are deeply concerned with TP in the real world. In this paper, we consider the logistics network design problems with multiple products and constraints for delivery course. To solve the problem, we used a hybrid priority‐based genetic algorithm (h‐priGA), and we tried comparison experiments with priority‐based genetic algorithm (priGA) and h‐priGA, and show the effectiveness of h‐priGA. © 2009 Wiley Periodicals, Inc. Electron Comm Jpn, 92(8): 18–24, 2009; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/ecj.10102