دورية أكاديمية

A metaheuristic for the vehicle-routeing problem with soft time windows.

التفاصيل البيبلوغرافية
العنوان: A metaheuristic for the vehicle-routeing problem with soft time windows.
المؤلفون: Chiang, W.-C.1 wen-chiang@utulsa.edu, Russell, R. A.1
المصدر: Journal of the Operational Research Society. Dec2004, Vol. 55 Issue 12, p1298-1310. 13p.
مصطلحات موضوعية: *PRODUCTION scheduling, *HEURISTIC, *OPERATIONS research, *MATHEMATICAL programming, *CUSTOMER services, VEHICLES
مستخلص: This paper develops a metaheuristic for the vehicle-routeing and scheduling problem with soft time window constraints. A tabu search solution method is developed, which utilizes a mixed neighbourhood structure and an advanced recovery procedure to generate high-quality solutions. Computational results on test problems from the literature are reported. The metaheuristic achieves solutions that compare favourably with previously reported results [ABSTRACT FROM AUTHOR]
Copyright of Journal of the Operational Research Society is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
قاعدة البيانات: Business Source Index
الوصف
تدمد:01605682
DOI:10.1057/palgrave.jors.2601791