Solving Fleet Size and Mix Vehicle Routing Problem with Stochastic Demands by Particle Swarm Optimization

• Main Authors: LIU, YU-CHE, 劉宇哲
• Other Authors: LOW, CHIN-YAO
• Format: Others
• Language: zh-TW
• Published: 2016
• Online Access: http://ndltd.ncl.edu.tw/handle/9t7v4s

碩士 === 國立雲林科技大學 === 工業工程與管理系 === 105 === The goals of this research are to develop a mathematical model and an effective solution technique for the Fleet Size and Mix Vehicle Routing Problem with Stochastic demands. This model is based on the published VRPSD and FSMVRP formulations. And using an advanced particle swarm optimization (PSO) to find an approximate optimal solutions. This research investigates a variant of an uncertain VRP in which the customers’ demands are supposed to be a discrete random variable, and when vehicle before sevices the costumers, the demands was unknown, and considers a fleet size with different capacities and variable costs of vehicles. We develop a mathematical model and using PSO to minimize the total cost. Finally, testing examples are generated from the existing benchmark instances of VRPSD and FSMVRP.