Open Access. Powered by Scholars. Published by Universities.®

Theory and Algorithms Commons™

Open Access. Powered by Scholars. Published by Universities.®

Public Affairs, Public Policy and Public Administration

Institution
Keyword
Publication Year
Publication
Publication Type

Articles 31 - 52 of 52

Full-Text Articles in Theory and Algorithms

Urban Perception: Sensing Cities Via A Deep Interactive Multi-Task Learning Framework, Weili Guan, Zhaozheng Chen, Fuli Feng, Weifeng Liu, Liqiang Nie Apr 2021

Urban Perception: Sensing Cities Via A Deep Interactive Multi-Task Learning Framework, Weili Guan, Zhaozheng Chen, Fuli Feng, Weifeng Liu, Liqiang Nie

Research Collection School Of Computing and Information Systems

Social scientists have shown evidence that visual perceptions of urban attributes, such as safe, wealthy, and beautiful perspectives of the given cities, are highly correlated to the residents' behaviors and quality of life. Despite their significance, measuring visual perceptions of urban attributes is challenging due to the following facts: (1) Visual perceptions are subjectively contradistinctive rather than absolute. (2) Perception comparisons between image pairs are usually conducted region by region, and highly related to the specific urban attributes. And (3) the urban attributes have both the shared and specific information. To address these problems, in this article, we present a …


Mimoa: A Membrane-Inspired Multi-Objective Algorithm For Green Vehicle Routing Problem With Stochastic Demands, Yunyun Niu, Yongpeng Zhang, Zhiguang Cao, Kaizhou Gao, Jianhua Xiao, Wen Song, Fangwei Zhang Feb 2021

Mimoa: A Membrane-Inspired Multi-Objective Algorithm For Green Vehicle Routing Problem With Stochastic Demands, Yunyun Niu, Yongpeng Zhang, Zhiguang Cao, Kaizhou Gao, Jianhua Xiao, Wen Song, Fangwei Zhang

Research Collection School Of Computing and Information Systems

Nowadays, an increasing number of vehicle routing problem with stochastic demands (VRPSD) models have been studied to meet realistic needs in the field of logistics. In this paper, a bi-objective vehicle routing problem with stochastic demands (BO-VRPSD) was investigated, which aims to minimize total cost and customer dissatisfaction. Different from traditional vehicle routing problem (VRP) models, both the uncertainty in customer demands and the nature of multiple objectives make the problem more challenging. To cope with BO-VRPSD, a membrane-inspired multi-objective algorithm (MIMOA) was proposed, which is characterized by a parallel distributed framework with two operation subsystems and one control subsystem, …


Systematizing Confidence In Open Research And Evidence (Score), Nazanin Alipourfard, Beatrix Arendt, Daniel M. Benjamin, Noam Benkler, Michael Bishop, Mark Burstein, Martin Bush, James Caverlee, Yiling Chen, Chae Clark, Anna Dreber Almenberg, Timothy M. Errington, Fiona Fidler, Nicholas Fox, Aaron Frank, Hannah Fraser, Scott Friedman, Ben Gelman, James Gentile, Jian Wu, Et Al., Score Collaboration Jan 2021

Systematizing Confidence In Open Research And Evidence (Score), Nazanin Alipourfard, Beatrix Arendt, Daniel M. Benjamin, Noam Benkler, Michael Bishop, Mark Burstein, Martin Bush, James Caverlee, Yiling Chen, Chae Clark, Anna Dreber Almenberg, Timothy M. Errington, Fiona Fidler, Nicholas Fox, Aaron Frank, Hannah Fraser, Scott Friedman, Ben Gelman, James Gentile, Jian Wu, Et Al., Score Collaboration

Computer Science Faculty Publications

Assessing the credibility of research claims is a central, continuous, and laborious part of the scientific process. Credibility assessment strategies range from expert judgment to aggregating existing evidence to systematic replication efforts. Such assessments can require substantial time and effort. Research progress could be accelerated if there were rapid, scalable, accurate credibility indicators to guide attention and resource allocation for further assessment. The SCORE program is creating and validating algorithms to provide confidence scores for research claims at scale. To investigate the viability of scalable tools, teams are creating: a database of claims from papers in the social and behavioral …


A Genetic Algorithm To Minimise Number Of Vehicles In An Electric Vehicle Routing Problem, Kiian Leong Bertran Queck, Hoong Chuin Lau Sep 2020

A Genetic Algorithm To Minimise Number Of Vehicles In An Electric Vehicle Routing Problem, Kiian Leong Bertran Queck, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

Electric Vehicles (EVs) and charging infrastructure are starting to become commonplace in major cities around the world. For logistics providers to adopt an EV fleet, there are many factors up for consideration, such as route planning for EVs with limited travel range as well as long-term planning of fleet size. In this paper, we present a genetic algorithm to perform route planning that minimises the number of vehicles required. Specifically, we discuss the challenges on the violations of constraints in the EV routing problem (EVRP) arising from applying genetic algorithm operators. To overcome the challenges, techniques specific to addressing the …


The Prediction Of Delay Time At Intersection And Route Planning For Autonomous Vehicles, Genwang Gou, Yongxin Zhao, Jiawei Liang, Ling Shi Jul 2020

The Prediction Of Delay Time At Intersection And Route Planning For Autonomous Vehicles, Genwang Gou, Yongxin Zhao, Jiawei Liang, Ling Shi

Research Collection School Of Computing and Information Systems

Intelligent Intersections (roundabout and crossroads) management is considered as one of the challenges to significantly improve urban traffic efficiency. Recent researches in artificial intelligence suggest that autonomous vehicles have the possibility of forming intelligent intersection management, and likely to occupy the leading role in future urban traffic. If route planning method can be used for route decision of autonomous vehicle, the urban traffic efficiency can be further improved. In this paper, we propose an Intelligent Intersection Control Protocol (IICP) for controlling autonomous vehicles cross intersection, and recommend route for autonomous vehicles to reduce travel time and improve urban traffic efficiency. …


Algorithms Of Oppression [Uno Pa Theory Proseminar Presentation], Sue Ann Gardner Feb 2020

Algorithms Of Oppression [Uno Pa Theory Proseminar Presentation], Sue Ann Gardner

University of Nebraska-Lincoln Libraries: Presentations

Slides of two classes taught in the Theory Proseminar in the School of Public Administration at the University of Nebraska at Omaha by Sue Ann Gardner on February 11 and 18, 2020.

Connects information theory to applicable knowledge frameworks in public administration. Includes an in-depth discussion of the concepts addressed in Samiya Umoja Noble's book Algorithms of Oppression (published by New York University Press, New York, New York, United States, 2018) in the context of public administration and public academic libraries.


Disaster Damage Categorization Applying Satellite Images And Machine Learning Algorithm, Farinaz Sabz Ali Pour, Adrian Gheorghe Jan 2020

Disaster Damage Categorization Applying Satellite Images And Machine Learning Algorithm, Farinaz Sabz Ali Pour, Adrian Gheorghe

Engineering Management & Systems Engineering Faculty Publications

Special information has a significant role in disaster management. Land cover mapping can detect short- and long-term changes and monitor the vulnerable habitats. It is an effective evaluation to be included in the disaster management system to protect the conservation areas. The critical visual and statistical information presented to the decision-makers can help in mitigation or adaption before crossing a threshold. This paper aims to contribute in the academic and the practice aspects by offering a potential solution to enhance the disaster data source effectiveness. The key research question that the authors try to answer in this paper is how …


Developing Algorithms To Detect Incidents On Freeways From Loop Detector And Vehicle Re-Identification Data, Biraj Adhikari Jul 2019

Developing Algorithms To Detect Incidents On Freeways From Loop Detector And Vehicle Re-Identification Data, Biraj Adhikari

Civil & Environmental Engineering Theses & Dissertations

A new approach for testing incident detection algorithms has been developed and is presented in this thesis. Two new algorithms were developed and tested taking California #7, which is the most widely used algorithm to date, and SVM (Support Vector Machine), which is considered one of the best performing classifiers, as the baseline for comparisons. Algorithm #B in this study uses data from Vehicle Re-Identification whereas the other three algorithms (California #7, SVM and Algorithm #A) use data from a double loop detector for detection of an incident. A microscopic traffic simulator is used for modeling three types of incident …


Volumetric Optimization Of Freight Cargo Loading: Case Study Of A Smu Forwarder, Tristan Lim, Michael Ser Chong Ping, Mark Goh, Shi Ying Jacelyn Tan Jul 2019

Volumetric Optimization Of Freight Cargo Loading: Case Study Of A Smu Forwarder, Tristan Lim, Michael Ser Chong Ping, Mark Goh, Shi Ying Jacelyn Tan

Research Collection School Of Computing and Information Systems

Purpose: Freight forwarders faces a challenging environment of high market volatility and margin compression risks. Hence, strategic consideration is given to undertaking capacity management and transport asset ownership to achieve longer term cost leadership. Doing so will also help to address management issues, such as better control of potential transport disruptions, improve scheduling flexibility and efficiency, and provide service level enhancement.Design/methodology/approach: The case company currently hastruck resource which is unprofitable, and the firm’s schedulers are having difficulty optimizing the loading capacity. We apply Genetic Algorithm (GA) to undertake volumetric optimization of truckcapacity and to build an easy-to-use platform to help …


Transferring Time-Series Discrete Choice To Link-Based Route Choice In Space: Estimating Vehicle Type Preference Using Recursive Logit Model, Fabian Bastin, Yan Liu, Cinzia Cirillo, Tien Mai Sep 2018

Transferring Time-Series Discrete Choice To Link-Based Route Choice In Space: Estimating Vehicle Type Preference Using Recursive Logit Model, Fabian Bastin, Yan Liu, Cinzia Cirillo, Tien Mai

Research Collection School Of Computing and Information Systems

This paper considers a sequential discrete choice problem in a time domain, formulated and solved as a route choice problem in a space domain. Starting from a dynamic specification of time-series discrete choices, we show how it is transferrable to link-based route choices that can be formulated by a finite path choice multinomial logit model. This study establishes that modeling sequential choices over time and in space are equivalent as long as the utility of the choice sequence is additive over the decision steps, the link-specific attributes are deterministic, and the decision process is Markovian. We employ the recursive logit …


Tackling Large-Scale Home Health Care Delivery Problem With Uncertainty, Cen Chen, Zachary Rubinstein, Stephen Smith, Hoong Chuin Lau Jun 2017

Tackling Large-Scale Home Health Care Delivery Problem With Uncertainty, Cen Chen, Zachary Rubinstein, Stephen Smith, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

In this work, we investigate a multi-period Home HealthCare Scheduling Problem (HHCSP) under stochastic serviceand travel times. We first model the deterministic problemas an integer linear programming model that incorporatesreal-world requirements, such as time windows, continuityof care, workload fairness, inter-visit temporal dependencies.We then extend the model to cope with uncertainty in durations,by introducing chance constraints into the formulation.We propose efficient solution approaches, which providequantifiable near-optimal solutions and further handlethe uncertainties by employing a sampling-based strategy. Wedemonstrate the effectiveness of our proposed approaches oninstances synthetically generated by real-world dataset forboth deterministic and stochastic scenarios.


Stop Nuclear Smuggling Through Efficient Container Inspection, Xinrun Wang, Qingyu Guo, Bo An May 2017

Stop Nuclear Smuggling Through Efficient Container Inspection, Xinrun Wang, Qingyu Guo, Bo An

Research Collection School Of Computing and Information Systems

Since 2003, the U.S. government has spent $850 million on the Megaport Initiative which aims at stopping the nuclear smuggling in international container shipping through advanced inspection facilities including Non-Intrusive Inspection (NII) and Mobile Radiation Detection and Identification System (MRDIS). Unfortunately, it remains a significant challenge to efficiently inspect more than 11.7 million containers imported to the U.S. due to the limited inspection resources. Moreover, existing work in container inspection neglects the sophisticated behavior of the smuggler who can surveil the inspector’s strategy and decide the optimal (sequential) smuggling plan. This paper is the first to tackle this challenging container …


Discovering Historic Traffic-Tolerant Paths In Road Networks, Pui Hang Li, Man Lung Yiu, Kyriakos Mouratidis Jan 2017

Discovering Historic Traffic-Tolerant Paths In Road Networks, Pui Hang Li, Man Lung Yiu, Kyriakos Mouratidis

Research Collection School Of Computing and Information Systems

Historic traffic information is valuable in transportation analysis and planning, e.g., evaluating the reliability of routes for representative source-destination pairs. Also, it can be utilized to provide efficient and effective route-search services. In view of these applications, we propose the k traffic-tolerant paths (TTP) problem on road networks, which takes a source-destination pair and historic traffic information as input, and returns k paths that minimize the aggregate (historic) travel time. Unlike the shortest path problem, the TTP problem has a combinatorial search space that renders the optimal solution expensive to find. First, we propose an exact algorithm with effective pruning …


The Contributions Of Anatol Rapoport To Game Theory, Erika Simpson May 2016

The Contributions Of Anatol Rapoport To Game Theory, Erika Simpson

Political Science Publications

Game theory is used to rationally and dispassionately examine the strategic behaviour of nations, especially superpower behaviour. This article explains how basic game theory - at its simplest level - was used by Anatol Rapoport to generate ideas about how to enhance world peace. Rapoport was at the forefront of the game theoreticians who sought to conceptualize strategies that could promote international cooperation. Accordingly, the basic logic of game theory is explained using the game models of ‘Chicken’ and ‘Prisoner’s Dilemma’. These models were used by Rapoport in his books and lectures in simple and complex ways. Then Rapoport’s revolutionary …


Mechanisms For Arranging Ride Sharing And Fare Splitting For Last-Mile Travel Demands, Shih-Fen Cheng, Duc Thien Nguyen, Hoong Chuin Lau May 2014

Mechanisms For Arranging Ride Sharing And Fare Splitting For Last-Mile Travel Demands, Shih-Fen Cheng, Duc Thien Nguyen, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

A great challenge of city planners is to provide efficient and effective connection service to travelers using public transportation system. This is commonly known as the last-mile problem and is critical in promoting the utilization of public transportation system. In this paper, we address the last-mile problem by considering a dynamic and demand-responsive mechanism for arranging ride sharing on a non-dedicated commercial fleet (such as taxis or passenger vans). Our approach has the benefits of being dynamic, flexible, and with low setup cost. A critical issue in such ride-sharing service is how riders should be grouped and serviced, and how …


Calibration Of Traffic Flow Models, Victor Molano Apr 2013

Calibration Of Traffic Flow Models, Victor Molano

College of Engineering: Graduate Celebration Programs

This study proposes a methodology to calibrate microscopic traffic flow simulation models. A Simultaneous Perturbation Stochastic Approximation (SPSA) algorithm searches for the set of model parameters that minimizes the difference between actual and simulated values


A Hurricane Evacuation Route System Real-Time Monitoring And Distribution Of Load, Anup Khanal Apr 2009

A Hurricane Evacuation Route System Real-Time Monitoring And Distribution Of Load, Anup Khanal

Electrical & Computer Engineering Theses & Dissertations

Hurricane evacuation is one of the major steps in diminishing the devastating effects of hurricanes on lives and properties. The challenge in evacuating a large number of people in a short time is the severe congestion faced in the transportation network, leading to long delays and shortages. Standard hurricane evacuation plans focus on how to best utilize the main arteries. The research challenge is to not overload the fastest routes and to utilize all the routes efficiently. The evacuation routing system proposed in this thesis focuses on distributing the traffic load throughout the network, utilizing alternative routes not considered in …


Cosign: A Parallel Algorithm For Coordinated Traffic Signal Control, Shih-Fen Cheng, Marina A. Epelman, Robert L. Smith Dec 2006

Cosign: A Parallel Algorithm For Coordinated Traffic Signal Control, Shih-Fen Cheng, Marina A. Epelman, Robert L. Smith

Research Collection School Of Computing and Information Systems

The problem of finding optimal coordinated signal timing plans for a large number of traffic signals is a challenging problem because of the exponential growth in the number of joint timing plans that need to be explored as the network size grows. In this paper, the game-theoretic paradigm of fictitious play to iteratively search for a coordinated signal timing plan is employed, which improves a system-wide performance criterion for a traffic network. The algorithm is robustly scalable to realistic-size networks modeled with high-fidelity simulations. Results of a case study for the city of Troy, MI, where there are 75 signalized …


Real-Time Travel Time Estimation Using Macroscopic Traffic Flow Models, Pushkin Kachroo, Kaan Ozbay, Antoine G. Hobeika Aug 2001

Real-Time Travel Time Estimation Using Macroscopic Traffic Flow Models, Pushkin Kachroo, Kaan Ozbay, Antoine G. Hobeika

Electrical & Computer Engineering Faculty Research

This paper presents the estimation of travel time on highways based on macroscopic modelling. The focus is on real-time values as compared to average or static values. The macroscopic models are used for distributed and time/space lumped settings and corresponding travel time estimation functions and algorithms are developed. The implications of these algorithms for the implementation of various incident management and traffic control strategies are also discussed.


Isolated Ramp Metering Feedback Control Utilizing Mixed Sensitivity For Desired Mainline Density And The Ramp Queues, Pushkin Kachroo, Kaan Ozbay, Donald E. Grove Jan 2001

Isolated Ramp Metering Feedback Control Utilizing Mixed Sensitivity For Desired Mainline Density And The Ramp Queues, Pushkin Kachroo, Kaan Ozbay, Donald E. Grove

Electrical & Computer Engineering Faculty Research

This paper presents a feedback control design for isolated ramp metering control. This feedback control design, unlike the existing isolated feedback ramp controllers, also takes into account the ramp queue length. Using a nonlinear H∞ control design methodology, we formulate the problem in the desired setting to be able to utilize the results of the methodology.


Feedback Control Solutions To Network Level User-Equilibrium Real-Time Dynamic Traffic Assignment Problems, Pushkin Kachroo, Kaan Ozbay Apr 1997

Feedback Control Solutions To Network Level User-Equilibrium Real-Time Dynamic Traffic Assignment Problems, Pushkin Kachroo, Kaan Ozbay

Electrical & Computer Engineering Faculty Research

A new method for performing dynamic traffic assignment (DTA) is presented which is applicable in real time, since the solution is based on feedback control. This method employs the design of nonlinear H∞ feedback control systems which is robust to certain class of uncertainties in the system. The solution aims at achieving user equilibrium on alternate routes in a network setting.


Investigating The Use Of Kalman Filtering Approaches For Dynamic Origin-Destination Trip Table Estimation, Pushkin Kachroo, Kaan Ozbay, Arvind Narayanan Apr 1997

Investigating The Use Of Kalman Filtering Approaches For Dynamic Origin-Destination Trip Table Estimation, Pushkin Kachroo, Kaan Ozbay, Arvind Narayanan

Electrical & Computer Engineering Faculty Research

This paper studies the applicability of Kalman filtering approaches for network wide traveler origin-destination estimation from link traffic volumes. The paper evaluates the modeling assumptions of the Kalman filters and examines the implications of such assumptions.