A HIERARCHICAL APPROACH TO VEHICLE ROUTING AND SCHEDULING WITH SEQUENTIAL SERVICES USING THE GENETIC ALGORITHM

被引：0
作者：
Kim, K. C. [1 ]
Sun, J. U. [2 ]
Lee, S. W. [3 ]
机构：
[1] Oregon State Univ, Sch Mech Ind & Mfg Engn, Corvallis, OR 97331 USA
[2] Hankuk Univ Foreign Studies, Sch Ind & Management Engn, Seoul, South Korea
[3] Pusan Natl Univ, Dept Ind Engn, Pusan, South Korea
来源：
INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE | 2013年 / 20卷 / 1-2期
关键词：
Vehicle Routing Problem; Delivery and Installation; Synchronization of Vehicles; Genetic Algorithm; Electronics Industry; HAZARDOUS MATERIALS; OPTIMIZATION;
D O I：
暂无
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
To survive in today's competitive market, material handling activities need to be planned carefully to satisfy business' and customers' demand. The vehicle routing and scheduling problems have been studied extensively for various industries with special needs. In this paper, a vehicle routing problem considering unique characteristics of the electronics industry is considered. A mixed-integer nonlinear programming (MINP) model has been presented to minimize the traveling time of delivery and installation vehicles. A hierarchical approach using the genetic algorithm has been proposed and implemented to solve problems of various sizes. The computational results show the effectiveness and the efficiency of the proposed hierarchical approach. A performance comparison between the MINP approach and the hierarchical approach is also presented.
引用
收藏
页码：99 / 113
页数：15
相关论文
共 30 条
  • [1] BODIN L, 1983, COMPUT OPER RES, V10, P63, DOI 10.1016/0305-0548(83)90030-8
  • [2] Vehicle routing problem with time windows, part 1:: Route construction and local search algorithms
    Bräysy, I
    Gendreau, M
    [J]. TRANSPORTATION SCIENCE, 2005, 39 (01) : 104 - 118
  • [3] Heuristic procedures for the capacitated vehicle routing problem
    Campos, V
    Mota, E
    [J]. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2000, 16 (03) : 265 - 277
  • [4] Optimization of grid bus transit systems with elastic demand
    Chien, SIJ
    Spasovic, LN
    [J]. JOURNAL OF ADVANCED TRANSPORTATION, 2002, 36 (01) : 63 - 91
  • [5] Constraint handling in genetic algorithms: The set partitioning problem
    Chu, PC
    Beasley, JE
    [J]. JOURNAL OF HEURISTICS, 1998, 4 (04) : 323 - 357
  • [6] An application of Special Ordered Sets to a periodic milk collection problem
    Claassen, G. D. H.
    Hendriks, Th. H. B.
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 180 (02) : 754 - 769
  • [7] Falkenauer E., 1996, Journal of Heuristics, V2, P5, DOI 10.1007/BF00226291
  • [8] A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems
    Freisleben, B
    Merz, P
    [J]. 1996 IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION (ICEC '96), PROCEEDINGS OF, 1996, : 616 - 621
  • [9] Gen M., 1999, GENETIC ALGORITHMS E, V7
  • [10] Golberg D. E., 1989, GENETIC ALGORITHMS S, V1989, P36
123