International Timetabling Competition 2011: An Adaptive Large Neighborhood Search algorithm [PDF]
, 2012 An algorithm based on Adaptive Large Neighborhood Search (ALNS) for solving the generalized High School Timetabling problem in XHSTT-format (Post et al (2012a)) is presented. This algorithm was among the nalists of round 2 of the International Timetabling Competition 2011 (ITC2011). For problem description and results we refer to Post et al (2012b).
Sørensen, Matias +2 more
openaire +2 more sources
Bi-Objective Adaptive Large Neighborhood Search Algorithm for the Healthcare Waste Periodic Location Inventory Routing Problem. [PDF]
Arab J Sci Eng, 2022 There has been an unexpected increase in the amount of healthcare waste during the COVID-19 pandemic. Managing healthcare waste is vital, as improper practices in the waste system can lead to the further spread of the virus.
Aydemir-Karadag A.
europepmc +2 more sources
Models, methods and algorithms for supply chain planning [PDF]
, 2011 This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.An outline of supply chains and differences in the problem types is given. The motivation for a generic framework is discussed and explored.
Chippington Derrick, Deborah
core +7 more sources
A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems [PDF]
, 2014 In this study, we improved the variable neighborhood search (VNS) algorithm for solving uncapacitated multilevel lot-sizing (MLLS) problems. The improvement is two-fold.
Xu, Yuchun +4 more
core +1 more source
Split-merge:using exponential neighborhood search for scheduling a batching machine [PDF]
, 2015 We address the problem of scheduling a single batching machine to minimize the maximum lateness with a constraint restricting the batch size. A solution for this NP-hard problem is defined by a selection of jobs for each batch and an ordering of those ...
Song, Xiang +3 more
core +1 more source
A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem [PDF]
, 2008 The heterogeneous fleet vehicle routing problem is investigated using some adaptations of the variable neighborhood search (VNS). The initial solution is obtained by Dijkstra's algorithm based on a cost network constructed by the sweep algorithm and the ...
Imran, Arif +2 more
core +1 more source
A search algorithm for global optimisation [PDF]
, 2005 This paper investigates a global search optimisation technique, referred to as the repeated weighted boosting search. The proposed optimisation algorithm is extremely simple and easy to implement.
Wang, X.X., Harris, C.J., Chen, S.
core +2 more sources
Primal-dual variable neighborhood search for the simple plant-location problem [PDF]
, 2007 Copyright @ 2007 INFORMSThe variable neighborhood search metaheuristic is applied to the primal simple plant-location problem and to a reduced dual obtained by exploiting the complementary slackness conditions.
Brimberg, J +3 more
core +1 more source
A Hybrid Adaptive Large Neighborhood Heuristic for a Real-Life Dial-a-Ride Problem
Algorithms, 2019 The transportation of elderly and impaired people is commonly solved as a Dial-A-Ride Problem (DARP). The DARP aims to design pick-up and delivery vehicle routing schedules.
Slim Belhaiza
doaj +1 more source
A hybrid genetic algorithm and tabu search approach for post enrolment course timetabling [PDF]
, 2010 Copyright @ Springer Science + Business Media. All rights reserved.The post enrolment course timetabling problem (PECTP) is one type of university course timetabling problems, in which a set of events has to be scheduled in time slots and located in ...
Yang, S +4 more
core +1 more source