FooDNet: Toward an Optimized Food Delivery Network based on Spatial Crowdsourcing

•Download as DOCX, PDF•

0 likes•79 views

FooDNet: Toward an Optimized Food Delivery Network based on Spatial Crowdsourcing To buy this project in ONLINE, Contact: Email: jpinfotechprojects@gmail.com, Website: https://www.jpinfotech.org

Education

FooDNet: Toward an Optimized Food Delivery Network
based on Spatial Crowdsourcing
ABSTRACT:
This paper builds a Food Delivery Network (FooDNet in short) using spatial
crowdsourcing (SC). It investigates the participation of urban taxis to support on
demand take-out food delivery. Unlike existing SC-enabled service sharing
systems (e.g., ridesharing), the delivery of food in FooDNet is more time-sensitive
and the optimization problem is more complex regarding high-efficiency, huge-
number of delivery needs. In particular, two on demand food delivery problems
under different situations are studied in our work: (1) for O-OTOD, the food is
opportunistically delivered by taxis when carrying passengers, and the
optimization goal is to minimize the number of selected taxis to maintain a
relatively high incentive to the participated drivers; (2) for D-OTOD, taxis
dedicatedly deliver food without taking passengers, and the aim is to minimize the
number of selected taxis (i.e., to raise the reward for each participant) and the total
traveling distance to reduce the cost. A two-stage approach, including the
construction algorithm and the Adaptive Large Neighborhood Search (ALNS)
algorithm based on simulated annealing, is proposed to solve the problem. We
have conducted extensive experiments based on the real-world datasets, including
city-wide restaurant data, cell tower data, and the large-scale taxi trajectory data
with 10,000 taxis in the city of Chengdu, China. Experimental results demonstrate
that our proposed algorithms are more effective and efficient than baselines,

fulfilling the food delivery service using a smaller number of taxis within the given
time.
SYSTEM REQUIREMENTS:
HARDWARE REQUIREMENTS:
 System : Pentium Dual Core.
 Hard Disk : 120 GB.
 Monitor : 15’’ LED
 Input Devices : Keyboard, Mouse
 Ram : 1 GB
SOFTWARE REQUIREMENTS:
 Operating system : Windows 7.
 Coding Language : JAVA.
 Tool : Netbeans 7.2.1
 Database : MYSQL
REFERENCE:
Yan Liu, Bin Guo, Senior Member, IEEE, Chao Chen, He Du, Zhiwen Yu, Senior
Member, IEEE, Daqing Zhang, Member, IEEE, and Huadong Ma, Member, IEEE,
“FooDNet: Toward an Optimized Food Delivery Network based on Spatial

Crowdsourcing”, IEEE Transactions on Mobile Computing, Volume: 18 , Issue: 6 ,
June 1 2019.

Carpooling (also car-sharing, ride-sharing, lift-sharing), is the sharing of car journeys so that more than one person travels in a car. It helps to resolve a variety of problems that continue to plague urban areas, ranging from energy demands and traffic congestion to environmental pollution. Most of the existing method used stochastic disturbances arising from variations in vehicle travel times for carpooling. However it doesn’t deal with the unmet demand with uncertain demand of the vehicle for car pooling. To deal with this the proposed system uses Chance constrained formulation/Programming (CCP) approach of the problem with stochastic demand and travel time parameters, under mild assumptions on the distribution of stochastic parameters; and relates it with a robust optimization approach. Since real problem sizes can be large, it could be difficult to find optimal solutions within a reasonable period of time. Therefore solution algorithm using tabu heuristic solution approach is developed to solve the model. Therefore, we constructed a stochastic carpooling model that considers the in- fluence of stochastic travel times. The model is formulated as an integer multiple commodity network flow problem. Since real problem sizes can be large, it could be difficult to find optimal solutions within a reasonable period of time.

Real time path planning based on

jpstudcorner

HEAD OFFICE (CHENNAI): JP INFOTECH, Old No. 31, New No: 86, 1st Floor, 1st Avenue, Ashok Nagar (Ashok Pillar), Chennai – 83. Landmark: Next to Kotak Mahendra Bank / Bharath Scans MOBILE: (0)9952649690 LANDLINE: (044) 43012642 E-MAIL: jpinfotechprojects@gmail.com PUDUCHERRY / PONDICHERRY OFFICE: JP INFOTECH, #45, Kamaraj Salai, Thattanchavady, Pondy-Tindivanam High Road, Puducherry/Pondicherry – 605009. Landmark: Opp. To Thattanchavady Industrial Estate and Next to VVP Nagar Arch. MOBILE: (0)9952649690 / (0) 8608600246 LANDLINE: (0413)4300535 E-MAIL: jpinfotechprojects@gmail.com

Bus vanet

jpstudcorner

NS2 IEEE Projects @ HCL Velachery

Senthilvel S

WARM WELCOME FROM HCL VELACHERY……. HCL Learning is part of HCL Info Systems Ltd, India’s Premier information enabling company with an annual turnover of 15000 crores Leveraging on the 34 years of industry experience of HCL, with an objective to develop quality IT professionals to meet this ever expanding requirement of Hardware Networking and Software professionals for the IT sector, HCL has launched HCL Career Development Centre. For any clarification, contact Person Mr.Senthilvel.S 9382207007 HCL Velachery -42.

Study of Congestion Control Scheme with Decentralized Threshold Function in V...

ijtsrd

With the constant increase in vehicular traffic, existing traffic management solutions have become inefficient. Urbanization has led to an increase in traffic jams and accidents in major cities. In order to accommodate the growing needs of transport systems today, there is a need for an Intelligent Transport System. Vehicular Ad hoc Network VANET is a growing technology that assists in Intelligent Transport Systems. VANETs enable communication between vehicles as well as fixed infrastructure called Road Side Units RSU . We propose a distributed, collaborative traffic congestion detection and dissemination system that uses VANET. Each of the driver's smart phones is equipped with a Traffic App which is capable of location detection through Geographic Position based System GPS . This information is relayed to a remote server which detects traffic congestion. Once congestion is confirmed the congestion information is disseminated to the end user phone through RSUs. The Mobile App transmits the location information at periodic intervals. Using the latitude, longitude and the current time, the location of each vehicle is traced. Using location information, the distance moved by the vehicle at a given time is monitored. If the value is below a fixed threshold, congestion is suspected in a particular area. If many vehicles in the same area send similar messages, traffic congestion is confirmed. Once traffic congestion is confirmed, the vehicles approaching the congested area are informed about the traffic through display boards that are available in the nearest RSUs traffic signals . The congestion information is also made available through the Mobile App present in vehicles approaching the congested area. The approaching vehicles may take diversion and alleviate congestion. Anees Khan | Prof. Sarwes Site "Study of Congestion Control Scheme with Decentralized Threshold Function in VANETs" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-5 , August 2019, URL: https://www.ijtsrd.com/papers/ijtsrd25324.pdfPaper URL: https://www.ijtsrd.com/computer-science/other/25324/study-of-congestion-control-scheme-with-decentralized-threshold-function-in-vanets/anees-khan

Efficient and Optimal Routing Scheme for Wireless Sensor Networks

paperpublications3

Abstract: The Wireless Sensor Networks (WSNs) have emerged as a new category of networking systems with limited computing, communication, and storage resources. In many sensing applications source nodes deliver packets to sink nodes via multiple hops, leading to the problem on how to find routes that enable all packets to be delivered in required time frames, while simultaneously taking into account factors such as energy efficiency and load balancing. To solve this problem one data collection protocol is developed called EDAL, which stands for Energy-efficient Delay-aware Lifetime-balancing data collection. Methods used are centralized heuristic and ant colony gossiping to find best energy efficient path. Then integrate EDAL with compressive sensing to reduce the amount of traffic generated and to reduce delay in the network.

Smart City-Scale Taxi Ridesharing

IRJET Journal

This document discusses a proposed smart city taxi ridesharing system. It aims to efficiently match taxi riders and drivers for shared rides, while minimizing increased travel distances and costs for all parties. The system uses an app to receive real-time ride requests from passengers and schedule taxis. It searches for taxis that can pick up new passengers with minimal additional travel distance, while respecting time constraints and ensuring passengers and drivers are fairly compensated. The system was tested using real taxi trip data and demonstrated efficiency and scalability. It is estimated to increase taxi occupancy rates and reduce travel distances compared to no ridesharing. Challenges include defining fair pricing models and addressing high demand scenarios.

The vehicle route scheduling problem is concerned with the determination of routes and schedules for a fleet of vehicles to satisfy the demands of a set of customers. The goal of vehicle routing is to schedule multiple suppliers from various places. Vehicle routing has existed since the advent of the Industrial age, when large-scale production became possible. As the complexity and scale of the manufacturing world increased, the task of optimizing vehicle routing grew. The vehicle routing problem is a combinatorial optimization and integer programming problem seeking to service a number of customers with a fleet of vehicles. Often the context is that of delivering goods located at a central depot to customers who have placed orders for such goods or vice-versa. Implicit is the goal of minimizing the cost of distributing the goods. Many methods have been developed for searching for good solutions to the problem, however even for the smallest problems, finding global minimum for the cost function is computationally complex. The paper presents an optimization algorithm using Particle Swarm Optimization (PSO) for the vehicle routing that would enable the logistic manager of a latex industry to minimize the transportation cost and maximize the collection using minimum number of vehicles.

Real time path planning based on hybrid-vanet-enhanced transportation system

Pvrtechnologies Nellore

The document presents a real-time path planning algorithm for vehicles based on a hybrid vehicular ad hoc network (VANET) and cellular network system. The algorithm aims to improve both the overall road network utilization and reduce the average vehicle travel cost. It first establishes a communication framework using VANETs, cellular networks, vehicles, roadside units and a traffic server. It then proposes a path planning algorithm based on Lyapunov optimization that considers both network performance and driver preferences like travel time and distance. Simulation results show the algorithm can efficiently find alternative paths for vehicles to bypass congestions while reducing travel costs.

Optimal multicast capacity and delay tradeoffs in manets

JPINFOTECH JAYAPRAKASH

This document summarizes a research paper that analyzes optimal multicast capacity and delay tradeoffs in mobile ad hoc networks (MANETs) under different node mobility models. It studies four node mobility models (two with two-dimensional mobility and two with one-dimensional mobility) and two mobility timescales (fast and slow mobility relative to data transmission). The paper characterizes the optimal multicast capacity under each model given a delay constraint and develops a scheme to achieve throughput close to the upper bound. It also extends the analysis to heterogeneous networks with infrastructure support like base stations.

Trajectory improves data delivery in urban vehicular networks

Papitha Velumani

This document discusses how using vehicle trajectory data can improve data delivery in urban vehicular networks. Existing algorithms for data delivery have relied on coarse-grained mobility patterns, but analyzing vehicle trace data from Shanghai and Shenzhen reveals strong spatiotemporal regularity in vehicle mobility. The proposed system develops accurate trajectory predictions using multiple order Markov chains trained on historical vehicle trace data. Routing algorithms are then proposed that take advantage of the predicted probabilistic trajectories to achieve significantly higher delivery ratios and lower costs compared to existing algorithms.

[IJET-V1I3P19] Authors :Nilesh B Karande , Nagaraju Bogiri.

IJET - International Journal of Engineering and Techniques

Recently, rates of vehicle ownership have risen globally, exacerbating problems including air pollution, lack of parking, and traffic congestion. While many solutions to these problems have been proposed, Carpooling is one of the most effective solutions to this problems Recently, several carpooling platforms have been built on cloud computing systems, with originators posting online list of departure/arrival points and schedules from which participants can search for rides that match their needs. In this paper, an improved carpool system is described in detail and called the improved intelligent carpool system (IICS), which provides car poolers the use of the carpool services via a smart handheld device anywhere and at any time. This IICS Consist the geographical, traffic, and societal information and used to manage requests and find minimum route. We apply advanced genetic-based carpool route and matching algorithm (AGCRMA) for this multiobjective optimization problem called the carpool service problem (CSP).

Routing of traffic sensors in intelligent transportation system

eSAT Journals

Abstract As country develops, the application of technology in each and every field increases to fulfill the demand of people. The application of technology in transportation system is called Intelligent Transportation System (ITS) which has more demand in today’s world for traffic management. Vehicular Ad hoc Network (VANET) is one of the technology used in Intelligent Transportation System. In Vehicular Ad hoc Network temporary network is formed within the vehicles or vehicle to traffic infrastructure which has sensors within it for communication. The temporary network establishes and ends after exchanging the required information. This process should happen within fraction of seconds which is more complicated issue in highly mobile vehicles, so routing is a major problem in Vehicular Ad hoc Network. In this work, hybrid two stage heuristic routing protocol which is based on ant colony optimization and particle swarm optimization algorithm is used to make routing more efficient in Vehicular Ad hoc Network. The MATLAB software is used to implement the algorithm. The result shows that two stage heuristic protocol perform better than Ad hoc on Demand Vector (AODV) protocol. Keywords: Intelligent Transportation System, Vehicular Ad Hoc Network (VANET), Ad Hoc on Demand Vector (AODV), Ant Colony optimization (ACO), Particle Swarm Optimization (PSO)

How long to wait predicting bus arrival time with mobile phone based particip...

JPINFOTECH JAYAPRAKASH

This document proposes a system to predict bus arrival times using mobile phone sensor data from passengers. It aims to address limitations of existing schedules that do not reflect delays. The system collects anonymous sensor data like cell tower signals and audio from passengers' phones to estimate bus routes and predict arrival times at stops. It was tested on campus and public buses over 7 weeks, achieving better accuracy than GPS-based solutions. The system is independent of bus operators and uses commodity phones, making it easily deployable across cities.

International Journal of Engineering and Science Invention (IJESI)

inventionjournals

This document summarizes a research paper on improving traffic detection algorithms using an extended floating car data (xFCD) system. The xFCD system collects data from vehicles including location, speed, direction and visual data from a forward-facing camera. It is tested under different lighting and traffic conditions. The paper investigates using xFCD data and information from road sensors to construct a hybrid model characterizing traffic states. A traffic detection algorithm is proposed to improve network performance metrics like throughput, delivery ratio and packet delay. Simulation results show the proposed approach improves these metrics compared to existing methods.

MTCroid

Md Shaukat Ali

The document describes a proposed mobile application called MTCroid for the Android platform that will provide real-time bus route information for the Metropolitan Transport Corporation (MTC) in Chennai, India. The application will use GPS data from 1000 MTC buses equipped with GPS to show bus locations on a map and estimated arrival times at bus stops. It will have a simple interface for users to easily find relevant route information. The system will include an Android client application, a backend server providing an API, and a MySQL database storing schedule and GPS data. The goals are to develop an easy to use real-time transit information tool to help reduce wait times at stops.

Performance Evaluation of Efficient Data Dissemination Approach For QoS Enha...

IJCSIS Research Publications

Vehicular ad hoc networks (VANETs) have seen tremendous growth in the last decade, providing a vast range of applications in both military and civilian activities. The temporary connectivity in the vehicles can also increase the driver’s capability on the road. However, such applications require heavy data packets to be shared on the same spectrum without the requirement of excessive radios. Thus, e-client approaches are required which can provide improved data dissemination along with the better quality of services to allow heavy traffic to be easily shared between the vehicles. In this paper, an e-client data dissemination approach is proposed which not only improves the vehicle to vehicle connectivity but also improves the QoS between the source and the destination. The proposed approach is analyzed and compared with the existing state-of-the-art approaches. The effectiveness of the proposed approach is demonstrated in terms of the significant gains attained in the parameters namely, end to end delay, packet delivery ratio, route acquisition time, throughput, and message dissemination rate in comparison with the existing approaches.

Back-Bone Assisted HOP Greedy Routing for VANET

ijsrd.com

Using advanced wireless local area network technologies, vehicular ad hoc networks (VANETs) have become viable and valuable for their wide variety of novel applications, such as road safety, multimedia content sharing, commerce on wheels, etc., currently, geographic routing protocols are widely adopted for VANETs as they do not require route construction and route maintenance phases. Again, with connectivity awareness, they perform well in terms of reliable delivery. Further, in the case of sparse and void regions, frequent use of the recovery strategy elevates hop count. Some geographic routing protocols adopt the minimum weighted algorithm based on distance or connectivity to select intermediate intersections. However, the shortest path or the path with higher connectivity may include numerous intermediate intersections. As a result, these protocols yield routing paths with higher hop count. In this paper, we propose a hop greedy routing scheme that yields a routing path with the minimum number of intermediate intersection nodes while taking connectivity into consideration. Moreover, we introduce back-bone nodes that play a key role in providing connectivity status around an intersection. Apart from this, by tracking the movement of source as well as destination, the back-bone nodes enable a packet to be forwarded in the changed direction. Simulation results signify the benefits of the proposed routing strategy in terms of high packet delivery ratio and shorter end-to-end delay.

Help the Genetic Algorithm to Minimize the Urban Traffic on Intersections

IJORCS

This document summarizes a research paper that uses genetic algorithms to optimize traffic light timing at intersections to minimize traffic. It first describes modeling traffic light intersections using Petri nets. It then explains how genetic algorithms can be used for optimization by coding the problem variables in chromosomes, defining a fitness function to evaluate populations over generations, and using operators like mutation and crossover. The fitness function aims to minimize average traffic light cycle times based on 14 parameters related to light timing and vehicle wait times at two intersections. The genetic algorithm optimization of traffic light timing parameters is found to improve traffic flow at intersections.

2213ijccms02.pdf

ijccmsjournal

This paper evokes the vehicle routing problem (VRP) which aims to determine the minimum total cost pathways for a fleet of heterogeneous vehicles to deliver a set of customers' orders. The inability of optimization algorithms alone to fully satisfy the needs of logistic managers become obvious in transportation field due to the spatial nature of such problems. In this context, we couple a geographical information system (GIS) with a metaheuristic to handle the VRP efficiently then generate a geographical solution instead of the numerical solution. A real-case instance in a Tunisian region is studied in order to test the proposed approach.

Ant Colony with Colored Pheromones Routing for Multi Objectives Quality of Se...

IJORCS

In this article, we present a new Ant-routing algorithm with colored pheromones and clustering techniques for satisfying users’ Quality of Service (QoS) requirements in Wireless Sensor Networks (WSNs). An important problem is to detect the best route from a source node to the destination node. Moreover, it is considered that the feature of non-uniformly distributed traffic load and possibility existing of the traffic requiring various performances; therefore, it is assumed the different class of traffic required for QoS of communication. In this paper, novel protocol, the suitability of using meta-heuristic an ant colony optimization based on energy saving and multi objectives, the demand of QoS routing protocol for WSN will be very adaptive ,resident power and mainly decrease end-to-end delay. These metrics are used by colored pheromones adapted to the traffic classes. Moreover, we reinforce the proposed method for scalability issue by clustering techniques. We use a proactive route discover algorithms in clusters and reactive discovery mechanism between different clusters. Compared to existing QoS routing protocols, the novel algorithm has been designed for various service categories such as real time (RT) and best effort (BE) traffic, resulted lower packet deadline miss ratio and higher energy efficiency and better QoS and longer lifetime.

A Dynamic Vehicular Traffic Control Using Ant Colony And Traffic Light Optimi...

Kristen Carter

This document proposes a dynamic vehicular traffic control system using ant colony optimization and optimized traffic lights. It aims to reduce traffic congestion in urban areas. The system divides the road network into cells and uses artificial ants to guide vehicles along the least congested paths within each cell. It also proposes a new method for optimizing traffic light timing at intersections based on real-time vehicle count data collected from vehicles and traffic lights using VANET technology. Simulation results using the DIVERT simulator show that the proposed traffic light optimization method improves average vehicle speed and reduces waiting times and stopped vehicles at intersections compared to a system with usual fixed-duration traffic lights.

OPTIMIZING COST FOR ONLINE SOCIAL NETWORKS ON GEO-DISTRIBUTED CLOUDS

sri harsha vanamala

This document discusses optimizing costs for online social networks on geo-distributed clouds. It proposes modeling storage costs, intercloud traffic costs, and redistribution costs to approximate the total cost over time periods. The system aims to minimize monetary expenses while ensuring quality of service and data availability. Key advantages include significantly reducing costs compared to existing approaches by leveraging social locality and optimizing placements across clouds. Modules include constructing the social networking system, and modeling different cost components to solve a series of optimization problems.

Improved Good put using Harvest-Then-Transmit Protocol for Video Transfer

Eswar Publications

In multiple wireless networks, large end-to-end delay and packet losses can decrease meaningfully the traffic flow goodput due to path irregularity and multiplicity. To report these problems, current methods are proposed by using management of queue and decision making process. Hence, this paper proposesa Harvest-Then-Transmit (HTT) Protocol which selects an energy efficient path based on multiple parameters i.e. energy, delay, transmission time and perform transmission of video to handle number of video packets. A multipath environment is establishing where a server performs transferring of video along the energy efficient path of wireless network. Simulation shows the proposed protocol improves the overall goodput up to 10%, increases packet delivery rate up to 12%, and reduces end-to-end delay up to 3%, compared to existing system.

Simulation Based Analysis of Bee Swarm Inspired Hybrid Routing Protocol Param...

Editor IJCATR

Vehicular Ad-hoc Networks (VANET's) are basically emanated from Mobile Ad hoc networks (MANET's) in which vehicles act as the mobile nodes, the nodes are vehicles on the road and mobility of these vehicles are very high. The main objective of VANET is to enhance the safety and amenity of road users. It provides intelligent transportation services in vehicles with the automobile equipment to communicate and co-ordinates with other vehicles in the same network that informs the driver’s about the road status, unseen obstacles, internet access and other necessary travel service information’s. The evaluation of vehicular ad hoc networks applications in based on the simulations. A Realistic Mobility model is a basic component for VANET simulation that ensures that conclusion drawn from simulation experiments will carry through to real deployments. This paper attempts to evaluate the performance of a Bee swarm inspired Hybrid routing protocol for vehicular ad hoc network, that protocol should be tested under a realistic condition including, representative data traffic models, and the realistic movement of the mobile nodes which are the vehicles. In VANET the simulation of Realistic mobility model has been generated using SUMO and MOVE software and network simulation has been performed using NS2 simulator, we conducted performance evaluation based on certain metric parameters such as packet delivery ratio, end-to-end delay and normalized overhead ratio.

IRJET- Real Time Bus Disaster Management System

IRJET Journal

This document proposes a real-time bus disaster management system. It summarizes existing systems that allow for bus ridesharing but lack features like bus breakdown notification. The proposed system would allow passengers to book tickets online, see bus schedules and seat availability on a mobile app or website. It would also notify passengers of any bus breakdowns or delays in real-time. If issues arise, drivers could update the system server, which would then inform passengers to reduce inconveniences. The system aims to make transportation easier and more convenient for passengers compared to traditional manual methods.

A Fuzzy Based Dynamic Queue Management Approach to Improve QOS in Wireless se...

IJARIDEA Journal

Abstract— Wireless Sensor Networks (WSNs) are predicted to be the following iteration of networks which will kind an indispensable a part of man’s lives and which furnish a bridge between the true bodily and virtual worlds. WSNs will have to be able to aid more than a few functions over the same platform. Specific applications would have unique QoS requirements helping the preliminary specifications for delivering Quality of services (QoS), which is fundamental for numerous purposes, is directly concerning energy consumption, delay, reliability, distortion, and community lifetime. There may be an inevitable correlation between quality of accessible service levels in WSNs and power consumption in these networks, while acquiring any of those bases acquires the influential interface on the other. Keywords—Data integrity, Delay differentiated services, Dynamic routing, Potential field, Wireless sensor networks.

Java Web Application Project Titles 2023-2024.pdf

FooDNet: Toward an Optimized Food Delivery Network based on Spatial Crowdsourcing

Recommended

Recommended

More Related Content

Similar to FooDNet: Toward an Optimized Food Delivery Network based on Spatial Crowdsourcing

Similar to FooDNet: Toward an Optimized Food Delivery Network based on Spatial Crowdsourcing (20)

More from JAYAPRAKASH JPINFOTECH

More from JAYAPRAKASH JPINFOTECH (20)

Recently uploaded

Recently uploaded (20)

FooDNet: Toward an Optimized Food Delivery Network based on Spatial Crowdsourcing