Richard F. Hartl

TL;DR: In this paper, the beneficial effect of P-ACO’s core function (i.e., the learning feature) is substantiated by means of a numerical example based on real world data and an integer linear programming preprocessing procedure that identifies several efficient portfolio solutions within a few seconds and correspondingly initializes the pheromone trails before running P- ACO is supplemented.

TL;DR: A problem faced by the blood bank of the Austrian Red Cross for Eastern Austria: how to cost-effectively organize the delivery of blood products to Austrian hospitals is introduced and solution approaches based on integer programming and variable neighborhood search are presented.

TL;DR: The service technician routing and scheduling problem with and without team building is defined and high quality solutions are obtained within short computation times by means of an adaptive large neighborhood search algorithm.

TL;DR: This special issue aims to summarise recent developments in the field of supply chain dynamics, control and disruption management from a multidisciplinary operational perspective that includes different quantitative methods and information technology.

TL;DR: A structured overview on the state of knowledge of collaborative vehicle routing is given and three major streams of research are identified: (i) centralized collaborative planning, ( ii) decentralized planning without auctions, and (ii) auction-based decentralized planning.