HEURISTIC APPROACH TO ALLOCATION OF TRUCKS IN A TRANSPORTATION SYSTEM

This paper considers the problem of how luggages should be assign to e ach truck for the transportation system consists of a depot, a fixed a rea and two types of luggages, called schedule problem. The main purpo se of this paper is to propose a procedure for the problem subject to keep the balance of work loads among truck drivers. The procedure is b ased on 3 (heuristic) rules for replacing the addresses of each luggag e with the 'conventional address,' converting size of each luggage int o 'weight' and introducing a measure to keep the balance of work loads . The procedure consists of three stages according to 'priority' of th e types of luggages. A case study is presented that demonstrate the pr actical usefulness of the procedure.