Fuzzy Integer Linear Programming Mathematical Models for Examination Timetable Problem

07/07/2013
by   Arindam Chaudhuri, et al.
0

ETP is NP Hard combinatorial optimization problem. It has received tremendous research attention during the past few years given its wide use in universities. In this Paper, we develop three mathematical models for NSOU, Kolkata, India using FILP technique. To deal with impreciseness and vagueness we model various allocation variables through fuzzy numbers. The solution to the problem is obtained using Fuzzy number ranking method. Each feasible solution has fuzzy number obtained by Fuzzy objective function. The different FILP technique performance are demonstrated by experimental data generated through extensive simulation from NSOU, Kolkata, India in terms of its execution times. The proposed FILP models are compared with commonly used heuristic viz. ILP approach on experimental data which gives an idea about quality of heuristic. The techniques are also compared with different Artificial Intelligence based heuristics for ETP with respect to best and mean cost as well as execution time measures on Carter benchmark datasets to illustrate its effectiveness. FILP takes an appreciable amount of time to generate satisfactory solution in comparison to other heuristics. The formulation thus serves as good benchmark for other heuristics. The experimental study presented here focuses on producing a methodology that generalizes well over spectrum of techniques that generates significant results for one or more datasets. The performance of FILP model is finally compared to the best results cited in literature for Carter benchmarks to assess its potential. The problem can be further reduced by formulating with lesser number of allocation variables it without affecting optimality of solution obtained. FLIP model for ETP can also be adapted to solve other ETP as well as combinatorial optimization problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/07/2012

Design, Evaluation and Analysis of Combinatorial Optimization Heuristic Algorithms

Combinatorial optimization is widely applied in a number of areas nowada...
research
11/07/2020

A Reinforcement Learning Approach to the Orienteering Problem with Time Windows

The Orienteering Problem with Time Windows (OPTW) is a combinatorial opt...
research
12/15/2022

Local Branching Relaxation Heuristics for Integer Linear Programs

Large Neighborhood Search (LNS) is a popular heuristic algorithm for sol...
research
12/15/2022

Learning to repeatedly solve routing problems

In the last years, there has been a great interest in machine-learning-b...
research
07/07/2013

Trapezoidal Fuzzy Numbers for the Transportation Problem

Transportation Problem is an important problem which has been widely stu...
research
09/22/2013

A Meta-heuristically Approach of the Spatial Assignment Problem of Human Resources in Multi-sites Enterprise

The aim of this work is to present a meta-heuristically approach of the ...

Please sign up or login with your details

Forgot password? Click here to reset