禁忌搜索
车辆路径问题
调度(生产过程)
计算机科学
布线(电子设计自动化)
启发式
运筹学
工程类
计算机网络
算法
运营管理
人工智能
作者
Michel Gendreau,François Guertin,Jean‐Yves Potvin,Éric D. Taillard
出处
期刊:Transportation Science
[Institute for Operations Research and the Management Sciences]
日期:1999-11-01
卷期号:33 (4): 381-390
被引量:439
标识
DOI:10.1287/trsc.33.4.381
摘要
An abundant literature about vehicle routing and scheduling problems is available in the scientific community. However, a large fraction of this work deals with static problems where all data are known before the routes are constructed. Recent technological advances now create environments where decisions are taken quickly, using new or updated information about the current routing situation. This paper describes such a dynamic problem, motivated from courier service applications, where customer requests with soft time windows must be dispatched in real time to a fleet of vehicles in movement. A tabu search heuristic, initially designed for the static version of the problem, has been adapted to the dynamic case and implemented on a parallel platform to increase the computational effort. Numerical results are reported using different request arrival rates, and comparisons are established with other heuristic methods.
科研通智能强力驱动
Strongly Powered by AbleSci AI