Heuristic approach to allocation of trucks in a transportation system

  • Takeno T
  • Matsui K
  • Yamazaki G
 et al. 
  • 2


    Mendeley users who have this article in their library.
  • 0


    Citations of this article.


This paper considers the problem of how luggages should be assign to each truck for the transportation system consists of a depot, a fixed area and two types of luggages, called schedule problem. The main purpose 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 based on 3 (heuristic) rules for replacing the addresses of each luggage with the 'conventional address,' converting size of each luggage into 'weight' and introducing a measure to keep the balance of work loads. The procedure consists of three stages according to 'priority' of the types of luggages. A case study is presented that demonstrate the practical usefulness of the procedure. © 1994.

Author-supplied keywords

  • scheduling
  • time windows
  • transportation system
  • vehicle routing

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Takeo Takeno

  • Kenichiro Matsui

  • Genji Yamazaki

  • Toshihiro Ishikawa

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free