A Discrete Particle Swarm Optimization Algorithm for the Vehicle Routing Problem with Cross-Docking

• Main Author: Firdaus Fanny Putera Perdana
• Other Authors: Vincent F. Yu
• Format: Others
• Language: en_US
• Published: 2013
• Online Access: http://ndltd.ncl.edu.tw/handle/41352055271286302823

碩士 === 國立臺灣科技大學 === 工業管理系 === 101 === Cross-docking is a method that gives companies opportunities to improve their service level to their customers without high monetary investment or major changes in the infrastructure. One of the popular employments of cross-docking is in perishable product companies because maintaining product quality and on time delivery is highly important for these companies. In order to successfully employ this method, it is critical for the companies to invest time and effort in process improvement. The objective is to minimize the total transportation cost without violating vehicle capacity constraints. We propose a mathematical model and develop a discrete particle swarm optimization algorithm for the problem. Computational results indicate that the proposed solution method can effectively solve the problem.