1,720,973 research outputs found
How to locate services optimizing redundancy: A comparative analysis of K-Covering Facility Location models
Full text linkRedundancy aspects related to covering facility location problems are of extreme importance for many applications, in particular those regarding critical services. For example, in the healthcare sector, facilities such as ambulances or first-aid centers must be located robustly against unpredictable events causing disruption or congestion. In this paper, we propose different modeling tools that explicitly address coverage redundancy for the underlying service. We also evaluate, both theoretically and experimentally, the properties and behavior of the models, and compare them from a computational and managerial point of view. More precisely, by starting from three classical double-covering models from the literature (BACOP1, BACOP2, and DSM), we define three parametric families of models (namely, K-BACOP1, K-BACOP2, and K-DSM) which generalize the former to any possible Kth coverage level of interest. The study of such generalizations allows us to derive interesting managerial insights on location decisions at the strategic level. The CPU performance and the quality of the solutions returned are assessed through ad-hoc KPIs collected over many representative instances with different sizes and topological characteristics, and also by dynamically simulating scenarios involving possible disruption for the located facilities. Finally, a real case study concerning ambulance service in Morocco is analyzed. The results show that, in general, K-BACOP1 performs very well, even if intrinsic feasibility issues limit its broad applicability. Instead, K-DSM achieves the best coverage and equity performances for lower levels of redundancy, while K-BACOP2 seems the most robust choice when high redundancy is required, showing smoother and more predictable trends
Smart steaming: A new flexible paradigm for synchromodal logistics
Full text linkSlow steaming, i.e., the possibility to ship vessels at a significantly slower speed than their nominal one, has been widely studied and implemented to improve the sustainability of long-haul supply chains. However, to create an efficient symbiosis with the paradigm of synchromodality, an evolution of slow steaming called smart steaming is introduced. Smart steaming is about defining a medium speed execution of shipping movements and the real-time adjustment (acceleration and deceleration) of traveling speeds to pursue the entire logistic system’s overall efficiency and sustainability. For instance, congestion in handling facilities (intermodal hubs, ports, and rail stations) is often caused by the common wish to arrive as soon as possible. Therefore, smart steaming would help avoid bottlenecks, allowing better synchronization and decreasing waiting time at ports or handling facilities. This work aims to discuss the strict relationships between smart steaming and synchromodality and show the potential impact of moving from slow steaming to smart steaming in terms of sustainability and efficiency. Moreover, we will propose an analysis considering the pros, cons, opportunities, and risks of managing operations under this new policy
FROM MIDI TO RICH TABLATURES: AN AUTOMATIC GENERATIVE SYSTEM INCORPORATING LEAD GUITARISTS' FINGERING AND STYLISTIC CHOICES
Full text linkA Generalized Bin Packing Problem for parcel delivery in last-mile logistics
No full textIn this paper, we present a new problem arising at a tactical level of setting a last-mile parcel delivery service in a city by considering different Transportation Companies (TC), which differ in cost and service quality. The courier must decide which TCs to select for the service in order to minimize the total cost and maximize the total service quality. We show that the problem can be modeled as a new packing problem, the Generalized Bin Packing Problem with bin-dependent item profits (GBPPI), where the items are the parcels to deliver and the bins are the TCs. The aim of the GBPPI is to select the appropriate fleet from TCs and determine the optimal assignment of parcels to vehicles such that the overall net cost is minimized. This cost takes into account both transportation costs and service quality. We provide a Mixed Integer Programming formulation of the problem, which is the starting point for the development of efficient heuristics that can address the GBPPI for instances involving up to 1000 items. Extensive computational tests show the accuracy of the proposed methods. Finally, we present a last-mile logistics case study of an international courier which addresses this problem
The synchronized multi-commodity multi-service Transshipment-Hub Location Problem with cyclic schedules
Full text linkThe synchronized multi-commodity multi-service Transshipment-Hub Location Problem is a hub location problem variant faced by a logistics service provider operating in the context of synchromodal logistics. The provider must decide where and when to locate transshipment facilities in order to manage many customers’
origin–destination shipments with release and due dates while minimizing a total cost given by location costs, transportation costs, and penalties related to unmet time constraints. The considered synchromodal network involves different transportation modes (e.g., truck, rail, river and sea navigation) to perform long-haul shipments and the freight synchronization at facilities for transshipment operations. To the best
of our knowledge, this variant has never been studied before. Considering a time horizon in which both transportation services and demand follow a cyclic pattern, we propose a time–space network representation of the problem and an ad-hoc embedding of the time-dependent parameters into the network topology and
the arcs’ weight. This allows to model the flow synchronization required by the problem through a Mixed-Integer Linear Programming formulation with a simplified structure, similar to well-known hub location problems and avoiding complicating constraints for managing the time dimension. Through an extensive experimental campaign conducted over a large set of realistic instances, we present a computational and an economic analysis. In particular, we want to assess the potential benefits of implementing synchromodal logistics operations into long-haul supply-chains managed by large service providers. Since flexibility is one of the main features of synchromodality, we evaluate the impact on decisions and costs of different levels of
flexibility regarding terminals’ operations and customers’ requirements
Optimizing Attended Home Delivery: Multiple recovery options and customer availability profiles to face synchronization failures
Full text linkIn the growing sector of Attended Home Delivery, unsynchronized deliveries between couriers and recipients affect both customers’ satisfaction and companies’ costs. Hence, reducing such failures improves companies’ service quality and logistics efficiency. To address this issue, we study an Attended Home Delivery Problem with Recovery Options (AHDPRO) in which customers specify their probability of being at home during different timeslots of the day and their preferred recovery option in case of a synchronization failure. The options include leaving the package in a predefined safe location, bringing it to a generic collection point, or scheduling a second delivery attempt. Each alternative involves different costs and, in most cases, additional operational decisions. The AHDPRO aims to complete all customer deliveries while minimizing overall routing times as well as the overall penalty due to the recovery actions implemented and weighted by the probability of a synchronization failure to occur. We propose a branch-and-cut algorithm, including valid inequalities and heuristic procedures, to solve a Mixed-Integer Linear Programming model based on an expanded graph. Using the developed method as a tool for evaluating costs and operations, we conduct an experimental campaign on scenarios adapted from the literature involving lexicographic-based optimization procedures able to address the multiple attributes of the solutions. The results obtained allow us to assess the impact of the different recovery options on the optimal solutions and their values. Additionally, the results yield several managerial insights for companies operating in the Attended Home Delivery sector, such as the timeslot length, perceived service quality, and other key operational factors contributing to efficient planning and improved customer satisfaction
Hybridizing adaptive large neighborhood search with kernel search: a new solution approach for the nurse routing problem with incompatible services and minimum demand
Full text linkThe average age of the population has grown steadily in recent decades along with the number of people suffering from chronic diseases and asking for treatments. Hospital care is expensive and often unsafe, especially for older individuals. This is particularly true during pandemics as the recent SARS-CoV-2. Hospitalization at home has become a valuable alternative to face efficiently a huge increase in treatment requests while guaranteeing a high quality of service and lower risk to fragile patients. This new model of care requires the redefinition of health services organization and the optimization of scarce resources (e.g., available nurses). In this paper, we study a Nurse Routing Problem that tries to find a good balance between hospital costs reduction and the well-being of patients, also considering realistic operational restrictions like maximum working times for the nurses and possible incompatibilities between services jointly provided to the same patient. We first propose a Mixed Integer Linear Programming formulation for the problem and use some valid inequalities to strengthen it. A simple branch-and-cut algorithm is proposed and validated to derive ground benchmarks. In addition, to efficiently solve the problem, we develop an Adaptive Large Neighborhood Search hybridized with a Kernel Search and validate its performance over a large set of different realistic working scenarios. Computational tests show how our matheuristic approach manages to find good solutions in a reasonable amount of time even in the most difficult settings. Finally, some interesting managerial insights are discussed through an economic analysis of the operating context
- …
