Solving the pickup and delivery problem in semiconductor supply chain

Taiwan´s semiconductor supply chain has been constructed comprehensive and the performance of this industry is very significant. With the comprehensive supply chain, transportation and distribution activities emerge as one of the central issues owing to their complexity and costs. Since the pickup and delivery problem in semiconductor supply chain (PDP-SSC) involves constraints on pickup and delivery, product/vehicle compatibility, multiple-priority, and vehicle capacity constraints, it is more difficult to solve than the classical pickup and delivery problem. In this study, we consider the PDP-SSC and formulate the PDP-SSC as an integer programming program to minimize total traverse time. An example is used to illustrate the performance of the proposed formulation.