• 대한산업공학회지
• /
• 제23권2호
• /
• pp.275-288
• /
• 1997

The container transportation problem is a kind of generalized pickup and delivery problem(GPDP), and a typical NP-hard problem of which polynomial algorithm has not yet been developed. In this problem, trucks have to transport containers from origins to destinations, while have to satisfy several restrictions such as request time, cargo closing time, driver's break time. In this paper, we present a straightforward heuristic and a user-interactive truck dispatching system which supports decision makers.