2,360 research outputs found

    Route Discovery Development for Multiple Destination Using Artificial Ant Colony

    Get PDF
    Smart cities need a smart applications for the citizen, not just digital devices. Smart applications will provide a decision-making to users by using artificial intelligence. Many real-world services for online shopping and delivery systems were used and attracted customers, especially after the Covid-19 pandemics when people prefer to keep social distance and minimize social places visiting. These services need to discover the shortest path for the delivery driver to visit multiple destinations and serve the customers. The aim of this research is to develop the route discovery for multiple-destination by using ACO Algorithm for Multiple destination route planning. ACO Algorithm for Multiple destination route planning develops the Google MAP application to optimize the route when it is used for multiple destinations and when the route is updated with a new destination. The results show improvement in the multiple destination route discovery when the shortest path and the sequence order of cities are found. In conclusion, the ACO Algorithm for Multiple destination route planning simulation results could be used with the Google Map application and provide an artificial decision for the citizen of Erbil city.  Finally, we discuss our vision for future development

    A Simple Baseline for Travel Time Estimation using Large-Scale Trip Data

    Full text link
    The increased availability of large-scale trajectory data around the world provides rich information for the study of urban dynamics. For example, New York City Taxi Limousine Commission regularly releases source-destination information about trips in the taxis they regulate. Taxi data provide information about traffic patterns, and thus enable the study of urban flow -- what will traffic between two locations look like at a certain date and time in the future? Existing big data methods try to outdo each other in terms of complexity and algorithmic sophistication. In the spirit of "big data beats algorithms", we present a very simple baseline which outperforms state-of-the-art approaches, including Bing Maps and Baidu Maps (whose APIs permit large scale experimentation). Such a travel time estimation baseline has several important uses, such as navigation (fast travel time estimates can serve as approximate heuristics for A search variants for path finding) and trip planning (which uses operating hours for popular destinations along with travel time estimates to create an itinerary).Comment: 12 page

    The Shortest Path to Happiness: Recommending Beautiful, Quiet, and Happy Routes in the City

    Full text link
    When providing directions to a place, web and mobile mapping services are all able to suggest the shortest route. The goal of this work is to automatically suggest routes that are not only short but also emotionally pleasant. To quantify the extent to which urban locations are pleasant, we use data from a crowd-sourcing platform that shows two street scenes in London (out of hundreds), and a user votes on which one looks more beautiful, quiet, and happy. We consider votes from more than 3.3K individuals and translate them into quantitative measures of location perceptions. We arrange those locations into a graph upon which we learn pleasant routes. Based on a quantitative validation, we find that, compared to the shortest routes, the recommended ones add just a few extra walking minutes and are indeed perceived to be more beautiful, quiet, and happy. To test the generality of our approach, we consider Flickr metadata of more than 3.7M pictures in London and 1.3M in Boston, compute proxies for the crowdsourced beauty dimension (the one for which we have collected the most votes), and evaluate those proxies with 30 participants in London and 54 in Boston. These participants have not only rated our recommendations but have also carefully motivated their choices, providing insights for future work.Comment: 11 pages, 7 figures, Proceedings of ACM Hypertext 201

    A review of urban computing for mobile phone traces

    Get PDF
    In this work, we present three classes of methods to extract information from triangulated mobile phone signals, and describe applications with different goals in spatiotemporal analysis and urban modeling. Our first challenge is to relate extracted information from phone records (i.e., a set of time-stamped coordinates estimated from signal strengths) with destinations by each of the million anonymous users. By demonstrating a method that converts phone signals into small grid cell destinations, we present a framework that bridges triangulated mobile phone data with previously established findings obtained from data at more coarse-grained resolutions (such as at the cell tower or census tract levels). In particular, this method allows us to relate daily mobility networks, called motifs here, with trip chains extracted from travel diary surveys. Compared with existing travel demand models mainly relying on expensive and less-frequent travel survey data, this method represents an advantage for applying ubiquitous mobile phone data to urban and transportation modeling applications. Second, we present a method that takes advantage of the high spatial resolution of the triangulated phone data to infer trip purposes by examining semantic-enriched land uses surrounding destinations in individual's motifs. In the final section, we discuss a portable computational architecture that allows us to manage and analyze mobile phone data in geospatial databases, and to map mobile phone trips onto spatial networks such that further analysis about flows and network performances can be done. The combination of these three methods demonstrate the state-of-the-art algorithms that can be adapted to triangulated mobile phone data for the context of urban computing and modeling applications.BMW GroupAustrian Institute of TechnologySingapore. National Research FoundationMassachusetts Institute of Technology. School of EngineeringMassachusetts Institute of Technology. Dept. of Urban Studies and PlanningSingapore-MIT Alliance for Research and Technology (Center for Future Mobility

    Statistical Density Prediction in Traffic Networks

    Full text link

    How machine learning informs ride-hailing services: A survey

    Get PDF
    In recent years, online ride-hailing services have emerged as an important component of urban transportation system, which not only provide significant ease for residents’ travel activities, but also shape new travel behavior and diversify urban mobility patterns. This study provides a thorough review of machine-learning-based methodologies for on-demand ride-hailing services. The importance of on-demand ride-hailing services in the spatio-temporal dynamics of urban traffic is first highlighted, with machine-learning-based macro-level ride-hailing research demonstrating its value in guiding the design, planning, operation, and control of urban intelligent transportation systems. Then, the research on travel behavior from the perspective of individual mobility patterns, including carpooling behavior and modal choice behavior, is summarized. In addition, existing studies on order matching and vehicle dispatching strategies, which are among the most important components of on-line ride-hailing systems, are collected and summarized. Finally, some of the critical challenges and opportunities in ride-hailing services are discussed
    • …
    corecore