Network Model of Urban Taxi Services: Improved Algorithm

1998 ◽  
Vol 1623 (1) ◽  
pp. 27-30 ◽  
Author(s):  
S. C. Wong ◽  
Hai Yang
Keyword(s):  
Mathematical Model ◽  
Logit Model ◽  
Road Network ◽  
Search Time ◽  
Random Variable ◽  
Taxi Driver ◽  
Movement Model ◽  
Transportation Services ◽  
Type Distribution ◽  
Time Required

A mathematical model is proposed to describe how vacant and occupied taxis will cruise in a road network to search for customers and provide transportation services. The model assumes that a taxi driver, once having picked up a customer, will move to the customer’s destination by the shortest path; and that a taxi driver, once having dropped a customer, will try to minimize individual expected search time required to meet the next customer. The probability that a vacant taxi meets a customer in a particular zone is specified by a logit model by assuming that the expected search time in each zone is an identically distributed random variable due to variations in perceptions and the random arrival of customers. The whole movement of all empty and occupied taxis is formulated as an optimization model, from which a gravity-type distribution of empty taxis is derived. Consequently, the taxi movement model can be solved efficiently by the established iterative balancing method and can be incorporated into any standard transportation planning packages.

The Function of Magnetic Field in a Magnetic-Electrochemical Compound Polishing

2010 ◽  
Vol 97-101 ◽  
pp. 4141-4145 ◽  
Author(s):  
Li Min Shi ◽  
Er Liang Liu ◽  
Yong Jiang Niu ◽  
Yu Quan Chen
Keyword(s):  
Magnetic Field ◽  
Mathematical Model ◽  
Concentration Polarization ◽  
Electrochemical Reaction ◽  
Charged Particles ◽  
Polishing Process ◽  
Electrical Field ◽  
Movement Model ◽  
The Mathematical Model ◽  
The Magnetic Field

Traditionally, the magnetic field is always vertical to the electrical field in a magnetic-electrochemical compound polishing.The magnetic field is set to parallel the electrical field in this paper. The mathematical model of the charged particles movement in a magnetic field is established through the analysis of its movement process when using Coulomb laws and Lorentz force. Through constructing the velocity formulation and loci formulation, the function of the magnetic field is proved. Because of the magnetic field, the concentration polarization of electrochemical reaction can be reduced more and the electrochemical reaction can be accelerated easily than the traditional polishing in which the magnetic field is vertical to the electrical field. Finally, to verify the model, the magnetic-electrochemical compound polishing process has been tested and the results, compared with those obtained from the model, have shown the movement model is reasonable and the analysis to function of magnetic field is correct.

scholarly journals Independent Map Enhancement for a Spatial Road Network: Fundamental Applications and Opportunities

2020 ◽  
Vol 10 (1) ◽  
pp. 8
Author(s):  
Sultan Alamri
Keyword(s):  
Road Network ◽  
Road Networks ◽  
Road Construction ◽  
Peer To Peer ◽  
Transport Infrastructure ◽  
Traffic Density ◽  
Additional Time ◽  
Developing Cities ◽  
Time Required ◽  
Future Work

In many developing cities, the improvement of transport infrastructure is usually accompanied by major road construction and maintenance. This paper presents approaches and opportunities using peer-to-peer updating to improve spatial road networks undergoing construction and maintenance, which in turn will improve traffic flow and benefit cities overall. In many cities, the spatial road network requires maintenance, and these works often require traffic detours. With the current GPS (Global Positioning System) services, there is a noticeable delay in the updating of many spatial road networks. Thus, when a driver plans a trip to a certain location (such as Starbucks), his/her usual route may have changed, but the spatial road network in the GPS has not been updated. This can affect the user in many ways. For example, a trip that usually takes five minutes might now take half an hour, taking into account the additional time required to find alternative roads and possibly encountering more unexpected road closures, until the driver reaches his/her destination. This paper addresses this issue by proposing solutions that offer several advantages including a new peer-to-peer updating mechanism that helps to direct the driver to another route when road changes occur. Moreover, the peer-to-peer updating mechanism can enable the independent monitoring of road conditions and the updating of maps for newly-constructed roads, as well as the analysis of road congestions, traffic density, and people movements at certain times. Note that this work focuses on the conceptual ideas and approaches intended to improve independent maps, and the detailed algorithms have been left for future work.

Analytical Study of Hydro-Pneumatic Processes for Gorlov's Power System

1994 ◽  
Vol 208 (1) ◽  
pp. 67-70
Author(s):  
A I Ryazanov
Keyword(s):  
Experimental Data ◽  
Mathematical Model ◽  
Power System ◽  
Analytical Study ◽  
Model Tests ◽  
Air Pressure ◽  
Pneumatic Power ◽  
Time Required ◽  
The Mathematical Model

This paper describes the aerohydrodvnamics of processes in chambers of Gorlov's hydro-pneumatic power system. The mathematical model is developed to determine the main parameters of the processes: water and air velocities, air pressure in the chamber, the periods of time required to fill and empty the chambers and the output of energy during the cycle. The results obtained are in agreement with experimental data and model tests.

scholarly journals Warehouse Relayout Design with Weighted Distance Method to Minimize Time Travel

2020 ◽  
Vol 3 (1) ◽  
pp. 1-8
Author(s):  
Adi Firmansyah ◽  
Lukmandono Lukmandono
Keyword(s):  
Mathematical Model ◽  
Travel Time ◽  
Layout Design ◽  
Global Competition ◽  
Closing Time ◽  
Distance Method ◽  
Weighted Distance ◽  
Logistics Services ◽  
Time Required ◽  
Efficient Work

Global competition between companies is becoming increasingly stringent, resulting in companies having to understand their customers better. Customers no longer only need quality products, but also need excellent and timely service. To meet the desires of these consumers, the company must create an effective and efficient work system. PT IJS is a warehouse engaged in logistics services in the Perak area of Surabaya. One of the services provided by PT IJS is bonded warehouse logistic services. A bounded warehouse owned is currently not able to provide maximum service because there are still many late deliveries that do not send goods to the port, and there is a closing time that is detrimental to the customer. The length of the delivery process is due to several factors, one of which is a less effective warehouse layout. Travel time is the time required for a vehicle to carry out activities loading goods PT. IJS from arrival to exit the warehouse. The method weighted distance is a mathematical model used to evaluate the layout based on proximity factors. The design of the layout design by using the technique weighted distance produces an alternative layout that shows calculation travel time a shorter

Efficient collective search by BRT algorithm using fast rising threshold agent

2021 ◽  
pp. 102-108
Author(s):  
Phung Nhu Hai
Keyword(s):  
Search Time ◽  
Computer Experiments ◽  
Distributed Robots ◽  
Time Required

The BRT algorithm is a method for the best-of-n problem that allows a group of distributed robots to find out the most appropriate collective option among many alternatives. Computer experiments show that the time required for finding out the best option is proportional to the number of options. In this paper, we aim to shorten this search time by introducing a few agents whose threshold increases faster than the normal one to achieve higher scalability of the BRT algorithm. The results show that the search time is reduced, and the variance is improved, especially under challenging problems where robots are required to make decisions out of a large number of options.

Fast and Intelligent Antenna Design Optimization using Machine Learning

2021 ◽  
Vol 35 (11) ◽  
pp. 1350-1351
Author(s):  
Gopinath Gampala ◽  
C. J. Reddy
Keyword(s):  
Machine Learning ◽  
Mathematical Model ◽  
Design Optimization ◽  
Antenna Design ◽  
Convergence Criteria ◽  
Time Required

Traditional antenna optimization solves the modified version of the original antenna design for each iteration. Thus, the total time required to optimize a given antenna design is highly dependent on the convergence criteria of the selected algorithm and the time taken for each iteration. The use of machine learning enables the antenna designer to generate trained mathematical model that replicates the original antenna design and then apply optimization on the trained model. Use of trained model allows to run thousands of optimization iterations in a span of few seconds.

Increased Value Through Sharing in Multi-Sided Markets

2019 ◽  
pp. 907-924
Author(s):  
Nina Tura ◽  
Aino Kuitunen ◽  
Lauri Lättilä ◽  
Samuli Kortelainen
Keyword(s):  
Mathematical Model ◽  
Cost Saving ◽  
Conceptual Model ◽  
Business Models ◽  
Business Processes ◽  
Sharing Economy ◽  
Taxi Driver ◽  
Sustainable Business ◽  
Sustainable Business Models ◽  
The Cost

The demand for more sustainable business models is increasing the need for current businesses to develop their business processes and value creation mechanisms. One way to improve sustainability is sharing resources and services in a new sharing economy paradigm. This chapter builds a conceptual model for taxi ridesharing to describe the value potential that is born by increasing the efficiency of taxi businesses. First, a framework for multisided markets is built to understand the different value elements of taxi ridesharing. Then, a conceptual mathematical model is introduced to understand the value symmetries including the cost saving potential and allocation from the perspectives of the customer and the supplier. The model shows that it is possible to have a system that creates value for both the taxi driver and the passenger, while simultaneously leading to significant reduction in CO2 emissions.

scholarly journals A generalized class of correlated run shock models

2018 ◽  
Vol 6 (1) ◽  
pp. 131-138 ◽  
Author(s):  
Femin Yalcin ◽  
Serkan Eryilmaz ◽  
Ali Riza Bozbulut
Keyword(s):  
Stopping Time ◽  
Random Variables ◽  
Random Variable ◽  
Phase Type Distribution ◽  
Type Distribution ◽  
Shock Models ◽  
Phase Type ◽  
Over Time

AbstractIn this paper, a generalized class of run shock models associated with a bivariate sequence {(Xi, Yi)}i≥1 of correlated random variables is defined and studied. For a system that is subject to shocks of random magnitudes X1, X2, ... over time, let the random variables Y1, Y2, ... denote times between arrivals of successive shocks. The lifetime of the system under this class is defined through a compound random variable T = ∑Nt=1 Yt , where N is a stopping time for the sequence {Xi}i≤1 and represents the number of shocks that causes failure of the system. Another random variable of interest is the maximum shock size up to N, i.e. M = max {Xi, 1≤i≤ N}. Distributions of T and M are investigated when N has a phase-type distribution.

NAVIGATION METHODS FOR THE SKIING ROBOT

2013 ◽  
Vol 10 (04) ◽  
pp. 1350029 ◽  
Author(s):  
TADEJ PETRIČ ◽  
LUKA PETERNEL ◽  
ANDREJ GAMS ◽  
BOJAN NEMEC ◽  
LEON ŽLAJPAH
Keyword(s):  
Neural Networks ◽  
Direct Control ◽  
Successful Completion ◽  
Nonholonomic Mobile Robots ◽  
Movement Model ◽  
Global Method ◽  
Local Navigation ◽  
The Neural Networks ◽  
Intuitive Method ◽  
Time Required

In this paper, we propose and evaluate methods for the local navigation using only visual perception for the skiing robot. Our skiing robot, capable of skiing using the carving technique, has no direct control on the velocity of skiing as it cannot break or accelerate, therefore well known navigation methods for nonholonomic mobile robots cannot be directly applied. We consider the following methods: an intuitive method of aiming at the closest gates, a human obstacle avoidance movement model, neural networks learning from a set of human demonstrations, and a global method that uses a predefined, spline-encoded path. The navigation performance of the robot on unknown ski courses is evaluated using two criteria: successful completion of the course and the time required to complete the course. Simulation results show the applicability and drawbacks of presented methods. Finally, the method using the neural networks was applied on a real-world skiing robot and we tested navigating a slalom course on both roller blades and skies.

Sign in / Sign up

Export Citation Format

Share Document