Most popular benchmark sets for the VRP comprise instances of several hundred customers. To foster research in the area of very large scale vehicle routing we developed an additional set of very large scale and realistic benchmark instances. These instances
For many combinatorial optimization problems, heuristics based on either local search or constructive strategies have been demonstrated to provide the best trade-off between solution quality and computation time. In recent years, it has become apparent that the efficiency of a
Source code of the heuristic analysed in the paper “A critical analysis of the improved Clarke and Wright savings algorithm”
Below, you can find the source code of the heuristic analysed in the paper: K. Sörensen, F. Arnold, and D. Palhazi Cuervo, “A critical analysis of the “improved Clarke and Wright savings algorithm”,” International transactions in operational research, vol. to appear.
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
Optimal designs in the paper “An integrated algorithm for the optimal design of stated choice experiments with partial profiles”
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
Bagana fragments generated in “Generating structured music for bagana using quality metrics based on Markov models”
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.
Instances in the paper “Multi-objective microzone-based vehicle routing for courier companies: From tactical to operational planning”
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.