Combination of local search and CLP in the vehicle-fleet scheduling problem

 
see the original item page
in the repository's web site and access all digital files if the item*
share




1997 (EN)
Combination of local search and CLP in the vehicle-fleet scheduling problem (EN)

Psarras, J (EN)
Christodoulou, N (EN)
Stefanitsis, E (EN)

N/A (EN)

Vehicle-fleet scheduling is one of the most commonly occurring problems of transport management. In this paper a new approach facing the problem 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 that it is in accordance with the constraints of the problem. Local search is implemented for the minimisation of the cost of the initial solution. Several local search methods were tested on various cases of the problem and the results obtained are discussed and compared with respect to the cost of the solution and the execution time. (C) 1997 Elsevier Science B.V. (EN)

journalArticle

Local search (EN)
Operations research (EN)
Transport management (EN)
Transportation routes (EN)
Constraint logic programming (EN)
Scheduling (EN)
Vehicle-fleet scheduling (EN)
Computational complexity (EN)
Mathematical programming (EN)
Vehicle scheduling problem (VSP) (EN)

Εθνικό Μετσόβιο Πολυτεχνείο (EL)
National Technical University of Athens (EN)

European Journal of Operational Research (EN)

1997


ELSEVIER SCIENCE BV (EN)



*Institutions are responsible for keeping their URLs functional (digital file, item page in repository site)