This paper presents a didactic approach for teaching integer programming starting from real-life case on scheduling the Belgian soccer league. We share our experiences as well resources two formats. The first format involves hands-on exercises and is more appropriate small student groups (up to 40 students). second an interactive lecture that focuses current research challenges better suited la...

This paper considers the integrated problem of quay crane assignment, quay crane scheduling, yard location assignment, and vehicle dispatching operations at a container terminal. The main objective is to minimize vessel turnover times and maximize the terminal throughput, which are key economic drivers in terminal operations. Due to their computational complexities, these problems are not optim...

this paper presented a mixed integer programming for integrated scheduling and process planning. the presented process plan included some orders with precedence relations similar to multiple traveling salesman problem (mtsp), which was categorized as an np-hard problem. these types of problems are also called advanced planning because of simultaneously determining the appropriate sequence and m...

This paper describes the design of the Bus Timetabling System (BTS) we have developed for one of the largest privately held bus companies in the world. This Bus Company operates close to 3,500 buses and employs over 7,500 bus drivers. The BTS generates a timetable for each bus route using “distributed constraint-based search” (DCBS). The DCBS algorithm combines techniques of constraint programm...

Train timetabling, platforming, and network maintenance scheduling are three highly interdependent problems that crucial in the planning of railway operations, each is normally addressed separately. In this paper, we simultaneously optimize these for a high-speed comprised multiple lines stations. We model on mesoscopic level formulate 0–1 binary integer programming minimizes total train weight...

A school timetabling problem is a challenging optimisation problem. set of subjects need to be assigned into class schedule while these are related both students and lecturers. The number required attend leads room’s capacity requirement. Moreover, the time assign any subject depends on lecturers’ availability. This paper aims minimize distance between classes for as they have move another room...

Vertex colouring is a well-known problem in combinatorial optimisation, whose alternative integer programming formulations have recently attracted considerable attention. This paper briefly surveys seven known formulations of vertex colouring and introduces a new formulation of vertex colouring using a suitable clique partition of the graph. This formulation is applicable in timetabling applica...