A robust enhancement to the Clarke-Wright savings algorithm

We address the Clarke and Wright (CW) savings algorithm proposed for the Capacitated Vehicle Routing Problem (CVRP). We first consider a recent enhancement which uses the put first larger items idea originally proposed for the bin packing problem and show that the conflicting idea of putting smaller items first has a comparable performance. Next, we propose a robust enhancement to the CW savings formulation. The proposed formulation is normalized to efficiently solve different problems, independent from the measurement units and parameter intervals. To test the performance of the proposed savings function, we conduct an extensive computational study on a large set of well-known instances from the literature. Our results show that the proposed savings function provides shorter distances in the majority of the instances and the average performance is significantly better than previously presented enhancements

The European Federation of Organisations for Medical Physics Policy Statement No. 6.1: Recommended Guidelines on National Registration Schemes for Medical Physicists

This EFOMP Policy Statement is an update of Policy Statement No. 6 first published in 1994. The present version takes into account the European Union Parliament and Council Directive 2013/55/EU that amends Directive 2005/36/EU on the recognition of professional qualifications and the European Union Council Directive 2013/59/EURATOM laying down the basic safety standards for protection against the dangers arising from exposure to ionising radiation. The European Commission Radiation Protection Report No. 174, Guidelines on Medical Physics Expert and the EFOMP Policy Statement No. 12.1, Recommendations on Medical Physics Education and Training in Europe 2014, are also taken into consideration. The EFOMP National Member Organisations are encouraged to update their Medical Physics registration schemes where these exist or to develop registration schemes taking into account the present version of this EFOMP Policy Statement (Policy Statement No. 6.1"Recommended Guidelines on National Registration Schemes for Medical Physicists")

The European Federation of Organisations for Medical Physics Policy Statement No. 10.1: Recommended Guidelines on National Schemes for Continuing Professional Development of Medical Physicists

Continuing Professional Development (CPD) is vital to the medical physics profession if it is to embrace the pace of change occurring in medical practice. As CPD is the planned acquisition of knowledge, experience and skills required for professional practice throughout one's working life it promotes excellence and protects the profession and public against incompetence. Furthermore, CPD is a recommended prerequisite of registration schemes (Caruana et al. 2014 [1]; [2]) and is implied in the Council Directive 2013/59/EURATOM (EU BSS) [3] and the International Basic Safety Standards (BSS) [4]. It is to be noted that currently not all national registration schemes require CPD to maintain the registration status necessary to practise medical physics. Such schemes should consider adopting CPD as a prerequisite for renewing registration after a set period of time. This EFOMP Policy Statement, which is an amalgamation and an update of the EFOMP Policy Statements No. 8 and No. 10, presents guidelines for the establishment of national schemes for CPD and activities that should be considered for CPD

Disrupted Capacitated Vehicle Routing Problem with Order Release Delay

With the popularity of the just-in-time system, more and more companies are operating with little or no inventories, which make them highly vulnerable to delays on supply. This paper discusses a situation when the supply of the commodity does not arrive at the depot on time, so that not enough of the commodity is available to be loaded on all vehicles at the start of the delivery period. New routing plans need to be developed in such a case to reduce the impact the delay of supply may have on the distribution company. The resulting vehicle routing problem is different from other types of vehicle routing problems as it involves waiting and multiple trips. Two approaches have been developed to solve the order release delay problem, both of which involve a Tabu Search algorithm. Computational results show the proposed approaches can largely reduce the disruption costs that are caused by the delayed supply and they are especially effective when the length of delay is long

Exploring Graphs with Time Constraints by Unreliable Collections of Mobile Robots

A graph environment must be explored by a collection of mobile robots. Some of the robots, a priori unknown, may turn out to be unreliable. The graph is weighted and each node is assigned a deadline. The exploration is successful if each node of the graph is visited before its deadline by a reliable robot. The edge weight corresponds to the time needed by a robot to traverse the edge. Given the number of robots which may crash, is it possible to design an algorithm, which will always guarantee the exploration, independently of the choice of the subset of unreliable robots by the adversary? We find the optimal time, during which the graph may be explored. Our approach permits to find the maximal number of robots, which may turn out to be unreliable, and the graph is still guaranteed to be explored. We concentrate on line graphs and rings, for which we give positive results. We start with the case of the collections involving only reliable robots. We give algorithms finding optimal times needed for exploration when the robots are assigned to fixed initial positions as well as when such starting positions may be determined by the algorithm. We extend our consideration to the case when some number of robots may be unreliable. Our most surprising result is that solving the line exploration problem with robots at given positions, which may involve crash-faulty ones, is NP-hard. The same problem has polynomial solutions for a ring and for the case when the initial robots' positions on the line are arbitrary. The exploration problem is shown to be NP-hard for star graphs, even when the team consists of only two reliable robots

Estimation of thorax shape for forward modelling in lungs EIT

The thorax models for pre-term babies are developed based on the CT scans from new-borns and their effect on image reconstruction is evaluated in comparison with other available models