Abstract
In a survey of Belgian logistics service providers, the efficiency of first-mile pickup operations was identified as a key area for improvement, given the increasing number of returns in e-commerce, which has a significant impact on traffic congestion, carbon emissions, energy consumption and operational costs. However, the complexity of first-mile pickup operations, resulting from the small number of parcels to be collected at each pickup location, customer time windows, and the need to efficiently accommodate the highly heterogeneous cargo inside the vans, has hindered the development of real-world solution approaches. This article tackles this operational problem as a vehicle routing problem with time windows, time-dependent travel durations, and split pickups and integrates practical 3D container loading constraints such as vertical and horizontal stability as well as amore realistic reachability constraint to replace the classical Last In First Out (LIFO) constraint. To solve it, we propose a three-phase heuristic based on a savings constructive heuristic, an extreme point concept for the loading aspect and a General Variable Neighborhood Search as an improvement phase for both routing and packing. Numerical experiments are conducted to assess the performance of the algorithm on benchmark instances and new instances are tested to validate the positive managerial impacts oncost when allowing split pickups and on driver working duration when extending customer time windows. In addition, we show the impacts of considering the reachability constraint oncost and of the variation of speed during peak hours on schedule feasibility.

Abstract
This document presents the outcomes of the Dagstuhl Seminar Roadmap for Responsible Robotics, held in September 2023 at the Leibniz Center for Informatics, Schloss Dagstuhl, Germany. The seminar brought together researchers from the fields of robotics, computer science, social and cognitive sciences, and philosophy with the aim of charting a path toward improving responsibility in robotic systems. Through intensive interdisciplinary discussions centered on the various values at stake as robotics increasingly integrates into human life, the participants identified key priorities to guide future research and regulatory efforts. The resulting road map outlines actionable steps to ensure that robotic systems coevolve with human societies, promoting human agency and humane values rather than undermining them. Designed for diverse stakeholders-researchers, policy makers, industry leaders, practitioners, nongovernmental organizations (NGOs), and civil society groups-this road map provides a foundation for collaborative efforts toward responsible robotics.

Abstract
Online retail is transforming the way distribution networks are managed. One prominent change is that retailers can now use their full network to fulfil orders. This process involves allocating orders to fulfilment nodes and, depending on the setting, can include other operational decisions, such as order consolidation, shipping mode selection and product substitution. This order allocation problem (OAOR) has garnered considerable attention in recent years. However, there is no comprehensive view of what has been done in the literature, nor a consistent terminology across papers, which makes it hard to position existing work and identify research gaps. To address these concerns, we conduct a systematic literature review, where we find over 60 articles contributing to the OAOR literature. From this review, we formulate the baseline problem, consider multiple extensions, and identify key problem characteristics. Additionally, we analyse and categorize the solution methods found based on the optimization mechanism, policy class, and incorporation of future information and learning. Our review points to several avenues for future research, both in problems and in solution methods. © 2025 The Authors

Abstract

Abstract

Abstract
The Prisoner Transportation Problem is an NP-hard combinatorial problem and a complex variant of the Dial-a- Ride Problem. Given a set of requests for pick-up and delivery and a homogeneous fleet, it consists of assigning requests to vehicles to serve all requests, respecting the problem constraints such as route duration, capacity, ride time, time windows, multi-compartment assignment of conflicting prisoners and simultaneous services in order to optimize a given objective function. In this paper, we present anew solution framework to address this problem that leads to an efficient heuristic. A comparison with computational results from previous papers shows that the heuristic is very competitive for some classes of benchmark instances from the literature and clearly superior in the remaining cases. Finally, suggestions for future studies are presented.