<link rel="stylesheet" href="styles.cf390c6bfbe7555f.css">

學術出版;;Publications

Permanent URI for this communityhdl:11536/1

收集所有交通大學研究人員與學生個人或團體所發表之各項學術著作，涵蓋期刊論文、教師專書、學位論文等項。;;Collections of Publications of NCTU Researchers and Students Like Journal Papers and Thesis.

Browse

Filters

19992

Settings

🏛️國立陽明交通大學機構典藏

Author: search.filters.author.Shen, SYSubject: search.filters.subject.heuristics

Search Results

Now showing 1 - 2 of 2
  • Thumbnail Image
    Item type:Item,
    The fleet size and mix vehicle routing problem with time windows
    (1999-07-01)
    Liu, FH
    ;
    Shen, SY
    ;
    工業工程與管理學系
    ;
    Department of Industrial Engineering and Management
    This paper describes several insertion-based savings heuristics for the fleet size and mix vehicle routing problem with time window constraints. A certain number of candidate fleet compositions are recorded in the construction phase, followed by applying a composite improvement scheme on them to enhance the solution quality. Computational results on 168 sample problems are reported. We found that heuristics with the consideration of a sequential route construction parameter yielded very good results. In addition, results on the 20 benchmarking problems for the fleet and mix vehicle routing problem with no time window constraints also demonstrate the effectiveness of our heuristics.
  • Thumbnail Image
    Item type:Item,
    An overview of a heuristic for vehicle routing problem with time windows
    (1999-10-01)
    Liu, FHF
    ;
    Shen, SY
    ;
    工業工程與管理學系
    ;
    Department of Industrial Engineering and Management
    In this paper, a two-stage metaheuristic based on a new neighborhood structure is proposed to solve the vehicle routing problem with time windows. Our neighborhood construction focuses on the relationship between route(s) and node(s). Unlike the conventional methods for parallel route construction, we construct routes in a nested parallel manner to obtain higher solution quality. Computational results for 60 benchmark problems are reported. The results indicate that our approach is highly competitive with all existing heuristics, in particular very promising for solving problems with large size. (C) 1999 Elsevier Science Ltd. All rights reserved.