Below, you can find the source code of the heuristic analysed in the paper: F. Arnold, K. Sörensen, and D. Palhazi Cuervo, “A critical analysis of the improved Clarke and Wright savings algorithm,” Faculty of Applied Economics – University of Antwerp,
At the latest conference of the German OR Society in Hamburg (www.or2016.de), I gave a semi-plenary talk on the history of metaheuristics. This talk is the live-version of a chapter that will soon appear in the Handbook of Heuristics (Springer). This
Below, you can find the optimal designs generated for the paper D. Palhazi Cuervo, R. Kessels, P. Goos, and K. Sörensen, “An integrated algorithm for the optimal design of stated choice experiments with partial profiles,” Transportation research part B: methodological, vol.
Florian and Christof presented their work at the VeRoLog conference, the annual workshop of the EURO working group on Vehicle Routing and Logistics optimization, which took place at Nantes (France). The presentations can be found here. C. Defryn and K.
Kenneth and Daniel were part of the organizing committee of EPS2016: a PhD school in matheuristics that took place in Lorient (France) in April, 2016. They also coordinated the lab sessions, in which the students had the chance to develop optimization methods to
A set of test instances. 2 different types of nodes (labelled as type 1 or type 2), randomly generated around cluster centers, density is normally distributed. Possible applications: network generation/network optimization for telecommunications networks, electricity networks, water distribution networks, gas
Below are the example bagana fragments generated by the VNS described in the paper D. Herremans, S. Weisser, K. Sörensen, and D. Conklin, “Generating structured music for bagana using quality metrics based on markov models,” Expert systems with applications, vol.
Distribution companies that serve a very large number of customers, courier companies for example, often partition the geographical region served by a depot into zones. Each zone is assigned to a single vehicle and each vehicle serves a single zone.
Luca Talarico successfully defended his PhD in February 2015. The title of his dissertation is “Secure Vehicle Routing: models and algorithms to increase security and reduce costs in the cash-in-transit sector”. Below, you can find his dissertation, the presentation for his public defense and a set
On this page we present test instances for 3 papers: J. Janssens, L. Talarico, and K. Sörensen, “A hybridised variable neighbourhood tabu search heuristic to increase security in a utility network,” Reliability engineering & system safety, vol. 145, pp. 221-230,