Greenhouse gases (GHG) are the main reason for the global warming during the past decades. On the other hand, establishing a well-structured transportation system will yield to create least cost-pollution. This paper addresses a novel model for the multi-trip Green Capacitated Arc Routing Problem (G-CARP) with the aim of minimizing total cost including the cost of generation and emission of greenhouse gases, the cost of vehicle usage and routing cost. The cost of generation and emission of greenhouse gases is based on the calculation of the amount of carbon dioxide emitted from vehicles, which depends on such factors as the vehicle speed, weather conditions, load on the vehicle and traveled distance. The main applications of this problem are in municipalities for urban waste collection, road surface marking and so forth. Due to NP-hardness of the problem, a Hybrid Genetic Algorithm (HGA) is developed, wherein a heuristic and simulated annealing algorithm are applied to generate initial solutions and a Genetic Algorithm (GA) is then used to generate the best possible solution. The obtained numerical results indicate that the proposed algorithm could present desirable performance within a suitable computational run time. Finally, a sensitivity analysis is implemented on the maximum available time of the vehicles in order to determine the optimal policy. © 2018 by the authors.

Arun Kumar S

Department of Information Security

School of Computer Science and Engineering

Vellore Campus

Tirkolaee E.B

Hosseinabadi A.A.R

Soltani M

Wang J.

Fulltext

Vellore Institute of Technology (VIT) is a private university located in&nbsp;Tamil Nadu, India. Founded in 1984, as Vellore Engineering College, the institution offers 20 undergraduate, 34 postgraduate, four integrated and four research programs. It has campuses in Vellore, Amravati, Bhopal and Chennai.

VIT is one of the top ranked private universities in India according to NIRF, THE and QS Rankings.&nbsp;Govt. of India has recognized&nbsp;VIT, Vellore as an&nbsp;Institution of Eminence. This has allowed VIT to take independent quality initiatives and move up in world ranking.

&nbsp;

&nbsp;

VIT University

Sustainability

In wireless sensor networks (WSNs), sensor devices must be equipped with the capabilities of sensing, computation and communication. These devices work continuously through non-rechargeable batteries under harsh conditions, the batter span of nodes determines the whole network lifetime. Network clustering adopts an energy neutral approach to extend the network life. The clustering methods can be divided into even and uneven clustering. If even clustering is adopted, it will cause the cluster head nodes (CHs) in vicinity of the base station to relay more data and cause energy hole phenomenon. Therefore, we adopt a non-uniform clustering method to alleviate the problem of energy hole. Furthermore, to further balance and remit resource overhead of the entire network, we combined the PEGASIS algorithm and the Hamilton loop algorithm, through a mixture of single-hop and multiple hops mechanisms, inserting a mobile agent node (MA) and designing an optimal empower Hamilton loop is obtained by the local optimization algorithm. MA is responsible for receiving and fusing packet from the CHs on the path. Network performance results show that the proposed routing algorithm can effectively prolong network lifetime, equalize resource expenditure and decrease the propagation delay. © 2019, The Author(s).

Human-centric Computing and Information Sciences

An empower hamilton loop based data collection algorithm with mobile agent for WSNs

Cyber physical system (CPS) is facing enormous security challenges because of open and interconnected network and the interaction between cyber components and physical components, the development of cyber physical systems is constrained by security and privacy threats. A feasible solution is to combine the fully homomorphic encryption (FHE) technique to realize the efficient operation of ciphertext without decryption. However, most current homomorphic encryption algorithms only support limited data types, making it difficult to be widely applied in actual environment. To address this limitation, we propose a parallel fully homomorphic encryption algorithm that supports floating-point numbers. The proposed algorithm not only expands the data types supported by the existing fully homomorphic encryption algorithms, but also utilizes the characteristics of multi-nodes in cloud environment to conduct parallel encryption through simultaneous group-wise ciphertext computations. The experimental results show that, in a 16-core 4-node cluster with MapReduce environment, the proposed encryption algorithm achieves the maximum speed-up exceeding 5, which not only solves the limited application problem of the existing fully homomorphic encryption algorithm, but also meets the requirements for the efficient homomorphic encryption of floating-point numbers in cloud computing environment. © 2019, The Author(s).

EURASIP Journal on Wireless Communications and Networking

A privacy protection-oriented parallel fully homomorphic encryption algorithm in cyber physical systems

This study addresses the multi-objective multi-mode resource-constrained project scheduling problem with payment planning where the activities can be done through one of the possible modes and the objectives are to maximize the net present value and minimize the completion time concurrently. Moreover, renewable resources including manpower, machinery, and equipment as well as non-renewable ones such as consumable resources and budget are considered to make the model closer to the real-world. To this end, a non-linear programming model is proposed to formulate the problem based on the suggested assumptions. To validate the model, several random instances are designed and solved by GAMS-BARON solver applying the ε-constraint method. For the high NP-hardness of the problem, we develop two metaheuristics of non-dominated sorting genetic algorithm II and multi-objective simulated annealing algorithm to solve the problem. Finally, the performances of the proposed solution techniques are evaluated using some well-known efficient criteria. © 2019, Springer-Verlag GmbH Austria, part of Springer Nature.

Computing

Multi-objective multi-mode resource constrained project scheduling problem using Pareto-based algorithms

Edge computing provides a unified platform for computing, networking, and storage resources, enabling data to be processed in a timely and efficient manner near the source. Thus, it has become the basic platform for industrial Internet of things (IIoT). However, computing′s unique features have also introduced new security problems. To solve the problem, in this paper, blockchain-based identity management combining access control mechanism is designed under edge computing. The self-certified cryptography is utilized to realize the registration and authentication of network entities. We bind the generated implicit certificate to its identity and construct the identity and certificate management mechanism based on blockchain. Secondly, an access control mechanism based on Bloom filter is designed and integrated with identity management. Moreover, for secure communication in resource-constrained edge devices, a lightweight secret key agreement protocol based on self-authenticated public key is constructed. These mechanisms work together to provide data security guarantees for IIoT such as authentication, auditability, and confidentiality.

Applied Sciences

Identity Management and Access Control Based on Blockchain under Edge Computing for the Industrial Internet of Things

In contrast to conventional preprocessing aided spatial modulation (PSM), which carries partial information using the indexes of receive antennas, we exploit one receive antenna to implicitly convey information and meanwhile harvest energy at the remaining antennas. Based on this, we propose two novel beamforming schemes. The first scheme is to maximize the sum energy harvested by the receiver. And the second scheme is to maximize the minimum receiving power on each antenna except for the antenna that conveys information. A closed form solution and an iterative algorithm are given, respectively. Simulation results demonstrate that proposed two schemes can harvest a certain amount of energy with nearly same achievable rate compared to the benchmark schemes. But the second scheme is superior to the first scheme and PSM scheme in terms of bit error rate (BER) performance. © 2019 - IOS Press and the authors.

Journal of Intelligent & Fuzzy Systems

Beamforming aided SSK modulation for MIMO system with energy harvesting

The urban waste collection problem and its disposal activities are among the most important municipal services involving many operational issues. In this paper, a mixed-integer linear programming (MILP) model was developed for the multi-trip Capacitated Arc Routing Problem (CARP) in order to minimize total cost. In the proposed model, depots and disposal facilities were located in different places. In order to validate the proposed model, several small-sized instances were solved by the CPLEX solver of GAMS software. Then, a hybrid algorithm using the Taguchi parameter design method was developed based on an improved Max-Min Ant System (IMMAS) to solve well-known test problems and large-sized instances. Computational results show high efficiency for the proposed algorithm. © 2018 Elsevier Ltd

Computers & Electrical Engineering

An improved ant colony optimization for the multi-trip Capacitated Arc Routing Problem

Who's Who

Levin, David Saul, (born 28 Jan. 1962), Chief Executive, McGraw-Hill Education, New York, since 2014

Waste Management

A robust periodic capacitated arc routing problem for urban waste collection considering drivers and crew’s working time

Expert Systems with Applications

A Fuel Efficient Green Vehicle Routing Problem with varying speed constraint (F-GVRP)

Neural Computing and Applications

OVRP_GELS: solving open vehicle routing problem using the gravitational emulation local search algorithm

A Hybrid Genetic Algorithm for Multi-Trip Green Capacitated Arc Routing Problem in the Scope of Urban Services

Journal	Sustainability
Publisher	MDPI AG
ISSN	20711050
Open Access	Yes