scholarly journals Battery-Aware Electric Truck Delivery Route Exploration

Energies ◽  
2020 ◽  
Vol 13 (8) ◽  
pp. 2096
Author(s):  
Donkyu Baek ◽  
Yukai Chen ◽  
Naehyuck Chang ◽  
Enrico Macii ◽  
Massimo Poncino
Keyword(s):  
Heuristic Algorithms ◽  
Combustion Engine ◽  
Optimal Solution ◽  
Optimal Routing ◽  
Total Energy Consumption ◽  
Delivery Problem ◽  
Package Delivery ◽  
Delivery Route ◽  
The Traveling Salesman Problem ◽  
Critical Metric

The energy-optimal routing of Electric Vehicles (EVs) in the context of parcel delivery is more complicated than for conventional Internal Combustion Engine (ICE) vehicles, in which the total travel distance is the most critical metric. The total energy consumption of EV delivery strongly depends on the order of delivery because of transported parcel weight changing over time, which directly affects the battery efficiency. Therefore, it is not suitable to find an optimal routing solution with traditional routing algorithms such as the Traveling Salesman Problem (TSP), which use a static quantity (e.g., distance) as a metric. In this paper, we explore appropriate metrics considering the varying transported parcel total weight and achieve a solution for the least-energy delivery problem using EVs. We implement an electric truck simulator based on EV powertrain model and nonlinear battery model. We evaluate different metrics to assess their quality on small size instances for which the optimal solution can be computed exhaustively. A greedy algorithm using the empirically best metric (namely, distance × residual weight) provides significant reductions (up to 33%) with respect to a common-sense heaviest first package delivery route determined using a metric suggested by the battery properties. This algorithm also outperforms the state-of-the-art TSP heuristic algorithms, which consumes up to 12.46% more energy and 8.6 times more runtime. We also estimate how the proposed algorithms work well on real roads interconnecting cities located at different altitudes as a case study.

scholarly journals Traveling-Salesman-Problem Algorithm Based on Simulated Annealing and Gene-Expression Programming

Information ◽  
2018 ◽  
Vol 10 (1) ◽  
pp. 7 ◽  
Author(s):  
Ai-Hua Zhou ◽  
Li-Peng Zhu ◽  
Bin Hu ◽  
Song Deng ◽  
Yan Song ◽  
...  
Keyword(s):  
Gene Expression ◽  
Simulated Annealing ◽  
Traveling Salesman Problem ◽  
Heuristic Algorithms ◽  
Gene Expression Programming ◽  
Optimal Solution ◽  
Traveling Salesman ◽  
Np Hard Problem ◽  
Convergence Performance ◽  
The Traveling Salesman Problem

The traveling-salesman problem can be regarded as an NP-hard problem. To better solve the best solution, many heuristic algorithms, such as simulated annealing, ant-colony optimization, tabu search, and genetic algorithm, were used. However, these algorithms either are easy to fall into local optimization or have low or poor convergence performance. This paper proposes a new algorithm based on simulated annealing and gene-expression programming to better solve the problem. In the algorithm, we use simulated annealing to increase the diversity of the Gene Expression Programming (GEP) population and improve the ability of global search. The comparative experiments results, using six benchmark instances, show that the proposed algorithm outperforms other well-known heuristic algorithms in terms of the best solution, the worst solution, the running time of the algorithm, the rate of difference between the best solution and the known optimal solution, and the convergent speed of algorithms.

scholarly journals Linear Weighted Regression and Energy-Aware Greedy Scheduling for Heterogeneous Big Data

Electronics ◽  
2021 ◽  
Vol 10 (5) ◽  
pp. 554
Author(s):  
Suresh Kallam ◽  
Rizwan Patan ◽  
Tathapudi V. Ramana ◽  
Amir H. Gandomi
Keyword(s):  
Big Data ◽  
Energy Consumption ◽  
Total Energy ◽  
Optimal Solution ◽  
Data Locality ◽  
Weighted Regression ◽  
Heterogeneous Environments ◽  
Energy Aware ◽  
Total Energy Consumption ◽  
Greedy Scheduling

Data are presently being produced at an increased speed in different formats, which complicates the design, processing, and evaluation of the data. The MapReduce algorithm is a distributed file system that is used for big data parallel processing. Current implementations of MapReduce assist in data locality along with robustness. In this study, a linear weighted regression and energy-aware greedy scheduling (LWR-EGS) method were combined to handle big data. The LWR-EGS method initially selects tasks for an assignment and then selects the best available machine to identify an optimal solution. With this objective, first, the problem was modeled as an integer linear weighted regression program to choose tasks for the assignment. Then, the best available machines were selected to find the optimal solution. In this manner, the optimization of resources is said to have taken place. Then, an energy efficiency-aware greedy scheduling algorithm was presented to select a position for each task to minimize the total energy consumption of the MapReduce job for big data applications in heterogeneous environments without a significant performance loss. To evaluate the performance, the LWR-EGS method was compared with two related approaches via MapReduce. The experimental results showed that the LWR-EGS method effectively reduced the total energy consumption without producing large scheduling overheads. Moreover, the method also reduced the execution time when compared to state-of-the-art methods. The LWR-EGS method reduced the energy consumption, average processing time, and scheduling overhead by 16%, 20%, and 22%, respectively, compared to existing methods.

On the Structure of the Optimal Solution to a Periodic Drug-Delivery Problem

2017 ◽  
Vol 139 (7) ◽  
Author(s):  
Mohammad Ghanaatpishe ◽  
Hosam K. Fathy
Keyword(s):  
Drug Delivery ◽  
Optimal Solution ◽  
Input Sequence ◽  
Control Input ◽  
Piecewise Constant ◽  
Delivery Problem ◽  
Pkpd Model ◽  
Periodic Input ◽  
Discrete Values ◽  
Insight Into

This paper examines the shaping of a drug's delivery—in this case, nicotine—to maximize its efficacy. Previous research: (i) furnishes a pharmacokinetic–pharmacodynamic (PKPD) model of this drug's metabolism; (ii) shows that the drug-delivery problem is proper, meaning that its optimal solution is periodic; (iii) shows that the underlying PKPD model is differentially flat; and (iv) exploits differential flatness to solve the problem by optimizing the coefficients of a truncated Fourier expansion of the flat output trajectory. In contrast, the work in this article provides insight into the structure of the theoretical solution to this optimal periodic control (OPC) problem. First, we argue for the existence of a bijection between feasible periodic input and state trajectories of the problem. Second, we exploit Pontryagin's maximum principle to show that the optimal periodic solution has a bang–singular–bang structure. Building on these insights, this article proposes two different numerical methods for solving this OPC problem. One method uses nonlinear programming (NLP) to optimize the states at which the optimal solution transitions between the different solution arcs. The second method approximates the control input trajectory as piecewise constant and optimizes the discrete values of the input sequence. The paper concludes by discussing the computational costs of these two algorithms as well as the importance of the associated insights into the structure of the optimal solution trajectory.

Optimal design of aerospace structures using recent meta-heuristic algorithms

2021 ◽  
Vol 63 (11) ◽  
pp. 1025-1031
Author(s):  
Faik Fatih Korkmaz ◽  
Mert Subran ◽  
Ali Rıza Yıldız
Keyword(s):  
Heuristic Algorithms ◽  
Optimal Solution ◽  
Von Mises Stress ◽  
Grey Wolf Optimizer ◽  
Local Optima ◽  
Design And Optimization ◽  
Shape Perturbation ◽  
Novel Algorithms ◽  
Von Mises ◽  
Conventional Optimization

Abstract Most conventional optimization approaches are deterministic and based on the derivative information of a problem’s function. On the other hand, nature-inspired and evolution-based algorithms have a stochastic method for finding the optimal solution. They have become a more popular design and optimization tool, with a continually growing development of novel algorithms and new applications. Flexibility, easy implementation, and the capability to avoid local optima are significant advantages of these algorithms. In this study, shapes, and shape perturbation limits of a bracket part, which is used in aviation, have been set using the hypermorph tool. The objective function of the optimization problem is minimizing the volume, and the constraint is maximum von Mises stress on the structure. The grey wolf optimizer (GWO) and the moth-flame Optimizer (MFO) have been selected as nature-inspired evolution-based optimizers.

Fast Filtering of Search Results Sorted by Attribute

2022 ◽  
Vol 40 (2) ◽  
pp. 1-24
Author(s):  
Franco Maria Nardini ◽  
Roberto Trani ◽  
Rossano Venturini
Keyword(s):  
Heuristic Algorithms ◽  
State Of The Art ◽  
Optimal Algorithm ◽  
Computational Cost ◽  
Approximation Error ◽  
Optimal Solution ◽  
Exact Algorithm ◽  
Performance Bounds ◽  
Search Results ◽  
Filtering Problem

Modern search services often provide multiple options to rank the search results, e.g., sort “by relevance”, “by price” or “by discount” in e-commerce. While the traditional rank by relevance effectively places the relevant results in the top positions of the results list, the rank by attribute could place many marginally relevant results in the head of the results list leading to poor user experience. In the past, this issue has been addressed by investigating the relevance-aware filtering problem, which asks to select the subset of results maximizing the relevance of the attribute-sorted list. Recently, an exact algorithm has been proposed to solve this problem optimally. However, the high computational cost of the algorithm makes it impractical for the Web search scenario, which is characterized by huge lists of results and strict time constraints. For this reason, the problem is often solved using efficient yet inaccurate heuristic algorithms. In this article, we first prove the performance bounds of the existing heuristics. We then propose two efficient and effective algorithms to solve the relevance-aware filtering problem. First, we propose OPT-Filtering, a novel exact algorithm that is faster than the existing state-of-the-art optimal algorithm. Second, we propose an approximate and even more efficient algorithm, ϵ-Filtering, which, given an allowed approximation error ϵ, finds a (1-ϵ)–optimal filtering, i.e., the relevance of its solution is at least (1-ϵ) times the optimum. We conduct a comprehensive evaluation of the two proposed algorithms against state-of-the-art competitors on two real-world public datasets. Experimental results show that OPT-Filtering achieves a significant speedup of up to two orders of magnitude with respect to the existing optimal solution, while ϵ-Filtering further improves this result by trading effectiveness for efficiency. In particular, experiments show that ϵ-Filtering can achieve quasi-optimal solutions while being faster than all state-of-the-art competitors in most of the tested configurations.

Optimization of Route Planning for the Package Delivery Problem Using Fuzzy Clustering

2021 ◽  
pp. 239-252
Author(s):  
Paula Hernández–Hernández ◽  
Norberto Castillo–García
Keyword(s):  
Fuzzy Clustering ◽  
Route Planning ◽  
Delivery Problem ◽  
Package Delivery

An Intelligent Traffic Engineering Method over Software Defined Networks for Video Surveillance Systems Based on Artificial Bee Colony

2016 ◽  
Vol 12 (4) ◽  
pp. 45-62 ◽  
Author(s):  
Reza Mohammadi ◽  
Reza Javidan
Keyword(s):  
Video Surveillance ◽  
Traffic Engineering ◽  
Surveillance System ◽  
Artificial Bee Colony ◽  
Heuristic Algorithms ◽  
Optimal Solution ◽  
Video Data ◽  
Surveillance Systems ◽  
Bee Colony

In applications such as video surveillance systems, cameras transmit video data streams through network in which quality of received video should be assured. Traditional IP based networks cannot guarantee the required Quality of Service (QoS) for such applications. Nowadays, Software Defined Network (SDN) is a popular technology, which assists network management using computer programs. In this paper, a new SDN-based video surveillance system infrastructure is proposed to apply desire traffic engineering for practical video surveillance applications. To keep the quality of received videos adaptively, usually Constraint Shortest Path (CSP) problem is used which is a NP-complete problem. Hence, heuristic algorithms are suitable candidate for solving such problem. This paper models streaming video data on a surveillance system as a CSP problem, and proposes an artificial bee colony (ABC) algorithm to find optimal solution to manage the network adaptively and guarantee the required QoS. The simulation results show the effectiveness of the proposed method in terms of QoS metrics.

scholarly journals Multi-Searcher Optimization for the Optimal Energy Dispatch of Combined Heat and Power-Thermal-Wind-Photovoltaic Systems

2019 ◽  
Vol 9 (3) ◽  
pp. 537 ◽  
Author(s):  
Jianlin Tang ◽  
Tao Yu ◽  
Xiaoshun Zhang ◽  
Zhuohuan Li ◽  
Junbin Chen
Keyword(s):  
Heuristic Algorithms ◽  
Optimal Solution ◽  
Energy System ◽  
Combined Heat And Power ◽  
Superior Performance ◽  
Local Optimum ◽  
Photovoltaic Systems ◽  
Thermal Wind ◽  
Optimal Energy ◽  
Highly Nonlinear

This paper proposes a novel multi-searcher optimization (MSO) algorithm for the optimal energy dispatch (OED) of combined heat and power-thermal-wind-photovoltaic systems. The available power of wind turbine (WT) units and photovoltaic (PV) units is approximated with the probability density functions of wind speed and solar irradiance, respectively. The chaos theory is used to implement a wide global search, which can effectively avoid a low-quality local optimum for OED. Besides, a double-layer searcher is designed to guarantee fast convergence to a high-quality optimal solution. Finally, three benchmark functions and an energy system with 27 units are used for testing the performance of the MSO compared with nine other frequently used heuristic algorithms. The simulation results demonstrate that the proposed technique not only can solve the highly nonlinear, non-smooth, and non-convex OED problem of an energy system, but can also achieve a superior performance for the convergence speed and the optimum quality.

Heuristic algorithm for optimal redundancy allocation in complex systems

2019 ◽  
Vol 25 (1) ◽  
pp. 54-64 ◽  
Author(s):  
Sudhanshu Aggarwal
Keyword(s):  
Complex Systems ◽  
Heuristic Algorithm ◽  
Communication Systems ◽  
Heuristic Algorithms ◽  
Real Life ◽  
Optimal Solution ◽  
Systems Design ◽  
Computational Time ◽  
Coherent System ◽  
Content Type

PurposeThe purpose of this paper is to present an efficient heuristic algorithm based on the 3-neighborhood approach. In this paper, search is made from sides of both feasible and infeasible regions to find near-optimal solutions.Design/methodology/approachThe algorithm performs a series of selection and exchange operations in 3-neighborhood to see whether this exchange yields still an improved feasible solution or converges to a near-optimal solution in which case the algorithm stops.FindingsThe proposed algorithm has been tested on complex system structures which have been widely used. The results show that this 3-neighborhood approach not only can obtain various known solutions but also is computationally efficient for various complex systems.Research limitations/implicationsIn general, the proposed heuristic is applicable to any coherent system with no restrictions on constraint functions; however, to enforce convergence, inferior solutions might be included only when they are not being too far from the optimum.Practical implicationsIt is observed that the proposed heuristic is reasonably proficient in terms of various measures of performance and computational time.Social implicationsReliability optimization is very important in real life systems such as computer and communication systems, telecommunications, automobile, nuclear, defense systems, etc. It is an important issue prior to real life systems design.Originality/valueThe utilization of 3-neighborhood strategy seems to be encouraging as it efficiently enforces the convergence to a near-optimal solution; indeed, it attains quality solutions in less computational time in comparison to other existing heuristic algorithms.

Sign in / Sign up

Export Citation Format

Share Document