Heuristic approach to allocation of trucks in a transportation system

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...

Full description

Saved in:
Bibliographic Details
Published inComputers & Industrial Engineering Vol. 27; no. 1; pp. 253 - 255
Main Authors Takeno, Takeo, Matsui, Kenichiro, Yamazaki, Genji, Ishikawa, Toshihiro
Format Journal Article Conference Proceeding
LanguageEnglish
Published Seoul Elsevier Ltd 01.09.1994
Oxford Elsevier BV
New York, NY Pergamon Press
Pergamon Press Inc
Subjects
Online AccessGet full text
ISSN0360-8352
1879-0550
DOI10.1016/0360-8352(94)90283-6

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:0360-8352
1879-0550
DOI:10.1016/0360-8352(94)90283-6