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

Abstract

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.

Developing an applied algorithm for multi-trip vehicle routing problem with time windows in urban waste collection: A case study

“…Therefore, an innovative algorithm for generating an initial solution and a SA is proposed to solve the problem. Many studies have been carried out on using this algorithm to solve optimization problems with various purposes, which indicates the high efficiency of SA for solving routing problems (Tirkolaee et al, 2018a(Tirkolaee et al, , 2018b(Tirkolaee et al, , 2018c.…”

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

“…In recent years, various technologies have been broadly used for data privacy protection, such as private information retrieval [6][7][8][9][10][11], searchable encryption [12][13][14][15][16][17], and secure multi-party computation [18][19][20][21][22][23], but these technologies can only provide limited functions, such as keyword search, order search, range query, and subset search. However, for many application scenarios in the cloud environment, it requires various types operations of ciphertext data.…”

PFARS: Enhancing throughput and lifetime of heterogeneous WSNs through power‐aware fusion, aggregation, and routing scheme

“…In the literature, data fusion and aggregation mechanisms are centered on how to efficaciously use the on‐board batteries of sensor nodes to enhance the WSNs' lifetime . These approaches utilize different mechanisms proposed in the literature such as fuzzy set theory, sampling techniques, theory of probability, a hybrid of fuzzy set and probability, and evidence theory proposed by Dempster‐Shafer . These approaches are well‐suited in WSN's scenario where data redundancy/duplication is a common issue.…”

“…[15][16][17] These approaches utilize different mechanisms proposed in the literature such as fuzzy set theory, sampling techniques, theory of probability, a hybrid of fuzzy set and probability, and evidence theory proposed by Dempster-Shafer. [18][19][20][21] These approaches are well-suited in WSN's scenario where data redundancy/duplication is a common issue. However, these approaches are based on an unrealistic assumption that a sensor node could always generate accurate data and, therefore, could always work properly.…”