:::
Trans. Planning Journal
| Title | Auto-carrier Loading Problem |
|---|---|
| Author | Chih-Hung Lin & Chuen-Yih Chen |
| Summary | More than 400,000 new automobiles are sold in Taiwan every year. To distribute these new automobiles from manufacturing centers to dealers efficiently is an important issue managers need to deal with. Generally speaking, manufacturers can either distribute the new automobiles themselves, using tractors and trailers, or outsource the process to an outside company. For the former, managers might need to consider routing and loading, the two most common yet crucial factors. In practice, these two problems share a sequential relationship, the former being the pre-requisite of the latter. This paper focused on the loading factor for Auto-carriers, a problem known as Auto-carrier loading problem (ACLP). Attempts were made to minimize the total reloading costs. A nonlinear zero-one integer programming model which belongs to NP-hard is constructed, and is then solved using constraint programming (CP). Computational results indicated that CP could effectively solve ACLP. |
| Vol. | 31 |
| No. | 4 |
| Page | 765 |
| Year | 2002 |
| Month | 12 |
Count Views:420