A Multi-plant, Multi-market, Multi-product, Multi-vehicle, Multi-period Transportation Problem For Price-reducing Products
Date Issued
2012
Date
2012
Author(s)
Shih, Wei-Ting
Abstract
This paper presents a practical transportation planning problem for a multi-plant, multi-market, multi-product, multi-vehicle, multi-period transportation problem for
price-reducing products. A mathematical model for the problem was rigorously defined and the goal to solve is to maximize the profit. Constraints on this problem include
transportation amount of each period of each product of each plant doesn’t exceed its number limit and product number conservation. This paper proposed a GA based solving system for real number and integer chromosome encoding methods, and each has its own crossover and mutation methods. Each encoding method has four types of selection methods, which deploys the final transportation plan. The transportation plan reveals the numbers of each period using different vehicle from all of the plant to transport each product to each market. A prototype system, GA-based 5MTP Solver
Planning System, implementing the proposed GA method was developed to test sample data. In this study, we set two extreme scenarios and three different market price
decline rate based on problem characteristics, total of six samples tested. And compared our results with artificial transport planning which is aimed at the most
profitable of the market demand and random solving method proposed in this study, in order to prove our method’s efficiency.
Subjects
price-reducing
transportation planning problem
Genetic Algorithm
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-101-R99546023-1.pdf
Size
23.54 KB
Format
Adobe PDF
Checksum
(MD5):3a3032eab28614051166e7c34188a301