DELIVERY MANAGEMENT SYSTEM USING THE CLUSTERING BASED MULTIPLE ANT COLONY ALGORITHM: KOREAN HOME APPLIANCE DELIVERY
- Authors
- Kim, Taeho; Lee, Hongchul
- Issue Date
- 2014
- Publisher
- UNIV CINCINNATI INDUSTRIAL ENGINEERING
- Keywords
- HFVRPTW; Ant colony algorithm; Home appliance delivery; Android; Information System
- Citation
- INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE, v.21, no.2, pp.1 - 13
- Indexed
- SCIE
SCOPUS
- Journal Title
- INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE
- Volume
- 21
- Number
- 2
- Start Page
- 1
- End Page
- 13
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/101113
- ISSN
- 1072-4761
- Abstract
- This paper deals with the heterogeneous fleet vehicle routing and scheduling problems with time windows (HFVRPTW) in the area of Korean home appliance delivery. The suppliers of modern home appliance products in Korea not only have to provide the traditional service of simply delivering goods to customers within the promised time, but they also need to perform additional services such as installation of the product and explanation of the products functions. Therefore, businesses reducing the delivery cost while improving the quality of the service experienced by customers is an important issue. In order to meet these two demands, we generated a delivery schedule by using a heuristic clustering-based multiple ant colony system (MACS) algorithm. In addition, to improve service quality, we set up an expert system composed of a manager system and an android-based driver system. The system was tested for home appliance delivery in Korea. This paper is significant in that it constructs an expert system for the entire process of distribution, from the generation of an actual schedule to management system setup.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Engineering > School of Industrial and Management Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.