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

Psarras, J; Stefanitsis, E; Christodoulou, N

dc.contributor.author	Psarras, J	en
dc.contributor.author	Stefanitsis, E	en
dc.contributor.author	Christodoulou, N	en
dc.date.accessioned	2014-03-01T01:12:41Z
dc.date.available	2014-03-01T01:12:41Z
dc.date.issued	1997	en
dc.identifier.issn	0377-2217	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/12202
dc.subject	Constraint logic programming	en
dc.subject	Local search	en
dc.subject	Vehicle-fleet scheduling	en
dc.subject.classification	Management	en
dc.subject.classification	Operations Research & Management Science	en
dc.subject.other	Computational complexity	en
dc.subject.other	Mathematical programming	en
dc.subject.other	Operations research	en
dc.subject.other	Scheduling	en
dc.subject.other	Constraint logic programming	en
dc.subject.other	Transport management	en
dc.subject.other	Vehicle scheduling problem (VSP)	en
dc.subject.other	Transportation routes	en
dc.title	Combination of local search and CLP in the vehicle-fleet scheduling problem	en
heal.type	journalArticle	en
heal.identifier.primary	10.1016/S0377-2217(96)00114-2	en
heal.identifier.secondary	http://dx.doi.org/10.1016/S0377-2217(96)00114-2	en
heal.language	English	en
heal.publicationDate	1997	en
heal.abstract	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
heal.publisher	ELSEVIER SCIENCE BV	en
heal.journalName	European Journal of Operational Research	en
dc.identifier.doi	10.1016/S0377-2217(96)00114-2	en
dc.identifier.isi	ISI:A1997XA82700006	en
dc.identifier.volume	98	en
dc.identifier.issue	3	en
dc.identifier.spage	512	en
dc.identifier.epage	521	en