scholarly journals Crowd-shipping problem with time windows, transshipment nodes, and delivery options

2022 ◽  
Vol 157 ◽  
pp. 102545
Author(s):  
Vincent F. Yu ◽  
Panca Jodiawan ◽  
A.A.N. Perwira Redi
Keyword(s):  
Time Windows ◽  
Delivery Options

scholarly journals The last-mile vehicle routing problem with delivery options

OR Spectrum ◽  
2021 ◽  
Author(s):  
Christian Tilk ◽  
Katharina Olkis ◽  
Stefan Irnich
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Resource Constraints ◽  
Time Window ◽  
Time Windows ◽  
Service Level ◽  
Optimal Solutions ◽  
Routing Problem ◽  
Common Location ◽  
Delivery Options

AbstractThe ongoing rise in e-commerce comes along with an increasing number of first-time delivery failures due to the absence of the customer at the delivery location. Failed deliveries result in rework which in turn has a large impact on the carriers’ delivery cost. In the classical vehicle routing problem (VRP) with time windows, each customer request has only one location and one time window describing where and when shipments need to be delivered. In contrast, we introduce and analyze the vehicle routing problem with delivery options (VRPDO), in which some requests can be shipped to alternative locations with possibly different time windows. Furthermore, customers may prefer some delivery options. The carrier must then select, for each request, one delivery option such that the carriers’ overall cost is minimized and a given service level regarding customer preferences is achieved. Moreover, when delivery options share a common location, e.g., a locker, capacities must be respected when assigning shipments. To solve the VRPDO exactly, we present a new branch-price-and-cut algorithm. The associated pricing subproblem is a shortest-path problem with resource constraints that we solve with a bidirectional labeling algorithm on an auxiliary network. We focus on the comparison of two alternative modeling approaches for the auxiliary network and present optimal solutions for instances with up to 100 delivery options. Moreover, we provide 17 new optimal solutions for the benchmark set for the VRP with roaming delivery locations.

Print, Other Delivery Options for ASHA Journals

ASHA Leader ◽  
2011 ◽  
Vol 16 (4) ◽  
pp. 33-33
Author(s):  
Mike Cannon
Keyword(s):  
Delivery Options

Project Scheduling with Time Windows and Scarce Resources

2002 ◽  
Author(s):  
Klaus Neumann ◽  
Christoph Schwindt ◽  
Jürgen Zimmermann
Keyword(s):  
Project Scheduling ◽  
Time Windows ◽  
Scarce Resources

Tourism Route Planning Route Based on Tourist Category using Orientee ring Problem with Time Windows

2019 ◽  
Vol 1 (1) ◽  
pp. 42-49
Author(s):  
Indri Hapsari ◽  
◽  
Hazrul Is wadi ◽  
Yosvaldo Ongko Cahyadi ◽  
◽  
...  
Keyword(s):  
Time Windows ◽  
Route Planning ◽  
Ring Problem

Recent advances on urban taxi sharing systems with the path arrival probability

2020 ◽  
Vol 13 ◽  
Author(s):  
Dui Hongyan ◽  
Zhang Chi
Keyword(s):  
Failure Probability ◽  
Traffic Congestion ◽  
Optimal Strategy ◽  
Time Windows ◽  
Optimal Path ◽  
Route Planning ◽  
Driving Time ◽  
Load Rate ◽  
Travel Efficiency ◽  
Arrival Probability

Background : Taxi sharing is an emerging transportation arrangement that helps improve the passengers’ travel efficiency and reduce costs. This study proposes an urban taxi sharing system. Methods: Considering each side congestion of the transport network, their corresponding reliability and failure probability are analyzed. Under the constraints of the number of passengers and their own time windows, the analysis is performed on passengers whose optimal path is inclusive. Results: According to the optimal strategy, the different passengers can be arranged into the same taxi to realize the taxi sharing. Then the shared taxi route can be optimized. Conclusion: Due to the reasonable vehicle route planning and passenger combination, these can effectively alleviate the traffic congestion, save the driving time, reduce the taxi no-load rate, and save the driving distance. At last, a numerical example is used to demonstrate the proposed method.

scholarly journals Reply to “Comment on ‘The Impact of Recent Forcing and Ocean Heat Uptake Data on Estimates of Climate Sensitivity’”

2020 ◽  
Vol 33 (1) ◽  
pp. 397-404 ◽  
Author(s):  
Nicholas Lewis ◽  
Judith Curry
Keyword(s):  
Time Windows ◽  
Internal Variability ◽  
Historical Record ◽  
Cmip5 Models ◽  
Temperature Record ◽  
Ocean Heat Uptake ◽  
Transient Climate Response ◽  
Total Uncertainty ◽  
The Impact ◽  
The Relationship

AbstractCowtan and Jacobs assert that the method used by Lewis and Curry in 2018 (LC18) to estimate the climate system’s transient climate response (TCR) from changes between two time windows is less robust—in particular against sea surface temperature bias correction uncertainty—than a method that uses the entire historical record. We demonstrate that TCR estimated using all data from the temperature record is closely in line with that estimated using the LC18 windows, as is the median TCR estimate using all pairs of individual years. We also show that the median TCR estimate from all pairs of decade-plus-length windows is closely in line with that estimated using the LC18 windows and that incorporating window selection uncertainty would make little difference to total uncertainty in TCR estimation. We find that, when differences in the evolution of forcing are accounted for, the relationship over time between warming in CMIP5 models and observations is consistent with the relationship between CMIP5 TCR and LC18’s TCR estimate but fluctuates as a result of multidecadal internal variability and volcanism. We also show that various other matters raised by Cowtan and Jacobs have negligible implications for TCR estimation in LC18.

scholarly journals Spatiotemporal tracing of pandemic spread from infection data

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Satyaki Roy ◽  
Preetom Biswas ◽  
Preetam Ghosh
Keyword(s):  
New York ◽  
Network Inference ◽  
Spatial Interaction ◽  
Time Windows ◽  
New York State ◽  
Mitigation Measures ◽  
Contact Tracing ◽  
Long Distance ◽  
Spatiotemporal Models ◽  
Spread Of Infection

AbstractCOVID-19, a global pandemic caused by the Severe Acute Respiratory Syndrome Coronavirus 2 virus, has claimed millions of lives worldwide. Amid soaring contagion due to newer strains of the virus, it is imperative to design dynamic, spatiotemporal models to contain the spread of infection during future outbreaks of the same or variants of the virus. The reliance on existing prediction and contact tracing approaches on prior knowledge of inter- or intra-zone mobility renders them impracticable. We present a spatiotemporal approach that employs a network inference approach with sliding time windows solely on the date and number of daily infection numbers of zones within a geographical region to generate temporal networks capturing the influence of each zone on another. It helps analyze the spatial interaction among the hotspot or spreader zones and highly affected zones based on the flow of network contagion traffic. We apply the proposed approach to the daily infection counts of New York State as well as the states of USA to show that it effectively measures the phase shifts in the pandemic timeline. It identifies the spreaders and affected zones at different time points and helps infer the trajectory of the pandemic spread across the country. A small set of zones periodically exhibit a very high outflow of contagion traffic over time, suggesting that they act as the key spreaders of infection. Moreover, the strong influence between the majority of non-neighbor regions suggests that the overall spread of infection is a result of the unavoidable long-distance trips by a large number of people as opposed to the shorter trips at a county level, thereby informing future mitigation measures and public policies.

Transshipment through crossdocks with inventory and time windows

2005 ◽  
Vol 52 (8) ◽  
pp. 724-733 ◽  
Author(s):  
Andrew Lim ◽  
Zhaowei Miao ◽  
Brian Rodrigues ◽  
Zhou Xu
Keyword(s):  
Time Windows
Sign in / Sign up

Export Citation Format

Share Document