Effectively Delivering XML Information in Periodic Broadcast Environments

Qin, Yongrui; Sheng, Quan Z.; Mehdi, Muntazir; Wang, Hua; Xie, De

doi:10.1007/978-3-642-40285-2_16

Cited by 3 publications

(2 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For solving large-scale multi-depot vehicle routing problem W. Tu et al, [7] proposed Bi-level Voronoi diagram-based metaheuristic. There are various methods namely Tabu search [8,9], Simulated annealing [10,11], Genetic approach [12], Ant colony optimization [13,14,20], Particle swarm optimization [15,16]. Genetic Algorithm (GA) takes less computation time and results in reasonable and optimal solutions when compared with further meta-heuristic algorithms.…”

Section: Depotsmentioning

confidence: 99%

EODVGA: An Enhanced ODV Based Genetic Algorithm for Multi-Depot Vehicle Routing Problem

Prabu¹,

Ravisasthiri²,

Sriram

et al. 2019

ICST Transactions on Scalable Information Systems

View full text Add to dashboard Cite

Multi-Depot Vehicle Routing Problem (MDVRP) is a familiar combinative optimization problem that simultaneously determines the direction for different vehicles from over one depot to a collection of consumers. Researchers have suggested variety of meta-heuristic and heuristic algorithms to elucidate MDVRP, but none of the existing technique has improved the fitness of the solution at the time of initial population generation. This motivates to propose an enhanced ODV based population initialization for Genetic Algorithm (GA) to solve MDVRP effectively. The Ordered Distance Vector (ODV) based population seeding method is a current and effective population initialization method for Genetic Algorithm to produce an early population with quality, individual diversity and randomness. In the proposed model, the customers are first grouped based on distance to their nearest depots and then routes are scheduled and optimized using enhanced ODV based GA. The experiments are performed based on different types of instances of Cordeau. From the experimental results, it is very clear that the proposed technique outperforms the existing techniques in terms of convergence rate, error rate and convergence diversity

show abstract

Section: Depotsmentioning

confidence: 99%

EODVGA: An Enhanced ODV Based Genetic Algorithm for Multi-Depot Vehicle Routing Problem

Prabu¹,

Ravisasthiri²,

Sriram

et al. 2019

ICST Transactions on Scalable Information Systems

View full text Add to dashboard Cite

show abstract

“…A preliminary version of this paper appeared in [18], where the emphasis is focused on the introduction of the data placement algorithms and preliminary experiments. This paper significantly extends the work in [18] from the following aspects, including: (1) a detailed theoretical analysis on the data placement problem is presented, which forms the basis of the data placement algorithms; (2) a more detailed and rigorous time complexity analysis of the proposed data placement algorithms is provided; (3) a more detailed introduction of Index Distribution Strategy facilitating the understanding of used indexing schemes in this proposed work is added; (4) experiments on two more data sets and more experimental results are presented to further show the applicability and low maintenance cost of the proposed data placement algorithms.…”

Section: Introductionmentioning

confidence: 99%

Organizing XML Data in a Wireless Broadcast System by Exploiting Structural Similarity

Qin

Sheng

Wang

et al. 2017

Wireless Pers Commun

Self Cite

View full text Add to dashboard Cite

Wireless data broadcast is an efficient way of delivering data of common interest to a large population of mobile devices within a proximate area, such as smart cities, battle fields, etc. In this work, we focus ourselves on studying the data placement problem of periodic XML data broadcast in mobile and wireless environments. This is an important issue, particularly when XML becomes prevalent in today's ubiquitous and mobile computing devices and applications. Taking advantage of the structured characteristics of XML data, effective broadcast programs can be generated based on the XML data on the server only. An XML data broadcast system is developed and a theoretical analysis on the XML data placement on a wireless channel is also presented, which forms the basis of the novel data placement algorithm in this work. The proposed algorithm is validated through a set of experiments. The results show that the proposed algorithm can effectively place XML data on air and significantly improve the overall access efficiency.

show abstract

Efficient Algorithms for Scheduling XML Data in a Mobile Wireless Broadcast Environment

Qin

Wang

Zhang

et al. 2015

2015 IEEE 21st International Conference on Parallel and Distributed Systems (ICPADS)

View full text Add to dashboard Cite

Effectively Delivering XML Information in Periodic Broadcast Environments

Cited by 3 publications

References 19 publications

EODVGA: An Enhanced ODV Based Genetic Algorithm for Multi-Depot Vehicle Routing Problem

EODVGA: An Enhanced ODV Based Genetic Algorithm for Multi-Depot Vehicle Routing Problem

Organizing XML Data in a Wireless Broadcast System by Exploiting Structural Similarity

Efficient Algorithms for Scheduling XML Data in a Mobile Wireless Broadcast Environment

Contact Info

Product

Resources

About