Technology Target Studies: Technology Solutions to Make Patient Care Safer and More Efficient

Presents findings on technologies that could enhance care delivery, including patient records and medication processes; features and functionality nurses require, including tracking, interoperability, and hand-held capability; and best practices

Chapter 13 - Sharing strategies: carsharing, shared micromobility (bikesharing and scooter sharing), transportation network companies, microtransit, and other innovative mobility modes

Shared mobility—the shared use of a vehicle, bicycle, or other mode—is an innovative transportation strategy that enables users to gain short-term access to transportation modes on an “as-needed” basis. It includes various forms of carsharing, bikesharing, scooter sharing, ridesharing (carpooling and vanpooling), transportation network companies (TNCs), and microtransit. Included in this ecosystem are smartphone “apps” that aggregate and optimize these mobility options, as well as “courier network services” that provide last mile package and food delivery. This chapter describes different models that have emerged in shared mobility and reviews research that has quantified the environmental, social, and transportation-related impacts of these services

CHECK PROCESSING AS AN INFORMATION MANAGEMENT ACTIVITY: CRITICAL REVIEW AND RESEARCH AGENDA

Current management science models fail to adequately recognize that treasury management related to check payments has largely become an information management activity. Check processing operations lack the flexibility to capture information which can be used by treasury managers to make the most effective utilization of check-related funds. This argument is developed by examining the fit between management science models and check processing practice in the U.S. banking industry, as well as at the Federal Reserve Bank, in view of the changes that information technology has wrought and the problems it has the potential to solve. We critique models for inbound and outbound check processing and treasury management for checks, and conclude that models which link check processing and treasury management models hold out significant promise for improving management control.Information Systems Working Papers Serie

Capacitated vehicle routing problem with time windows: A linear model and a case study of express courier

Given the importance gained by the e-commerce field in the recent years, this study investigates the issue of minimizing the delivery travel time of a real company located in the South of Italy and operating as a courier, express and parcel (CEP) service provider. The scenario under examination consists of a depot, three vehicles and several customers served by the CEP company. A Capacitated Vehicle Routing Problem with Time Windows (CVRPTW) model is formulated to optimize the deliveries to the customers for the targeted company and solved under the commercial software IBM ILOG CPLEX Optimization Studio. As outcomes, the model returns a simulated path covered by the vehicles and computes the corresponding travel time. Results show that with the proposed formulation, the time windows (TWs) of all customers are respected. Because the analysis is grounded on a real company, the results are expected to provide practical indications to logistics and supply chain managers, to maximize the performance of their delivery system

Work, labour and mobility: opening up a dialogue between fmobilities and political economy through mobile work

This paper demonstrates how mobilities perspectives might contribute to debates in political economy on labour and work, by interrogating mobility’s relation to work and labour. The paper makes four interventions. It offers (1) an overview of the literature on mobile work, working with mobilities concerns to develop a typology grounded in movement in geographical space. (2) It then examines how different types of mobile work are coordinated. Coordination is achieved by devices, some of which (timetables and algorithms) choreograph movement in space and time whilst others (e.g. signals, tachographs, apps) control, record and evaluate movement. Focusing on coordination devices allows for mobile labour to be differentiated from mobile work. In platform-mediated mobile work the governance of work through dashboards of mobility, and the consolidation and marketization of mobility data from mobile workers, turns mobile work to mobile labour, and the relation of labour and mobility from one of contingency to dependency. The paper further shows (3) how coordination devices shape the conditions of mobile work and the affective experience of working on-the-move in space and time. As a condition of more jobs is that they are done on-the-move, a consequence (4) is that labour activists recognise the conditions of mobility in employment

Two is better than one? Order aggregation in a meal delivery scheduling problem

We address a single-machine scheduling problem motivated by a last-mile-delivery setting for a food company. Customers place orders, each characterized by a delivery point (customer location) and an ideal delivery time. An order is considered on time if it is delivered to the customer within a time window given by the ideal delivery time , where is the same for all orders. A single courier (machine) is in charge of delivery to all customers. Orders are either delivered individually, or two orders can be aggregated in a single courier trip. All trips start and end at the restaurant, so no routing decisions are needed. The problem is to schedule courier trips so that the number of late orders is minimum. We show that the problem with order aggregation is -hard and propose a combinatorial branch and bound algorithm for its solution. The algorithm performance is assessed through a computational study on instances derived by a real-life application and on randomly generated instances. The behavior of the combinatorial algorithm is compared with that of the best ILP formulation known for the problem. Through another set of computational experiments, we also show that an appropriate choice of design parameters allows to apply the algorithm to a dynamic context, with orders arriving over time

From supply chains to demand networks. Agents in retailing: the electrical bazaar

A paradigm shift is taking place in logistics. The focus is changing from operational effectiveness to adaptation. Supply Chains will develop into networks that will adapt to consumer demand in almost real time. Time to market, capacity of adaptation and enrichment of customer experience seem to be the key elements of this new paradigm. In this environment emerging technologies like RFID (Radio Frequency ID), Intelligent Products and the Internet, are triggering a reconsideration of methods, procedures and goals. We present a Multiagent System framework specialized in retail that addresses these changes with the use of rational agents and takes advantages of the new market opportunities. Like in an old bazaar, agents able to learn, cooperate, take advantage of gossip and distinguish between collaborators and competitors, have the ability to adapt, learn and react to a changing environment better than any other structure. Keywords: Supply Chains, Distributed Artificial Intelligence, Multiagent System.Postprint (published version

Delivery service order policy with the sharing economy concept using a discrete event simulation system

People's lifestyle, especially in shopping, has shifted from offline shopping, such as in supermarkets, traditional markets, stalls, and so on, to online shopping. Therefore, online business (e-commerce) has increased, resulting in a surge in the business potential of freight forwarder companies. When there is an increase in demand for the delivery of goods by sellers to consumers, companies need to make adjustments to improve their performance. This paper proposed the sequence of goods delivery services for XYZ companies by considering dynamic requests and conditions that vary discretely over time. This paper is based on a case company in Bandung, Indonesia. The method employed queuing models and discrete event simulations using hypothetical data with performance criteria to minimize the total cost of shipping goods. Simulations are carried out using one courier and one zone to compare customer service determination algorithms, namely first-come, first-served, proximity, and predictive control models. The simulation results show that the proximity algorithm produces a minimum total cost of Rp 1,785,749, the smallest cost compared to using first-come, first-served and predictive control models, respectively IDR  2,782,389, and IDR  2,639,291. Then, the Annova test was conducted, which provided information that one policy differed significantly from another, and a Turkey test was carried out, showing that the proximity algorithm produces better performance than other algorithms. The contribution of this paper is to present that the delivery service employed by the company provided a minimum total cost