Near-Optimal Weather Routing by Using Improved A* Algorithm
نویسندگان
چکیده
منابع مشابه
A Green Competitive Vehicle Routing Problem under Uncertainty Solved by an Improved Differential Evolution Algorithm
Regarding the development of distribution systems in the recent decades, fuel consumption of trucks has increased noticeably, which has a huge impact on greenhouse gas emissions. For this reason, the reduction of fuel consumption has been one of the most important research areas in the last decades. The aim of this paper is to propose a robust mathematical model for a variant of a vehicle routi...
متن کاملAn Improved Layered MIMO Detection Algorithm With Near-Optimal Performance
This letter presents a new layered symbol detection algorithm for multiple-input multiple-output (MIMO) systems. In this scheme, the layers are divided into two groups and detected differently. For the layer with the smallest post-detection signal-tonoise ratio, an exhaustive search is performed over the signal constellation; for the remaining layers the conventional iterative vertical Bell lab...
متن کامل4 Near-optimal Routing Trees
those of the MST and AHHK 1] constructions for nets of up to 17 pins using the same IC parameters. All delays in the table are calculated using the Two-Pole simulator. The AHHK algorithm of Alpert et al. is a recent cost-radius tradeoo construction which yields less tree cost (and signal delay) for given tree radius bounds than the method of 3]. Our results indicate that the LDT algorithm is hi...
متن کاملA Near-Optimal Planarization Algorithm
The problem of testing whether a graph is planar has been studied for over half a century, and is known to be solvable in O(n) time using a myriad of different approaches and techniques. Robertson and Seymour established the existence of a cubic algorithm for the more general problem of deciding whether an n-vertex graph can be made planar by at most k vertex deletions, for every fixed k. Of th...
متن کاملFinding Near Optimal Solutions for Vehicle Routing Problems with Time Windows using Hybrid Genetic Algorithm
The Vehicle Routing Problem with Time Windows (VRPTW) is a well-know and complex combinatorial problem, which has received considerable attention in recent years. This problem has been addressed using many different techniques including both exact and heuristic methods. The VRPTW benchmark problems of Solomon (1987) have been most commonly chosen to evaluate and to compare all solutions propose...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Sciences
سال: 2020
ISSN: 2076-3417
DOI: 10.3390/app10176010