Constraint logic programming and its application to fleet scheduling

Christodoulou, N; Wallace, M; Kuchenhoff, V

dc.contributor.author	Christodoulou, N	en
dc.contributor.author	Wallace, M	en
dc.contributor.author	Kuchenhoff, V	en
dc.date.accessioned	2014-03-01T01:09:47Z
dc.date.available	2014-03-01T01:09:47Z
dc.date.issued	1994	en
dc.identifier.issn	0923-0408	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/11187
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-0028341948&partnerID=40&md5=bd7d4382a2c8472faade0c8f2aef3591	en
dc.subject.classification	Operations Research & Management Science	en
dc.subject.other	Algorithms	en
dc.subject.other	Decision support systems	en
dc.subject.other	Logic programming	en
dc.subject.other	Management information systems	en
dc.subject.other	Operations research	en
dc.subject.other	Fleet scheduling	en
dc.subject.other	Heuristics	en
dc.subject.other	Traveling salesman problem	en
dc.subject.other	Decision theory	en
dc.title	Constraint logic programming and its application to fleet scheduling	en
heal.type	journalArticle	en
heal.language	English	en
heal.publicationDate	1994	en
heal.abstract	This paper presents a new computer-oriented technique: constraint logic programming and the formulation of the fleet scheduling problem using it. This technique presents several advantages in dealing with combinatorial problems as it combines the declarative aspects of logic programming with the efficiency of constraint search techniques. The classical problem as well as some of its most significant variations, i.e. the backhaul, the time-windows and the multiple-depot variation, were formulated by implementing this technique in one of the most NP-hard areas of Operational Research.	en
heal.publisher	ELSEVIER SCIENCE BV	en
heal.journalName	Information and decision technologies Amsterdam	en
dc.identifier.isi	ISI:A1994MX33600001	en
dc.identifier.volume	19	en
dc.identifier.issue	3	en
dc.identifier.spage	135	en
dc.identifier.epage	144	en