Logistics I

TA19.1 Mew Measure of Freight Statistics: Distribution Levels

• Kyungwoo Kang; Hanyang University, 1271 Sa-1-Dong, Ansan, Kyunggi-Do, 425-791 , South Korea; kyungwoo@email.hanyang.ac.kr

Generally, the tons lifted and ton-kilometers are widely used to analyze the road freight transport. However, these two indicators are simply to show the road freight transport statistics rather than to explain the road freight transportation systems. The variables such as the number of distribution channel levels, the integral distance, tons in transport and the average transport distance are defined...

TA19.2 The Dynamic Load Planning Problem of Time-Definite Freight Delivery Common Carriers

• Cheng-Chang Lin; National Cheng Kung University, Aeronautical/Astro. Eng., 1 University Rd., Tainan, 701 , Taiwan; cclin@mail.ncku.edu.tw
• Yiing-Yuh Lin; National Cheng Kung University, Aeronautical/Astro. Eng., 1 University Rd., Tainan, 701 , Taiwan; yinlin@mail.ncku.edu.tw

The dynamic load planning problem of time-definite freight delivery industry is to determine when and how small shipments should be consolidated to minimize the sum of fleet fixed and operating costs while satisfying the level of service and operational restrictions. A dual method and computational results will also be presented.

TA19.3 A New Highest-Ascent-Mildest-Descent Approach using an Intelligent Reduced Neighborhood to Solve the Quadratic Assignment Problem

• Stefan Bock; University of Paderborn, Production Mgmt. Dept., Warburger Str. 100, Paderborn NRW, 33098 , Germany; stbo@uni-paderborn.de,, http://econweb.uni-paderborn.de/prowi
• Kai Hoberg; University of Paderborn, Production Mgmt. Dept., Warburger Str. 100, Paderborn NRW, 33098 , Germany; hoberg@prowinet.uni-paderborn.de
• Otto Rosenberg; University of Paderborn, Production Mgmt. Dept., Warburger Str. 100, Paderborn NRW, 33098 , Germany; rosenberg@uni-paderborn.de

A new highest-ascent-mildest-descent-procedure for solving very complex instances (with up to 200 machines) of the well-known QAP is described and compared with known efficient heuristics. Thus, the superiority of the new algorithm concerning the solution quality can be stated.

TA19.4 An AGV Routing Procedure based on a Stochastic Time Model

• Jungdae Suh; Kyungwon University, San 65, Pokjung-dong, Sujung-gu, Sungnam, Kyunggi, 461-701 , Korea; jdsuh@mail.kungwon.ac.kr,, http://ie.kyungwon.ac.kr
• Jaejin Jang; Hankuk University of Foreign Studies, San 89, Wangsan, Mohyun, Yongin, Kyunggi, 449-791 , Korea; jjj@san.hufs.ac.kr
• Pyung-Hoi Koo; Pukyong National University, Yongdang, Nam-gu, Pusan, 608-737 , Korea; phkoo@pine.pknu.ac.kr

We present a procedure for AGV and part routing using information on the current and future status of a clean bay for semiconductor and LCD production. The procedure determines the AGV and part routing using blocking and starving times of the source and destination machines. These times are obtained by using the available current and future status information of the systems...