J. Psarras et al., COMBINATION OF LOCAL SEARCH AND CLP IN THE VEHICLE-FLEET SCHEDULING PROBLEM, European journal of operational research, 98(3), 1997, pp. 512-521
Citations number
22
Categorie Soggetti
Management,"Operatione Research & Management Science","Operatione Research & Management Science
Vehicle-fleet scheduling is one of the most commonly occurring problem
s of transport management. In this paper a new approach facing the pro
blem is introduced. It draws upon the combination of the advantages of
Constraint Logic Programming (CLP) with the benefits of local search
in order to obtain satisfactory results with respect to execution time
. CLP is used for generating an initial feasible solution and then for
checking every intermediate solution obtained from local search so th
at it is in accordance with the constraints of the problem. Local sear
ch is implemented for the minimisation of the cost of the initial solu
tion. Several local search methods were tested on various cases of the
problem and the results obtained are discussed and compared with resp
ect to the cost of the solution and the execution time. (C) 1997 Elsev
ier Science B.V.