Genetic algorithm for vehicle scheduling problem of non-full loads with time windows

Genetic algorithm for vehicle scheduling problem of non-full loads with time windows

0.00 Avg rating0 Votes
Article ID: iaor2002747
Country: China
Volume: 15
Issue: 3
Start Page Number: 290
End Page Number: 294
Publication Date: Jun 2000
Journal: Journal of Systems Engineering and Electronics
Authors: , ,
Keywords: genetic algorithms
Abstract:

Because the vehicle scheduling problem of non-full loads with time windows is a typical NP-hard problem, traditional algorithms are not satisfactory. In this paper, while the restraints of capacity and time windows are changed into objective restraints, a genetic algorithm on decimal coding is designed, which can deal with soft and hard time windows. Excellent solutions are obtained in the applications.

Reviews

Required fields are marked *. Your email address will not be published.