Filters








15,410 Hits in 5.8 sec

OPTIMIZATION OF PERIODIC UNITARY ONLINE SCHEDULE OF TRANSPORT TASKS OF HIGHWAY ROAD TRAINS

Myroslav OLISKEVYCH
2018 Transport Problems  
the absence of idle runs and with minimal time delays of the process.  ...  The paper is devoted to the problem of optimization of transport tasks' execution schedule. The exploitation of a group of interdependent highway road trains is considered.  ...  Thus, the problem of routing and scheduling of road trains forms a complex task.  ... 
doi:10.21307/tp.2018.13.1.10 fatcat:o65rou2o3fhurkv7hnjt6srryy

Energy-efficient roadside unit scheduling for maintaining connectivity in vehicle ad-hoc network

Feng Zou, Jiaofei Zhong, Weili Wu, Ding-Zhu Du, Junghoon Lee
2011 Proceedings of the 5th International Confernece on Ubiquitous Information Management and Communication - ICUIMC '11  
Given a set of deployed RSUs, our objective is to find the optimal schedule of turning them on and off within a given time period so that the overall energy consumption of RSUs in the system is minimized  ...  The snapshot scheduling problem decides the minimum number of active RSUs needed for a snapshot of the VANET at a given time point, while the snapshot selection problem decides a sequence of time points  ...  As for the maximum degree of vertices representing the RSUs, the maximum number will depend on two factors. First, it depends on the time.  ... 
doi:10.1145/1968613.1968691 dblp:conf/icuimc/ZouZWDL11 fatcat:4q3s7fyl2ffmrnlhpgqv5hcijy

The Use of UAVs, SDN, and Augmented Reality for VANET Applications

Maria MAKOLKINA, Alexander PARAMONOV, Andrei VLADYKO, Roman DUNAYTSEV, Ruslan KIRICHEK, Andrey KOUCHERYAVY
2018 DEStech Transactions on Computer Science and Engineering  
In this paper, we propose a model for traffic light control and coordination along the route of emergency vehicles (fire, police, and ambulance), in which an unmanned aerial vehicle (UAV) acts as an SDN  ...  It should be noted that this graph includes only those vertices and arcs (intersections and roads) that can be used in the route.  ...  For a formal description of the model, let us consider a road network in the form of a graph G, where vertices v are intersections and arcs e are roads. In the general case, it is an oriented graph.  ... 
doi:10.12783/dtcse/aiie2017/18244 fatcat:h2kvfu2mwrcpnkuobn3htlojke

SBUS: Smart e-Bus Battery Substitution Scheme in Vehicular Networks

Jihyeok Seo, Jaehoon Jeong, Hyoungshick Kim, Jung-Soo Park
2015 2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops  
To the best of our knowledge, our scheme is the first attempt to investigate the efficient battery replacement of e-Buses in road networks, based on the trajectories (i.e., travel routes) of e-Buses in  ...  road networks.  ...  This bipartite graph is a time-dependent graph whose edge is related to the battery exchange time interval. VI.  ... 
doi:10.1109/waina.2015.106 dblp:conf/aina/SeoJKP15 fatcat:7sc57tzoyba2dcgqqam6ud2tse

Optimization Models for a Real-World Snow Plow Routing Problem [chapter]

Joris Kinable, Willem-Jan van Hoeve, Stephen F. Smith
2016 Lecture Notes in Computer Science  
The models are evaluated on a set of snow plow routing problems of various sizes, constructed using Open Streets map data of Pittsburgh PA.  ...  In cold weather cities, snowstorms can have a significant disruptive effect on both mobility and safety, and consequently the faster that streets can be cleared the better.  ...  The objective is to minimize the duration of the longest route, i.e. to minimize the makespan of the schedule. The road network is modeled as a mixed multigraph.  ... 
doi:10.1007/978-3-319-33954-2_17 fatcat:6dhdoysdbffwdkjax3uxvpeq3m

Algorithm for Route Planning via Facilities with Time Dependent

Pramod SinghRathore, Atul Chaudhary
2013 International Journal of Computer Applications  
We present here a algorithm on route planning which minimize the distance as well as time from source to destination. Keywords Location-based services, nearest query, Road network, and Route planning.  ...  This paper focus on algorithm for optimal route planning via facility ( i.e petrol, grocery etc) with time dependent shortest path.  ...  Travel time=arrival time-departure time To understand this we explain with time dependent graph as Example: A road network can be representing as time dependent graph.  ... 
doi:10.5120/10640-5393 fatcat:gw3kizyixrazrllwcv4segoqgu

Joint optimization of green vehicle scheduling and routing problem with time-varying speeds

Dezhi Zhang, Xin Wang, Shuangyan Li, Nan Ni, Zhuo Zhang, Xiaolei Ma
2018 PLoS ONE  
A joint optimization model of the green vehicle scheduling and routing problem with time-varying speeds is presented in this study.  ...  departure time saves on fuel consumption and reduces CO 2 emissions by up to 5.4%, and (3) extra driver wages have significant effects on routing and departure time slot decisions.  ...  We also study the optimization problem of the routes and the schedules of a fleet of delivery vehicles that minimize the fuel emissions in a road network where speed depends on time.  ... 
doi:10.1371/journal.pone.0192000 pmid:29466370 pmcid:PMC5821442 fatcat:qgaogk2ohjhylproyjqeahaete

THE OPTIMIZATION OF TRUCKS FLEET SCHEDULE IN VIEW OF THEIR INTERACTION AND RESTRICTIONS OF THE EUROPEAN AGREEMENT OF WORK OF CREWS

Myroslav OLISKEVYCH, Stepan KOVALYSHYN, Myron MAGATS, Viktor SHEVCHUK, Oleh SUKACH
2020 Transport Problems  
Each of the subgraphs reflects alternative routes and schedules of a truck. The model also includes restrictions on the total cycle time and active period duration of available unloading points.  ...  The importance of compliance with the schedule of work of road trains on the highway transport network of the European Union is shown.  ...  The time required by the driver to comply with the rules of the AETR is spent to execute orders. The choice of schedule options depends on the duration of movement and idle time.  ... 
doi:10.21307/tp-2020-028 fatcat:4i4wtfefqzdqzcasqyu2elrhdu

Page 7230 of Mathematical Reviews Vol. , Issue 97K [page]

1997 Mathematical Reviews  
The objective is to find a routing schedule of the vehicle that minimizes the completion time, denoted by C (i.e., the time to return to vp after processing all tasks).  ...  Summary: “In a given graph with n vertices, a routing is defined as a set of n(n — 1) routes, one route connecting each ordered pair of vertices.  ... 

Time- Dependent Multiple Depot Vehicle Routing Problem on Megapolis Network under Wardrop's Traffic Flow Assignment

Alexander V. Mugayskikh, Victor V. Zakharov, Tero Tuovinen
2018 2018 22nd Conference of Open Innovations Association (FRUCT)  
It's worth mentioning that travel time on route depends on topology of nodes (addresses of clients in problem instance) on city graph.  ...  The benefits of time-dependent vehicle routing and scheduling systems were also demonstrated in [11] by using real-world data for the road network in the north west of England.  ... 
doi:10.23919/fruct.2018.8468273 dblp:conf/fruct/MugayskikhZT18 fatcat:jh2lg7fnxbcfhosqgzkxytilda

Physiology-Aware Rural Ambulance Routing [article]

Mohammad Hosseini, Richard B. Berlin Jr., Lui Sha
2017 arXiv   pre-print
We mathematically model the problem into an NP-hard graph theory problem, and approximate a solution based on a trade-off between communication coverage and shortest path.  ...  From a patient care perspective, transport during critical illness can make route selection patient state dependent.  ...  Our physiology-aware route scheduling algorithms aims to select the most optimum route for an en-route ambulance depending on the underlying disease and the criticality of real-time continuous monitoring  ... 
arXiv:1706.10290v1 fatcat:gn36vdz3l5ekbfvv3omz4jpewe

Online Cruising Mile Reduction in Large-Scale Taxicab Networks

Desheng Zhang, Tian He, Shan Lin, Sirajum Munir, John A. Stankovic
2015 IEEE Transactions on Parallel and Distributed Systems  
Based on a weighted cruising graph, when a taxicab becomes vacant, pCruise provides a distributed online scheduling strategy to obtain and update an efficient cruising route with the minimum length and  ...  According to the real-time pick-up events from nearby taxicabs, pCruise characterizes a cruising process with a cruising graph, and assigns weights on edges of the cruising graph to indicate the utility  ...  Cruising Graph The key objective of this section is based on a taxicab's weighted cruising graph to schedule a cruising route, which starts at its current location and includes several following road segments  ... 
doi:10.1109/tpds.2014.2364024 fatcat:vffjdshzvncq5duorbolv3agsm

Combinatorial optimization and Green Logistics

Abdelkader Sbihi, Richard W. Eglese
2009 Annals of Operations Research  
The paper particularly considers the topics of reverse logistics, waste management and vehicle routing and scheduling.  ...  Time-dependent vehicle routing The Time Dependent Vehicle Routing and Scheduling Problem (TDVRSP) consists in optimally routing a fleet of vehicles of fixed capacity when the traveling times between nodes  ...  depend on the time of the day that the trip on that arc was initiated.  ... 
doi:10.1007/s10479-009-0651-z fatcat:6htpex7fdbhelcascpyuowwwvy

Combinatorial optimization and Green Logistics

Abdelkader Sbihi, Richard W. Eglese
2007 4OR  
The paper particularly considers the topics of reverse logistics, waste management and vehicle routing and scheduling.  ...  Time-dependent vehicle routing The Time Dependent Vehicle Routing and Scheduling Problem (TDVRSP) consists in optimally routing a fleet of vehicles of fixed capacity when the traveling times between nodes  ...  depend on the time of the day that the trip on that arc was initiated.  ... 
doi:10.1007/s10288-007-0047-3 fatcat:z3hyopguova5zb4trc6lyzor3y

Scheduling Automated Traffic on a Network of Roads

A. Giridhar, P.R. Kumar
2006 IEEE Transactions on Vehicular Technology  
Our approach reduces the problem to a discrete-time graph scheduling problem, by defining an appropriate graph to model the road network.  ...  Our main result is a sufficient condition on the graph of the road network and on the initial distribution of vehicles, under which there exists a scheduling algorithm that is guaranteed to clear the system  ...  ONE-STEP SCHEDULING: CHOOSING A MOVE The next question that arises is: How do we choose a sequence of moves that minimizes the clearing time?  ... 
doi:10.1109/tvt.2006.877472 fatcat:jsbbknjswbgldfxpma533dxde4
« Previous Showing results 1 — 15 out of 15,410 results