原文传递 ON-LINE VEHICLE ROUTING WITH TIME WINDOWS: OPTIMIZATION-BASED HEURISTICS APPROACH FOR FREIGHT DEMANDS REQUESTED IN REAL-TIME.
题名: ON-LINE VEHICLE ROUTING WITH TIME WINDOWS: OPTIMIZATION-BASED HEURISTICS APPROACH FOR FREIGHT DEMANDS REQUESTED IN REAL-TIME.
作者: Shieh-H-M; May-M-D
关键词: ROUTING-; ON-LINE-SYSTEMS; OPTIMIZATION-; HEURISTIC-METHODS; ALGORITHMS-; COMMERCIAL-VEHICLES
摘要: The problem of the on-line version of the vehicle routing problem with time windows (VRPTW) differs from the traditional off-line problem in the dynamical arrival of requests and the execution of the partial tour during the run time. The study develops an on-line optimization-based heuristic that combines the concepts of the "on-line algorithm," "anytime algorithm," and local search heuristics to solve the on-line version of VRPTW. The solution heuristic is evaluated with modified Solomon's problems. By comparing with these benchmark problems, the different results between on-line and off-line algorithms are indicated.
总页数: Transportation Research Record. 1998. (1617) pp171-178 (7 Fig., 2 Tab., 12 Ref.)
报告类型: 科技报告
检索历史
应用推荐