CONSTRAINT LOGIC PROGRAMMING AND ITS APPLICATION TO FLEET SCHEDULING

This paper presents a new computer-oriented technique: constraint logi c programming and the formulation of the fleet scheduling problem usin g it. This technique presents several advantages in dealing with combi natorial problems as it combines the declarative aspects of logic prog ramming with the efficiency of constraint search techniques. The class ical 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 a reas of Operational Research.