scholarly journals A Two-Phase Solution Approach for a Real-Life Examination Timetabling Problem

2019 ◽  
Vol 25 (1) ◽  
pp. 71-81
Author(s):  
Rahime Sancar Edis ◽  
Emrah B. Edis
Keyword(s):  
Real Life ◽  
Examination Timetabling ◽  
Two Phase ◽  
Solution Approach ◽  
Timetabling Problem ◽  
Phase Solution

REAL-LIFE VEHICLE ROUTING WITH TIME WINDOWS FOR VISUAL ATTRACTIVENESS AND OPERATIONAL ROBUSTNESS

2012 ◽  
Vol 29 (04) ◽  
pp. 1250017 ◽  
Author(s):  
B. L. HOLLIS ◽  
P. J. GREEN
Keyword(s):  
Vehicle Routing ◽  
Search Algorithm ◽  
Time Windows ◽  
Real Life ◽  
Second Phase ◽  
Two Phase ◽  
Guided Local Search ◽  
Solution Approach ◽  
Robust Solutions ◽  
Phase Solution

This paper describes an algorithm for producing visually attractive and operationally robust solutions to a real-life vehicle routing problem with time windows. Visually attractive and operationally robust solutions are usually synonymous with compact, nonoverlapping routes with little or no intra-route cross over. The visual attractiveness of routes, for practical routing applications, is often of paramount importance. We present a two phase solution approach. The first phase is inspired by the sequential insertion algorithm of Solomon (1987) and includes a range of novel enhancements to ensure visually attractive solutions are produced in the face of a range of nonstandard real-life constraints: A constrained and heterogeneous vehicle fleet; tight time windows and banned delivery windows; multiple route capacity measures; driver breaks; minimum route volumes; vehicle-location compatibility rules; nonreturn to base routes; peak hour traveling times; vehicle type dependent service times; and replenishment back at the depot. The second phase is based on the guided local search algorithm of Kilby et al. (1999). It uses an augmented objective function designed to seek solutions which strike a balance between minimizing traditional cost measures, whilst maximizing the visual attractiveness of the solution. Our two phase solution approach is particularly adept at producing solutions that both aggressively minimize the total number of routes, a feature that we believe has been missing in algorithms presented in equivalent literature, as well as minimizing traditional cost measures whilst delivering a very high degree of visual attractiveness. The algorithm presented has been successfully implemented and deployed for the real-life, daily beverage distribution problem of Schweppes Australia Pty. Ltd. for a range of capital cities throughout Australia.

scholarly journals A two-phase solution approach for a manufacturing-distribution problem with rework, outsourcing, and multi-shipment policy

2020 ◽  
Vol 18 (4) ◽  
pp. 505-509
Author(s):  
Chiu Peter ◽  
Peng-Cheng Sung ◽  
Victoria Chiu
Keyword(s):  
Cost Minimization ◽  
Algebraic Approach ◽  
Solution Procedure ◽  
Batch Size ◽  
Real Problem ◽  
Two Phase ◽  
Solution Approach ◽  
Straightforward Solution ◽  
The Cost ◽  
Phase Solution

In a recent study, a manufacturing batch-size and end-product shipment problem with outsourcing, multi-shipment, and rework was investigated using mathematical modeling and derivatives in its solution procedure. This study demonstrates that a simplified two-phase algebraic approach can also solve the problem and decide the cost-minimization policies for batch-size and end-product shipments. Our proposed straightforward solution approach enables the practitioners in the production planning and controlling filed to comprehend and efficiently solve the best replenishing batch-size and shipment policies of this real problem.

A heuristic two-phase solution approach for the multi-objective dial-a-ride problem

Networks ◽  
2009 ◽  
Vol 54 (4) ◽  
pp. 227-242 ◽  
Author(s):  
Sophie N. Parragh ◽  
Karl F. Doerner ◽  
Richard F. Hartl ◽  
Xavier Gandibleux
Keyword(s):  
Two Phase ◽  
Solution Approach ◽  
Multi Objective ◽  
Phase Solution

scholarly journals An ant colony algorithm for universiti sultan zainal abidin examination timetabling problem

2019 ◽  
Vol 13 (1) ◽  
pp. 191
Author(s):  
Ahmad Firdaus Khair ◽  
Mokhairi Makhtar ◽  
Munirah Mazlan ◽  
Mohamad Afendee Mohamed ◽  
Mohd Nordin Abdul Rahman
Keyword(s):  
Ant Colony Algorithm ◽  
Educational Institution ◽  
Real Life ◽  
Ant Colony ◽  
Ant Colony Optimisation ◽  
Examination Timetabling ◽  
Timetabling Problem ◽  
College And University ◽  
Academic Management ◽  
And Performance

The real-life construction of examination timetabling problem is considered as a common problem that always encountered and experienced in educational institution whether in school, college, and university. This problem is usually experienced by the academic management department where they have trouble to handle complexity for assign examination into a suitable timeslot manually. In this paper, an algorithm approach of ant colony optimisation (ACO) is presented to find an effective solution for dealing with Universiti Sultan Zainal Abidin (UniSZA) examination timetabling problems. A combination of heuristic with ACO algorithm contributes the development solution in order to simplify and optimize the pheromone occurrence of matrix updates which include the constraints problem. The implementation of real dataset instances from academic management is applied to the approach for generating the result of examination timetable. The result and performance that obtained will be used for further use to evaluate the quality and observe the solution whether our examination timetabling system is reliable and efficient than the manual management that can deal the constraints problem.

scholarly journals Heuristic and genetic algorithm approaches to the real-world university examination timetabling problem

2017 ◽  
Vol 7 (1) ◽  
pp. 143-151
Author(s):  
İlker Küçükoğlu ◽  
Alkın Yurtkuran
Keyword(s):  
Genetic Algorithm ◽  
Real World ◽  
Real Life ◽  
Mixed Integer ◽  
Examination Timetabling ◽  
The Real ◽  
Timetabling Problem ◽  
Constructive Heuristic ◽  
Integer Linear Model ◽  
Hard And Soft Constraints

Timetabling is one of the computationally difficult problems in scheduling and aims to find best time slots for a number of tasks which require limited resources. In this paper, we examine different solution approaches for the real-world examination timetabling problem (ETP) for university courses. The problem has unique hard and soft constraints, when compared to previous efforts, i.e. consecutive exams, sharing of rooms, room preferences, room capacity and number of empty slots. The aim of the problem is to achieve a timetable, which minimizes the total number of the examination slots without any conflicts. First, the real-world problem is formally defined and a mixed integer linear model is presented. Then, a constructive heuristic and a genetic algorithm based meta-heuristic are proposed in order to solve the ETP. Proposed approaches are tested on a problem set formed by using a real-life data. Results reveal that, proposed approaches are able to produce superior solutions in a limited time. Keywords: Timetabling, constructive heuristic, genetic algorithm;

scholarly journals Hybrid Intelligent Water Drops Algorithm for Examination Timetabling Problem

2021 ◽  
Author(s):  
Bashar A. Aldeeb ◽  
Mohammed Azmi Al-Betar ◽  
Norita Md Norwawi ◽  
Khalid A. Alissa ◽  
Mutasem K. Alsmadi ◽  
...  
Keyword(s):  
Examination Timetabling ◽  
Timetabling Problem ◽  
Intelligent Water Drops Algorithm ◽  
Water Drops ◽  
Intelligent Water Drops
Sign in / Sign up

Export Citation Format

Share Document