scholarly journals Floyd-A∗Algorithm Solving the Least-Time Itinerary Planning Problem in Urban Scheduled Public Transport Network

2014 ◽  
Vol 2014 ◽  
pp. 1-15
Author(s):  
Yu Zhang ◽  
Jiafu Tang ◽  
Shimeng Lv ◽  
Xinggang Luo
Keyword(s):  
Lower Bound ◽  
Real World ◽  
Public Transport ◽  
Ad Hoc ◽  
A Priori ◽  
Time Dependent ◽  
Initial Time ◽  
Planning Problem ◽  
A Algorithm ◽  
Shenyang City

We consider an ad hoc Floyd-A∗algorithm to determine the a priori least-time itinerary from an origin to a destination given an initial time in an urban scheduled public transport (USPT) network. The network is bimodal (i.e., USPT lines and walking) and time dependent. The modified USPT network model results in more reasonable itinerary results. An itinerary is connected through a sequence of time-label arcs. The proposed Floyd-A∗algorithm is composed of two procedures designated as Itinerary Finder and Cost Estimator. The A∗-based Itinerary Finder determines the time-dependent, least-time itinerary in real time, aided by the heuristic information precomputed by the Floyd-based Cost Estimator, where a strategy is formed to preestimate the time-dependent arc travel time as an associated static lower bound. The Floyd-A∗algorithm is proven to guarantee optimality in theory and, demonstrated through a real-world example in Shenyang City USPT network to be more efficient than previous procedures. The computational experiments also reveal the time-dependent nature of the least-time itinerary. In the premise that lines run punctually, “just boarding” and “just missing” cases are identified.

scholarly journals Ad Hoc Teamwork With Behavior Switching Agents

2019 ◽  
Author(s):  
Manish Ravula ◽  
Shani Alkoby ◽  
Peter Stone
Keyword(s):  
Neural Network ◽  
Real World ◽  
Change Point ◽  
Ad Hoc ◽  
Change Point Detection ◽  
Planning Problem ◽  
Predator Prey ◽  
Strong Assumption ◽  
New Type ◽  
Point Detection

As autonomous AI agents proliferate in the real world, they will increasingly need to cooperate with each other to achieve complex goals without always being able to coordinate in advance. This kind of cooperation, in which agents have to learn to cooperate on the fly, is called ad hoc teamwork. Many previous works investigating this setting assumed that teammates behave according to one of many predefined types that is fixed throughout the task. This assumption of stationarity in behaviors, is a strong assumption which cannot be guaranteed in many real-world settings. In this work, we relax this assumption and investigate settings in which teammates can change their types during the course of the task. This adds complexity to the planning problem as now an agent needs to recognize that a change has occurred in addition to figuring out what is the new type of the teammate it is interacting with. In this paper, we present a novel Convolutional-Neural-Network-based Change point Detection (CPD) algorithm for ad hoc teamwork. When evaluating our algorithm on the modified predator prey domain, we find that it outperforms existing Bayesian CPD algorithms.

scholarly journals A Sampling Approach for Proactive Project Scheduling under Generalized Time-dependent Workability Uncertainty

2019 ◽  
Vol 64 ◽  
pp. 385-427 ◽  
Author(s):  
Wen Song ◽  
Donghun Kang ◽  
Jie Zhang ◽  
Zhiguang Cao ◽  
Hui Xi
Keyword(s):  
Stochastic Optimization ◽  
Real World ◽  
Project Scheduling ◽  
Optimization Model ◽  
A Priori ◽  
Empirical Evaluation ◽  
Sample Average Approximation ◽  
Time Dependent ◽  
Start Time ◽  
Duration Uncertainty

In real-world project scheduling applications, activity durations are often uncertain. Proactive scheduling can effectively cope with the duration uncertainties, by generating robust baseline solutions according to a priori stochastic knowledge. However, most of the existing proactive approaches assume that the duration uncertainty of an activity is not related to its scheduled start time, which may not hold in many real-world scenarios. In this paper, we relax this assumption by allowing the duration uncertainty to be time-dependent, which is caused by the uncertainty of whether the activity can be executed on each time slot. We propose a stochastic optimization model to find an optimal Partial-order Schedule (POS) that minimizes the expected makespan. This model can cover both the time-dependent uncertainty studied in this paper and the traditional time-independent duration uncertainty. To circumvent the underlying complexity in evaluating a given solution, we approximate the stochastic optimization model based on Sample Average Approximation (SAA). Finally, we design two efficient branch-and-bound algorithms to solve the NP-hard SAA problem. Empirical evaluation confirms that our approach can generate high-quality proactive solutions for a variety of uncertainty distributions.

PP469 From Theory To Practice: Which Value Framework Is Applied For Onco-Hematology Therapies In Italy? A 5-year Retrospective Analysis

2020 ◽  
Vol 36 (S1) ◽  
pp. 37-37
Author(s):  
Americo Cicchetti ◽  
Rossella Di Bidino ◽  
Entela Xoxi ◽  
Irene Luccarini ◽  
Alessia Brigido
Keyword(s):  
Real World ◽  
Ad Hoc ◽  
Grey Literature ◽  
National Level ◽  
Pharmaceutical Products ◽  
European Medicines Agency ◽  
The Real ◽  
R Process ◽  
The One ◽  
The Impact

IntroductionDifferent value frameworks (VFs) have been proposed in order to translate available evidence on risk-benefit profiles of new treatments into Pricing & Reimbursement (P&R) decisions. However limited evidence is available on the impact of their implementation. It's relevant to distinguish among VFs proposed by scientific societies and providers, which usually are applicable to all treatments, and VFs elaborated by regulatory agencies and health technology assessment (HTA), which focused on specific therapeutic areas. Such heterogeneity in VFs has significant implications in terms of value dimension considered and criteria adopted to define or support a price decision.MethodsA literature research was conducted to identify already proposed or adopted VF for onco-hematology treatments. Both scientific and grey literature were investigated. Then, an ad hoc data collection was conducted for multiple myeloma; breast, prostate and urothelial cancer; and Non Small Cell Lung Cancer (NSCLC) therapies. Pharmaceutical products authorized by European Medicines Agency from January 2014 till December 2019 were identified. Primary sources of data were European Public Assessment Reports and P&R decision taken by the Italian Medicines Agency (AIFA) till September 2019.ResultsThe analysis allowed to define a taxonomy to distinguish categories of VF relevant to onco-hematological treatments. We identified the “real-world” VF that emerged given past P&R decisions taken at the Italian level. Data was collected both for clinical and economical outcomes/indicators, as well as decisions taken on innovativeness of therapies. Relevant differences emerge between the real world value framework and the one that should be applied given the normative framework of the Italian Health System.ConclusionsThe value framework that emerged from the analysis addressed issues of specific aspects of onco-hematological treatments which emerged during an ad hoc analysis conducted on treatment authorized in the last 5 years. The perspective adopted to elaborate the VF was the one of an HTA agency responsible for P&R decisions at a national level. Furthermore, comparing a real-world value framework with the one based on the general criteria defined by the national legislation, our analysis allowed identification of the most critical point of the current national P&R process in terms ofsustainability of current and future therapies as advance therapies and agnostic-tumor therapies.

scholarly journals A Lower Bound for the Query Phase of Contraction Hierarchies and Hub Labels and a Provably Optimal Instance-Based Schema

Algorithms ◽  
2021 ◽  
Vol 14 (6) ◽  
pp. 164
Author(s):  
Tobias Rupp ◽  
Stefan Funke
Keyword(s):  
Lower Bound ◽  
Lower Bounds ◽  
Real World ◽  
Road Network ◽  
Upper And Lower Bounds ◽  
Bounded Degree ◽  
Shortest Path Routing ◽  
Graph Classes ◽  
Speed Up ◽  
To Come

We prove a Ω(n) lower bound on the query time for contraction hierarchies (CH) as well as hub labels, two popular speed-up techniques for shortest path routing. Our construction is based on a graph family not too far from subgraphs that occur in real-world road networks, in particular, it is planar and has a bounded degree. Additionally, we borrow ideas from our lower bound proof to come up with instance-based lower bounds for concrete road network instances of moderate size, reaching up to 96% of an upper bound given by a constructed CH. For a variant of our instance-based schema applied to some special graph classes, we can even show matching upper and lower bounds.

scholarly journals Inverse problem for fractional diffusion equation

2011 ◽  
Vol 14 (1) ◽  
Author(s):  
Vu Tuan
Keyword(s):  
Inverse Problem ◽  
Diffusion Coefficient ◽  
Lower Bound ◽  
Diffusion Equation ◽  
Spectral Data ◽  
A Priori ◽  
Fractional Diffusion ◽  
Fractional Diffusion Equation ◽  
One Dimensional ◽  
Initial Distributions

AbstractWe prove that by taking suitable initial distributions only finitely many measurements on the boundary are required to recover uniquely the diffusion coefficient of a one dimensional fractional diffusion equation. If a lower bound on the diffusion coefficient is known a priori then even only two measurements are sufficient. The technique is based on possibility of extracting the full boundary spectral data from special lateral measurements.

scholarly journals Revisiting the CompCars Dataset for Hierarchical Car Classification: New Annotations, Experiments, and Results

Sensors ◽  
2021 ◽  
Vol 21 (2) ◽  
pp. 596
Author(s):  
Marco Buzzelli ◽  
Luca Segantin
Keyword(s):  
Real World ◽  
High Performance ◽  
Ad Hoc ◽  
Future Research ◽  
Levels Of Detail ◽  
Excellent Starting Point ◽  
Starting Point ◽  
Hierarchical Nature ◽  
Multiple Levels ◽  
Entire Dataset

We address the task of classifying car images at multiple levels of detail, ranging from the top-level car type, down to the specific car make, model, and year. We analyze existing datasets for car classification, and identify the CompCars as an excellent starting point for our task. We show that convolutional neural networks achieve an accuracy above 90% on the finest-level classification task. This high performance, however, is scarcely representative of real-world situations, as it is evaluated on a biased training/test split. In this work, we revisit the CompCars dataset by first defining a new training/test split, which better represents real-world scenarios by setting a more realistic baseline at 61% accuracy on the new test set. We also propagate the existing (but limited) type-level annotation to the entire dataset, and we finally provide a car-tight bounding box for each image, automatically defined through an ad hoc car detector. To evaluate this revisited dataset, we design and implement three different approaches to car classification, two of which exploit the hierarchical nature of car annotations. Our experiments show that higher-level classification in terms of car type positively impacts classification at a finer grain, now reaching 70% accuracy. The achieved performance constitutes a baseline benchmark for future research, and our enriched set of annotations is made available for public download.

Performance Approximation for Time-Dependent Queues with Generally Distributed Abandonments

2021 ◽  
Author(s):  
Gregor Selinka ◽  
Raik Stolletz ◽  
Thomas I. Maindl
Keyword(s):  
Performance Measures ◽  
Real World ◽  
Queueing System ◽  
Time Dependent ◽  
Interval Length ◽  
Arrival Process ◽  
Real World Data ◽  
World Data ◽  
Extant Literature ◽  
Approximation Quality

Many stochastic systems face a time-dependent demand. Especially in stochastic service systems, for example, in call centers, customers may leave the queue if their waiting time exceeds their personal patience. As discussed in the extant literature, it can be useful to use general distributions to model such customer patience. This paper analyzes the time-dependent performance of a multiserver queue with a nonhomogeneous Poisson arrival process with a time-dependent arrival rate, exponentially distributed processing times, and generally distributed time to abandon. Fast and accurate performance approximations are essential for decision support in such queueing systems, but the extant literature lacks appropriate methods for the setting we consider. To approximate time-dependent performance measures for small- and medium-sized systems, we develop a new stationary backlog-carryover (SBC) approach that allows for the analysis of underloaded and overloaded systems. Abandonments are considered in two steps of the algorithm: (i) in the approximation of the utilization as a reduced arrival stream and (ii) in the approximation of waiting-based performance measures with a stationary model for general abandonments. To improve the approximation quality, we discuss an adjustment to the interval lengths. We present a limit result that indicates convergence of the method for stationary parameters. The numerical study compares the approximation quality of different adjustments to the interval length. The new SBC approach is effective for instances with small numbers of time-dependent servers and gamma-distributed abandonment times with different coefficients of variation and for an empirical distribution of the abandonment times from real-world data obtained from a call center. A discrete-event simulation benchmark confirms that the SBC algorithm approximates the performance of the queueing system with abandonments very well for different parameter configurations. Summary of Contribution: The paper presents a fast and accurate numerical method to approximate the performance measures of a time‐dependent queueing system with generally distributed abandonments. The presented stationary backlog carryover approach with abandonment combines algorithmic ideas with stationary queueing models for generally distributed abandonment times. The reliability of the method is analyzed for transient systems and numerically studied with real‐world data.

Time-Dependent Intermodal A* Algorithm: Methodology and Implementation on a Large-Scale Network

2018 ◽  
Vol 2672 (47) ◽  
pp. 219-230 ◽  
Author(s):  
Ömer Verbas ◽  
Joshua Auld ◽  
Hubert Ley ◽  
Randy Weimer ◽  
Shon Driscoll
Keyword(s):  
Large Scale ◽  
Vehicular Network ◽  
Upper Bounds ◽  
Time Dependent ◽  
Regional Network ◽  
A Algorithm ◽  
Transit Network ◽  
Park And Ride ◽  
Large Scale Network ◽  
Scale Network

This paper proposes a time-dependent intermodal A* (TDIMA*) algorithm. The algorithm works on a multimodal network with transit, walking, and vehicular network links, and finds paths for the three major modes (transit, walking, driving) and any feasible combination thereof (e.g., park-and-ride). Turn penalties on the vehicular network and progressive transfer penalties on the transit network are considered for improved realism. Moreover, upper bounds to prevent excessive waiting and walking are introduced, as well as an upper bound on driving for the park-and-ride (PNR) mode. The algorithm is validated on the large-scale Chicago Regional network using real-world trips against the Google Directions API and the Regional Transit Authority router.

Sign in / Sign up

Export Citation Format

Share Document