اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMetro stations as crowd-shipping catalysts: an empirical and computational study
146
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Crowd-shipping is a promising shared mobility service that involves the delivery of goods using non-professional shippers. This service is mainly intended to reduce congestion and pollution in city centers but, as some authors observe, in most crowd-shipping initiatives the crowd rely on private motorized vehicles and hence the environmental benefits could be small, if not negative. Conversely, a crowd-shipping service relying on public transport should maximize the environmental benefits. Motivated by this observation, in this study we assess the potentials of crowd-shipping based on metro commuters in the city of Brescia, Italy. Our contribution is twofold. First, we analyze the results of a survey conducted among metro users to assess their willingness to act as crowd-shippers. The main result is that most young commuters and retirees are willing to be crowd-shippers even for a null reward. Second, we assess the potential economic impact of using metro-based crowd-shipping coupled with a traditional home delivery service. To this end, we formulate a variant of the VRP model where the customers closest to the metro stations may be served either by a conventional vehicle or by a crowd-shipper. The model is implemented using Python with Gurobi solver. A computational study based on the Brescia case is performed to get insights on the economic advantages that a metro-based crowd delivery option may have for a retailing company.
قيم البحث
اقرأ أيضاً
The input space of a neural network with ReLU-like activations is partitioned into multiple linear regions, each corresponding to a specific activation pattern of the included ReLU-like activations. We demonstrate that this partition exhibits the fol
lowing encoding properties across a variety of deep learning models: (1) {it determinism}: almost every linear region contains at most one training example. We can therefore represent almost every training example by a unique activation pattern, which is parameterized by a {it neural code}; and (2) {it categorization}: according to the neural code, simple algorithms, such as $K$-Means, $K$-NN, and logistic regression, can achieve fairly good performance on both training and test data. These encoding properties surprisingly suggest that {it normal neural networks well-trained for classification behave as hash encoders without any extra efforts.} In addition, the encoding properties exhibit variability in different scenarios. {Further experiments demonstrate that {it model size}, {it training time}, {it training sample size}, {it regularization}, and {it label noise} contribute in shaping the encoding properties, while the impacts of the first three are dominant.} We then define an {it activation hash phase chart} to represent the space expanded by {model size}, training time, training sample size, and the encoding properties, which is divided into three canonical regions: {it under-expressive regime}, {it critically-expressive regime}, and {it sufficiently-expressive regime}. The source code package is available at url{https://github.com/LeavesLei/activation-code}.
The benefits of cutting planes based on the perspective function are well known for many specific classes of mixed-integer nonlinear programs with on/off structures. However, we are not aware of any empirical studies that evaluate their applicability
and computational impact over large, heterogeneous test sets in general-purpose solvers. This paper provides a detailed computational study of perspective cuts within a linear programming based branch-and-cut solver for general mixed-integer nonlinear programs. Within this study, we extend the applicability of perspective cuts from convex to nonconvex nonlinearities. This generalization is achieved by applying a perspective strengthening to valid linear inequalities which separate solutions of linear relaxations. The resulting method can be applied to any constraint where all variables appearing in nonlinear terms are semi-continuous and depend on at least one common indicator variable. Our computational experiments show that adding perspective cuts for convex constraints yields a consistent improvement of performance, and adding perspective cuts for nonconvex constraints reduces branch-and-bound tree sizes and strengthens the root node relaxation, but has no significant impact on the overall mean time.
The objective of this study is to understand how senders choose shipping services for different products, given the availability of both emerging crowd-shipping (CS) and traditional carriers in a logistics market. Using data collected from a US surve
y, Random Utility Maximization (RUM) and Random Regret Minimization (RRM) models have been employed to reveal factors that influence the diversity of decisions made by senders. Shipping costs, along with additional real-time services such as courier reputations, tracking info, e-notifications, and customized delivery time and location, have been found to have remarkable impacts on senders choices. Interestingly, potential senders were willing to pay more to ship grocery items such as food, beverages, and medicines by CS services. Moreover, the real-time services have low elasticities, meaning that only a slight change in those services will lead to a change in sender-behavior. Finally, data-science techniques were used to assess the performance of the RUM and RRM models and found to have similar accuracies. The findings from this research will help logistics firms address potential market segments, prepare service configurations to fulfill senders expectations, and develop effective business operations strategies.
We propose MetroSets, a new, flexible online tool for visualizing set systems using the metro map metaphor. We model a given set system as a hypergraph $mathcal{H} = (V, mathcal{S})$, consisting of a set $V$ of vertices and a set $mathcal{S}$, which
contains subsets of $V$ called hyperedges. Our system then computes a metro map representation of $mathcal{H}$, where each hyperedge $E$ in $mathcal{S}$ corresponds to a metro line and each vertex corresponds to a metro station. Vertices that appear in two or more hyperedges are drawn as interchanges in the metro map, connecting the different sets. MetroSets is based on a modular 4-step pipeline which constructs and optimizes a path-based hypergraph support, which is then drawn and schematized using metro map layout algorithms. We propose and implement multiple algorithms for each step of the MetroSet pipeline and provide a functional prototype with easy-to-use preset configurations. Furthermore, using several real-world datasets, we perform an extensive quantitative evaluation of the impact of different pipeline stages on desirable properties of the generated maps, such as octolinearity, monotonicity, and edge uniformity.
GraphQL is a query language for APIs and a runtime to execute queries. Using GraphQL queries, clients define precisely what data they wish to retrieve or mutate on a server, leading to fewer round trips and reduced response sizes. Although interest i
n GraphQL is on the rise, with increasing adoption at major organizations, little is known about what GraphQL interfaces look like in practice. This lack of knowledge makes it hard for providers to understand what practices promote idiomatic, easy-to-use APIs, and what pitfalls to avoid. To address this gap, we study the design of GraphQL interfaces in practice by analyzing their schemas - the descriptions of their exposed data types and the possible operations on the underlying data. We base our study on two novel corpuses of GraphQL schemas, one of 16 commercial GraphQL schemas and the other of 8,399 GraphQL schemas mined from GitHub projects. We make both corpuses available to other researchers. Using these corpuses, we characterize the size of schemas and their use of GraphQL features and assess the use of both prescribed and organic naming conventions. We also report that a majority of APIs are susceptible to denial of service through complex queries, posing real security risks previously discussed only in theory. We also assess ways in which GraphQL APIs attempt to address these concerns.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
