Cost-neutral reduction of infection risk in picker-to-parts warehousing systems

The rapid and severe outbreak of COVID-19 caused by SARS-CoV-2 has heavily impacted warehouse operations around the world. In particular, picker-to-parts warehousing systems, in which human pickers collect requested items by moving from picking location to picking location, are very susceptible to the spread of infection among pickers because the latter generally work close to each other. This paper aims to mitigate the risk of infection in manual order picking. Given multiple pickers, each associated with a given sequence of picking tours for collecting the items specified by a picking order, we aim to execute the tours in a way that minimizes the time pickers simultaneously spend in the same picking aisles, but without changing the distance traveled by the pickers. To achieve this, we exploit the degrees of freedom induced by the fact that picking tours contain cycles which can be traversed in both directions, i.e., at the entry to each of these cycles, the decision makers can decide between the two possible directions. We formulate the resulting picking tour execution problem as a mixed integer program and propose an efficient iterated local search heuristic to solve it. In extensive numerical studies, we show that an average reduction of 50% of the total temporal overlap between pickers can be achieved compared to randomly executing the picking tours. Moreover, we compare our approach to a zone picking approach, in which infection risk between pickers can be almost eliminated. However, compared to our approach, the results show that the zone picking approach increases the makespan by up to 1066%.

A milk transportation problem with milk collection centers and vehicle routing

In this work, we study, model, and propose two approaches to solve a raw milk transportation problem inspired by a real case of a milk company in Chile. The milk is produced by a set of farms scattered in a large rural area. The company must collect all the production daily using a truck fleet. We address the location of milk collection centers to reduce transportation costs. Each center has a limited capacity and a reduced truck fleet, composed of small trucks, to collect a substantial proportion of the produced milk. Once the milk is accumulated in the collection centers, a fleet of big trucks, traveling from a processing plant, collects the milk of each collection center and some large farms. We propose a mixed-integer linear programming model, a three-stage approach based on mathematical models, and an iterated local search approach to face this problem. We evaluate these approaches' performance using a small case and several real-world examples, including a clustering approach to divide the instance into small sub-instances. The results obtained for the real-world instance show improvements of up to 10% percent when milk collection centers are allowed.

Iterated local search algorithm for solving the orienteering problem with soft time windows

In this paper we study the orienteering problem with time windows (OPTW) and the impact of relaxing the time windows on the profit collected by the vehicle. The way of relaxing time windows adopted in the orienteering problem with soft time windows (OPSTW) that we study in this research is a late service relaxation that allows linearly penalized late services to customers. We solve this problem heuristically by considering a hybrid iterated local search. The results of the computational study show that the proposed approach is able to achieve promising solutions on the OPTW test instances available in the literature, one new best solution is found. On the newly generated test instances of the OPSTW, the results show that the profit collected by the OPSTW is better than the profit collected by the OPTW.

Heuristics for multiobjective multiple sequence alignment

BACKGROUND

Aligning multiple sequences arises in many tasks in Bioinformatics. However, the alignments produced by the current software packages are highly dependent on the parameters setting, such as the relative importance of opening gaps with respect to the increase of similarity. Choosing only one parameter setting may provide an undesirable bias in further steps of the analysis and give too simplistic interpretations. In this work, we reformulate multiple sequence alignment from a multiobjective point of view. The goal is to generate several sequence alignments that represent a trade-off between maximizing the substitution score and minimizing the number of indels/gaps in the sum-of-pairs score function. This trade-off gives to the practitioner further information about the similarity of the sequences, from which she could analyse and choose the most plausible alignment.

METHODS

We introduce several heuristic approaches, based on local search procedures, that compute a set of sequence alignments, which are representative of the trade-off between the two objectives (substitution score and indels). Several algorithm design options are discussed and analysed, with particular emphasis on the influence of the starting alignment and neighborhood search definitions on the overall performance. A perturbation technique is proposed to improve the local search, which provides a wide range of high-quality alignments.

RESULTS AND CONCLUSIONS

The proposed approach is tested experimentally on a wide range of instances. We performed several experiments with sequences obtained from the benchmark database BAliBASE 3.0. To evaluate the quality of the results, we calculate the hypervolume indicator of the set of score vectors returned by the algorithms. The results obtained allow us to identify reasonably good choices of parameters for our approach. Further, we compared our method in terms of correctly aligned pairs ratio and columns correctly aligned ratio with respect to reference alignments. Experimental results show that our approaches can obtain better results than TCoffee and Clustal Omega in terms of the first ratio.