20 Hits in 3.6 sec

Approximations for minimum and min-max vehicle routing problems

Esther M. Arkin, Refael Hassin, Asaf Levin
2006 Journal of Algorithms  
For all these problems we provide constant ratio approximation algorithms and prove their NP-hardness.  ...  We consider two types of problems: (1) Given a bound λ on the length of each path, find a minimum sized collection of paths that cover all the vertices of the graph, or all the edges from a given subset  ...  Min-max tree cover In this subsection we note that using the algorithm for the min-max path cover problem, we get a 4-approximation algorithm for the min-max tree cover problem as well.  ... 
doi:10.1016/j.jalgor.2005.01.007 fatcat:dfzdsajzwvhttcthk5apktmck4

A Balanced Route Design for Min-Max Multiple-Depot Rural Postman Problem (MMMDRPP): a police patrolling case

Huanfa Chen, Tao Cheng, John Shawe-Taylor
2017 International Journal of Geographical Information Science  
In this research, we formulate this routing problem as a Min-Max Multiple-Depot Rural Postman Problem (MMMDRPP).  ...  Designing effective and balanced routes for these applications is challenging, especially when involving multiple postmen from distinct depots.  ...  Rui Sha (UCL-CEGE) for his help on this work. The authors would like to thank the editors Dr. May Yuan and Prof. Bo Huang, and two anonymous referees for their valuable comments and suggestions.  ... 
doi:10.1080/13658816.2017.1380201 fatcat:4zw6grlgmndgbik2fnpx4x7icq

DAWN: Energy efficient data aggregation in WSN with mobile sinks

ShaoJie Tang, Jing Yuan, XiangYang Li, Yunhao Liu, GuiHai Chen, Ming Gu, JiZhong Zhao, Guojun Dai
2010 2010 IEEE 18th International Workshop on Quality of Service (IWQoS)  
In this work, we investigate the optimum routing strategy for the static sensor network.  ...  Specially, we consider a more realistic model where the moving speed and path for mobile sinks are constrained.  ...  For the min-max k-Chinese postman problem (MM k-CPP) the aim is to minimize the length of the longest of the k tours.  ... 
doi:10.1109/iwqos.2010.5542765 dblp:conf/iwqos/TangYLLCGZD10 fatcat:d6p7vkhnt5atlmi3xokyarm4ei

Distributed node authentication in wireless sensor networks

Feng Yang, Xuehai Zhou
2010 2010 2nd International Conference on Future Computer and Communication  
Realistic models are established for these dynamic WSNs, and efficient distributed algorithms are developed to optimise network performance, including power management, duty cycling, wireless link scheduling  ...  In distributed optimisation, sensor nodes communicate with each other to collaboratively solve the overall network optimisation problem.  ...  interval. algorithm returns D max x (l), the optimal solution to the problem (3.9), if it exists; otherwise, LPM algorithms returns D min .  ... 
doi:10.1109/icfcc.2010.5497835 fatcat:cnuk5y3arjdxxkhhrpoksskuzm

Moving Objects in Networks Databases [chapter]

Victor Teixeira de Almeida
2006 Lecture Notes in Computer Science  
Thus, the minimum position of the object at some time t, t 1 < t < t 2 , p min (t) is p min (t) = max p 1 + max{v 1 − ψ, 0} (t − t 1 ) , (1) p 1 − ξ + p 2 − p 1 t 2 − t 1 (t − t 1 ) , (2) p 2 − min{v 1  ...  two measurement points p 1 and p 2 at times t 1 and t 2 , respectively. p max (t) = min p 1 + min{v 1 + ψ, v max } (t − t 1 ) , (4) p 1 + ξ + p 2 − p 1 t 2 − t 1 (t − t 1 ) , (5) p 2 − max{v 1 − ψ, 0}  ...  Dijkstra's algorithm is a well known solution to this problem.  ... 
doi:10.1007/11896548_8 fatcat:iim3mtyzpveynh4rnpgub2g57u

Proceedings of the IX International Workshop on Locational Analysis and Related Problems [article]

Marta Baldomero-Naranjo, Inmaculada Espejo-Miranda, Luisa I. Martínez-Merino, Juan Manuel Muñoz-Ocaña, Antonio M. Rodríguez-Chía
2020 arXiv   pre-print
The topics of interest are location analysis and related problems.  ...  The International Workshop on Locational Analysis and Related Problems will take place during January 30-February 1, 2019 in C\'adiz (Spain).  ...  In this expression, w s is the weight related to stratum s, I s ⊆ I is the subset of demand sites where stratum s is present and d(I s , P ) = max i∈I s min j∈P d ij .  ... 
arXiv:2002.08300v1 fatcat:g3nupnp2kfb7fnjno45nx2kvym

Proceedings of the X International Workshop on Locational Analysis and Related Problems [article]

Maria Albareda-Sambola, Marta Baldomero-Naranjo, Luisa I. Martínez-Merino, Diego Ponce, Miguel A. Pozo, Justo Puerto, Victoria Rebillas-Loredo.
2020 arXiv   pre-print
The topics of interest are location analysis and related problems.  ...  The International Workshop on Locational Analysis and Related Problems will take place during January 23-24, 2020 in Seville (Spain).  ...  We propose a heuristic method for this problem that is based on an approximation on trees.  ... 
arXiv:2002.01702v1 fatcat:kl2ip2zyv5gorbdcktdq5przsa

Opportunistic mobile air pollution monitoring: A case study with city wardens in Antwerp

Joris Van den Bossche, Jan Theunis, Bart Elen, Jan Peters, Dick Botteldooren, Bernard De Baets
2016 Atmospheric Environment  
But, they also emphasize the need for repeated measurements and careful processing and interpretation of the data.  ...  The Antwerp city wardens are outdoors for a large part of the day on surveillance tours by bicycle or on foot, and gathered a total of 393 hours of measurements.  ...  We would like to thank the city of Antwerp, Environmental Services and especially the city wardens (Dienst Samen Leven -Stadstoezicht) for the collaboration.  ... 
doi:10.1016/j.atmosenv.2016.06.063 fatcat:z7mhsncv5rfojlj7o5acxro7dq

Approximating min-max k-clustering

Asaf Levin, Steven Brams, Kirk Pruhs, Gerhard Woeginger
For this problem we present a $(2k-1)$-approximation algorithm for $kgeq 3$, a 2-approximation algorithm for $k=2$, and we also show a lower bound of $k$ on the performance guarantee of any polynomial-time  ...  algorithm.  ...  The MIN-MAX RURAL POSTMEN COVER PROB-LEM is defined as follows. The input is a complete graph G = (N, E), a length function l : E → R + , a subset E ⊆ E, and an integer number k > 0.  ... 
doi:10.4230/dagsemproc.07261.4 fatcat:mziwuhpxsrh2xoviaqrjep4xwm

$$\hbox {NB}^{3}$$ NB 3 : a multilateral negotiation algorithm for large, non-linear agreement spaces with limited time

Dave de Jonge, Carles Sierra
2014 Autonomous Agents and Multi-Agent Systems  
We conclude that the algorithm is able to decrease the costs of the agents significantly, that the heuristic search is efficient and that the algorithm scales well with increasing complexity of the problem  ...  We present the Negotiating Salesmen Problem (NSP): a variant of the Traveling Salesman Problem with multiple negotiating agents, as a test case.  ...  A simplified version of this problem with postmen exchanging letters was studied in [40] .  ... 
doi:10.1007/s10458-014-9271-3 fatcat:aqb2twxbezbzng3jgyvndxuo5a

Mobility Prediction Using a Weighted Markov Model Based on Mobile User Classification

Ming Yan, Shuijing Li, Chien Aun Chan, Yinghua Shen, Ying Yu
2021 Sensors  
according to the characteristics of each user classification, the step threshold and the weighting coefficients of the weighted Markov prediction model are optimized, and mobility prediction is performed for  ...  Second, classification criteria are proposed based on different user behavior patterns, and all users are classified with machine learning algorithms.  ...  Acknowledgments: The research team would like to thank the anonymous reviewers for their critical comments and suggestions to improve the manuscript.  ... 
doi:10.3390/s21051740 pmid:33802421 pmcid:PMC7959290 fatcat:3h52ljjhufhwhamgr2avo3b7ei

Multi-robot Dubins Coverage with Autonomous Surface Vehicles [article]

Nare Karapetyan, Jason Moulton, Jeremy S. Lewis, Alberto Quattrini Li, Jason M. O'Kane, Ioannis Rekleitis
2018 pre-print
As such, we present two heuristics methods based on a variant of the traveling salesman problem -- k-TSP -- formulation and clustering algorithms that efficiently solve the problem.  ...  In particular, we propose a novel approach for solving the problem of complete coverage of a known environment by a multi-robot team consisting of Dubins vehicles.  ...  For example, a flying vehicle with 30 min battery life and an average speed of 40 km/h can cover a trajectory of 20 km, while an autonomous surface vehicle (ASV), moving at 10 kn (5 m/s) for five hours  ... 
doi:10.1109/icra.2018.8460661 arXiv:1808.02552v1 fatcat:4k7o2n46fncu7cnse7xmdlw26y

A Survey of Delay Tolerant Networks Routing Protocols [article]

Zhenxin Feng, Kwan-Wu Chin
2012 arXiv   pre-print
) Weighted Global Max-Min Fair (WGMMF), in which data is prioritized by weight.  ...  They propose four scheduling algorithms to manage the said hard disks: (i) First Come First Serve (FCFS), in which data is loaded onto trains according to their arrival time; (ii) Local Max-Min Fair Algorithm  ...  dynamic DTNs the same bundles DTBR [99] Uses Dijkstra algorithm Transmission cost Bundles cannot be Same group ID between nodes transmitted between groups in the same group GBR [99] Uses STBR between  ... 
arXiv:1210.0965v1 fatcat:pgjt6jacdnc53iondhowfcat6a

A Decade of Capacitated Arc Routing [chapter]

Sanne Wøhlk
Operations Research/Computer Science Interfaces Series  
The key problem within this area is the Capacitated Arc Routing Problem (CARP), which is the arc routing counterpart to the vehicle routing problem.  ...  Furthermore, several interesting variations of the problem have been studied. We survey the latest research within the area of arc routing focusing mainly on the CARP and its variants.  ...  Acknowledgement The author would like to thank anonymous referees for their suggestions for improving this chapter.  ... 
doi:10.1007/978-0-387-77778-8_2 fatcat:vnqzfvcchbdzfjwr33qpf3r63m

Adaptive Large Neighborhood Search

Roman Lutz, Universität Ulm
LNS is especially useful for problems with a tightly constrained search space, such as the Rich Pickup and Delivery Problem with Time Windows (RPDPTW).  ...  The ALNS heuristic has also been implemented, extended, tuned and tested for different problem instances. The test results confirm the promising results obtained by other papers.  ...  repair heuristics η r 1 r 2 r 3 ρ d d min d max − d min 3 3 Table 7 : 7 The configuration and results of the second tuning.  ... 
doi:10.18725/oparu-3237 fatcat:ic77vo5hubgk3a6ucbgiuayode
« Previous Showing results 1 — 15 out of 20 results