599 research outputs found
Time Slot Management in Attended Home Delivery
Many e-tailers providing attended home delivery, especially e-grocers, offer narrow delivery time slots to ensure satisfactory customer service. The choice of delivery time slots has to balance marketing and operational considerations, which results in a complex planning problem. We study the problem of selecting the set of time slots to offer in each of the zip codes in a service region. The selection needs to facilitate cost-effective delivery routes, but also needs to ensure an acceptable level of service to the customer. We present two fully-automated approaches that are capable of producing high-quality delivery time slot offerings in a reasonable amount of time. Computational experiments reveal the value of these approaches and the impact of the environment on the underlying trade-offs.integer programming;vehicle routing;continuous approximation;e-grocery;home delivery;time slots
A planning board generator. Part I: Problem instances and types
A planning board is a planning tool that uses the Gantt chart as its main representation mechanism. A planning board generator aims at facilitating the development of planning boards; using a description of the problem type for which a planning board is to be developed and the desired representations and manipulations, the generator automatically creates a prototype of the planning board. In this paper we discuss our view of a planning board generator and introduce a method to describe problem instances and types
Demand Management Opportunities in E-fulfillment: What Internet Retailers Can Learn from Revenue Management
In this paper, we explain how Internet retailers can learn from proven revenue management concepts and use them to reduce costs and enhance service. We focus on attended deliveries as these provide the greatest opportunities and challenges. The key driver is service differentiation. Revenue management has shown that companies can do much better than a one-size-fits-all first-come-first-serve strategy when selling scarce capacity to a heterogeneous market. Internet retailers have strong levers at their disposal for actively steering demand, notably the offered delivery time windows and their associated prices. Unlike traditional revenue management, these demand management decisions affect both revenues and costs. This calls for a closer coordination of marketing and operations than current common practice.ketenbeheer;revenue management;home delivery;E-fulfillment;demand management;marketing-operations interface
Blur resolved OCT: full-range interferometric synthetic aperture microscopy through dispersion encoding
We present a computational method for full-range interferometric synthetic
aperture microscopy (ISAM) under dispersion encoding. With this, one can
effectively double the depth range of optical coherence tomography (OCT),
whilst dramatically enhancing the spatial resolution away from the focal plane.
To this end, we propose a model-based iterative reconstruction (MBIR) method,
where ISAM is directly considered in an optimization approach, and we make the
discovery that sparsity promoting regularization effectively recovers the
full-range signal. Within this work, we adopt an optimal nonuniform discrete
fast Fourier transform (NUFFT) implementation of ISAM, which is both fast and
numerically stable throughout iterations. We validate our method with several
complex samples, scanned with a commercial SD-OCT system with no hardware
modification. With this, we both demonstrate full-range ISAM imaging, and
significantly outperform combinations of existing methods.Comment: 17 pages, 7 figures. The images have been compressed for arxiv -
please follow DOI for full resolutio
A structural approach to kernels for ILPs: Treewidth and Total Unimodularity
Kernelization is a theoretical formalization of efficient preprocessing for
NP-hard problems. Empirically, preprocessing is highly successful in practice,
for example in state-of-the-art ILP-solvers like CPLEX. Motivated by this,
previous work studied the existence of kernelizations for ILP related problems,
e.g., for testing feasibility of Ax <= b. In contrast to the observed success
of CPLEX, however, the results were largely negative. Intuitively, practical
instances have far more useful structure than the worst-case instances used to
prove these lower bounds.
In the present paper, we study the effect that subsystems with (Gaifman graph
of) bounded treewidth or totally unimodularity have on the kernelizability of
the ILP feasibility problem. We show that, on the positive side, if these
subsystems have a small number of variables on which they interact with the
remaining instance, then we can efficiently replace them by smaller subsystems
of size polynomial in the domain without changing feasibility. Thus, if large
parts of an instance consist of such subsystems, then this yields a substantial
size reduction. We complement this by proving that relaxations to the
considered structures, e.g., larger boundaries of the subsystems, allow
worst-case lower bounds against kernelization. Thus, these relaxed structures
can be used to build instance families that cannot be efficiently reduced, by
any approach.Comment: Extended abstract in the Proceedings of the 23rd European Symposium
on Algorithms (ESA 2015
Spatial and temporal adaptations that accompany increasing catching performance during learning.
The authors studied changes in performance and kinematics during the acquisition of a 1-handed catch. Participants were 8 women who took an intensive 2-week training program during which they evolved from poor catchers to subexpert catchers. An increased temporal consistency, shift in spatial location of ball-hand contact away from the body, and higher peak velocity of the transport of the hand toward the ball accompanied their improvement in catching performance. Moreover, novice catchers first adjusted spatial characteristics of the catch to the task constraints and fine-tuned temporal features only later during learning. A principal components analysis on a large set of kinematic variables indicated that a successful catch depends on (a) forward displacement of the hand and (b) the dynamics of the hand closure, thereby providing a kinematic underpinning for the traditional transport-manipulation dissociation in the grasping and catching literature. Copyright © 2007 Heldref Publications
- âŠ