An attractors-based particle swarm optimization for multiobjective capacitated vehicle routing problem

In this paper, a new multiobjective discrete particle swarm algorithm is presented for the Capacitated vehicle routing problem. The binary algorithm integrates particle displacement based on local attractors, a crowding distance as elitism policy and genetic operators. The proposed approach is first implemented on a set of well-known benchmarks for single-objective capacitated vehicle routing problems and compared to results underlined in the literature. The obtained results demonstrate its ability to achieve the main optimization solution and sometimes prove its efficiency from other given techniques. Then, the approach is applied to an academical example for the multiobjective Urban Bus Routing Problem with Route Balancing.

Novel Concepts of Domination in Vague Graphs with Application in Medicine

VG can manage the uncertainty relevant to the inconsistent and indeterminate information of all real-world problems, in which FGs possibly will not succeed in bringing about satisfactory results. The previous definitions’ restrictions in FGs have made us present new definitions in VGs. A wide range of applications have been attributed to the domination in graph theory for several fields such as facility location problem, school bus routing, modeling biological networks, and coding theory. Therefore, in this research, we study several concepts of domination, such as restrained dominating set (RDS), perfect dominating set (PDS), global restrained dominating set (GRDS), total k -dominating set, and equitable dominating set (EDS) in VGs and also introduce their properties by some examples. Finally, we try to represent the application and importance of domination in the field of medical science and discuss the topic in today’s world, namely, the corona vaccine.

Topology-Aware Bus Routing in Complex Networks of Very-Large-Scale Integration with Nonuniform Track Configurations and Obstacles

As one of the most important routing problems in the complex network within a very-large-scale integration (VLSI) circuit, bus routing has become much more challenging when witnessing the advanced technology node enters the deep nanometer era because all bus bits need to be routed with the same routing topology in the context. In particular, the nonuniform routing track configuration and obstacles bring the largest difficulty for maintaining the same topology for all bus bits. In this paper, we first present a track handling technique to unify the nonuniform routing track configuration with obstacles. Then, we formulate the topology-aware single bus routing as an unsplittable flow problem (UFP), which is integrated into a negotiation-based global routing to determine the desired routing regions for each bus. A topology-aware track assignment is also presented to allocate the tracks to each segment of buses under the guidance of the global routing result. Finally, a detailed routing scheme is proposed to connect the segments of each bus. We evaluate our routing result with the benchmark suite of the 2018 CAD Contest. Compared with the top-3 state-of-the-art methods, experimental results show that our proposed algorithm achieves the best overall score regarding specified time limitations.

A NOVEL PRIVACY PRESERVATION MECHANISM FOR DATA AND USER IN DISTRIBUTED SERVERS

Advances in sensing and monitoring science allow location-based purposes however they additionally create tremendous privateness risks. Anonymity can supply a excessive diploma of privacy, retailer provider customers from dealing with carrier providers’ privateness policies, and limit the carrier providers’ necessities for safeguarding non-public information. However, guaranteeing nameless utilization of location-based offerings requires that the particular region facts transmitted via a person can't be without difficulty used to re-identify the subject. This paper provides a middleware structure and algorithms that can be used by using a centralized place dealer service. The adaptive algorithms regulate the decision of region data alongside spatial or temporal dimensions to meet distinct anonymity constraints based totally on the entities who can also be the use of place offerings inside a given area. Using a mannequin based totally on car site visitors counts and cartographic material, we estimate the realistically anticipated spatial decision for extraordinary anonymity constraints. The median decision generated with the aid of our algorithms is a hundred twenty five meters. Thus, nameless location-based requests for city areas would have the identical accuracy presently wanted for E-911 services; this would supply enough decision for wayfinding, automatic bus routing offerings and comparable location-dependent services.