692 research outputs found
Design, Engineering, and Experimental Analysis of a Simulated Annealing Approach to the Post-Enrolment Course Timetabling Problem
The post-enrolment course timetabling (PE-CTT) is one of the most studied
timetabling problems, for which many instances and results are available. In
this work we design a metaheuristic approach based on Simulated Annealing to
solve the PE-CTT. We consider all the different variants of the problem that
have been proposed in the literature and we perform a comprehensive
experimental analysis on all the public instances available. The outcome is
that our solver, properly engineered and tuned, performs very well on all
cases, providing the new best known results on many instances and
state-of-the-art values for the others
Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem
We consider the university course timetabling problem, which is one of the
most studied problems in educational timetabling. In particular, we focus our
attention on the formulation known as the curriculum-based course timetabling
problem, which has been tackled by many researchers and for which there are
many available benchmarks.
The contribution of this paper is twofold. First, we propose an effective and
robust single-stage simulated annealing method for solving the problem.
Secondly, we design and apply an extensive and statistically-principled
methodology for the parameter tuning procedure. The outcome of this analysis is
a methodology for modeling the relationship between search method parameters
and instance features that allows us to set the parameters for unseen instances
on the basis of a simple inspection of the instance itself. Using this
methodology, our algorithm, despite its apparent simplicity, has been able to
achieve high quality results on a set of popular benchmarks.
A final contribution of the paper is a novel set of real-world instances,
which could be used as a benchmark for future comparison
Tabu search techniques for the heterogeneous vehicle routing problem with time windows and carrier-dependent costs
Abstract In this work we formalize a new complex variant of the classical vehicle routing problem arising from a real-world application. Our formulation includes a heterogeneous fleet, a multi-day planning horizon, a complex carrier-dependent cost function for the vehicles, and the possibility of leaving orders unscheduled. We propose a metaheuristic approach based on tabu search and on a complex combination of neighborhood relations. Finally, we perform an experimental analysis to tune and compare different combinations, highlighting the most important features of the algorithm.
New perspectives in pediatric dialysis technologies: the case for neonates and infants with acute kidney injury
Advancements in pediatric dialysis generally rely on adaptation of technology originally developed for adults. However, in the last decade, particular attention has been paid to neonatal extracorporeal therapies for acute kidney care, an area in which technology has made giant strides in recent years. Peritoneal dialysis (PD) is the kidney replacement therapy (KRT) of choice in the youngest age group because of its simplicity and effectiveness. However, extracorporeal blood purification provides more rapid clearance of solutes and faster fluid removal. Hemodialysis (HD) and continuous KRT (CKRT) are thus the most used dialysis modalities for pediatric acute kidney injury (AKI) in developed countries. The utilization of extracorporeal dialysis for small children is associated with a series of clinical and technical challenges which have discouraged the use of CKRT in this population. The revolution in the management of AKI in newborns has started recently with the development of new CKRT machines for small infants. These new devices have a small extracorporeal volume that potentially prevents the use of blood to prime lines and dialyzer, allow a better volume control and the use of small-sized catheter without compromising the blood flow amount. Thanks to the development of new dedicated devices, we are currently dealing with a true “scientific revolution” in the management of neonates and infants who require an acute kidney support
Educational timetabling: Problems, benchmarks, and state-of-the-art results
We propose a survey of the research contributions on the field of Educational Timetabling with a specific focus on “standard” formulations and the corresponding benchmark instances. We identify six of such formulations and we discuss their features, pointing out their relevance and usability. Other available formulations and datasets are also reviewed and briefly discussed. Subsequently, we report the main state-of-the-art results on the selected benchmarks, in terms of solution quality (upper and lower bounds), search techniques, running times, and other side settings
Firm-specific characteristics impacting collaborative behavior : the case of the canadian biotechnology industry
The need to collaborate -- Characteristics influencing collaborative behavior -- Methodology -- Data -- Summary statistics and contingency tables -- Regression models -- Results -- Summary statistics -- Partners -- Results -- Regression models -- Logit analysis -- Negative binomial analysis
The on-demand warehousing problem
Warehouses are key elements of supply chain networks, and great attention is paid to increase their efficiency. Highly volatile space requirements are enablers of innovative resource sharing concepts, where warehouse capacities are traded on online platforms. In this context, our paper introduces the on-demand warehousing problem from the perspective of platform providers. The objective prioritises demand–supply matching with maximisation of the number of transactions. If there is a tie, the secondary objective maximises the number of suppliers matched with at least one customer and the number of customers that have matches within a specific threshold with respect to the minimum achievable cost. Besides the mathematical integer programming formulation, a myopic list-based heuristic and an efficient matheuristic approach are presented and benchmarked against the performance of a commercial optimisation solver. The impact of several parameters on the platform's objective is analysed. A particularly relevant finding is that the pricing flexibility on the demand side does not necessarily imply higher payments to the supply side. All data instances are made available publicly to encourage more researchers to work on this timely and challenging topic
The Second International Nurse Rostering Competition
This paper reports on the Second International Nurse Rostering Competition (INRC-II). Its contributions are (1) a new problem formulation which, differently from INRC-I, is a multi-stage procedure, (2) a competition environment that, as in INRC-I, will continue to serve as a growing testbed for search approaches to the INRC-II problem, and (3) final results of the competition. We discuss also the competition environment, which is an infrastructure including problem and instance definitions, testbeds, validation/simulation tools and rules. The hardness of the competition instances has been evaluated through the behaviour of our own solvers, and confirmed by the solvers of the participants. Finally, we discuss general issues about both nurse rostering problems and optimisation competitions in general.PostprintPeer reviewe
- …