| Summary: | 碩士 === 逢甲大學 === 工業工程研究所 === 86 === In this Thesis, issues of vehicle routing and scheduling
problem in a distribution center are addressed using
optimization techniques. Due to the change of markets in terms
of production, distribution, and marketing, a large number of
distribution centers and the associated conveniences stores are
established in the recent years. The distribution services of
commodities provided from a distribution center to convenience
stores are the most important issues, since these services have
great impacts on the performance of a distribution center and on
the customer service level. Hence, vehicle routing and
scheduling problem are applied to improve the distribution
service of goods. In this study, four alternative
approaches are presented for the vehicle routing and scheduling
problem. These approached are the savings method, the location-
based method with heuristic for routing, the location-based
method with the traveling salesman model for routing, and the
optimization model simultaneously considering routing and
clustering. A real-world data collected from a local
distribution center are used to compare the performance of these
approaches. Results indicate that the presented four alternative
approached perform better than the current vehicle routing and
scheduling system in terms of the total traveling distance and
the balance of workloads. However, the CPU time needed to solve
the real-world problem has to be shortened in order that the
developedmodel can be used in the daily-based decision making
process.
|
|---|
