IMPROVEMENT OF TRANSPORTATION ROUTES IN MUNICIPALITIES BY DNA COMPUTATION METHOD
نویسندگان
چکیده
منابع مشابه
Parallel computation framework for optimizing trailer routes in bulk transportation
We consider a rich tanker trailer routing problem with stochastic transit times for chemicals and liquid bulk orders. A typical route of the tanker trailer comprises of sourcing a cleaned and prepped trailer from a pre-wash location, pickup and delivery of chemical orders, cleaning the tanker trailer at a post-wash location after order delivery and prepping for the next order. Unlike traditiona...
متن کاملComputation of the linear Schrodinger Energy levels by Sinc method
Computation of the Schrodinger equation energy levels is very important in physics. For example we can use these levels to calculate the absorption coefficient and light refraction in a material as well as calculation of the interband and intersubband transition energies. Density of states of the system can also be obtained by using the energy levels. Thereafter we can determine that the system...
متن کاملEvaluation and Management of Health and Safety Risks of Chlorine Gas in Transportation Routes
Background: More than 90% of goods movement in Iran is done by road transport. A significant part of these materials is dangerous goods. Considering that chlorine gas is considered a toxic and oxidizing substance, predicting the way of release and mortality due to accidental leakage of chlorine gas can be a crucial tool in adopting preventive strategies. This study aims to evaluate the safety o...
متن کاملsuppression of coke formation in thermal cracking by coke inhibitors
the main purpose of this research was to:1.develop a coking model for thermal cracking of naphtha.2.study coke inhibition methods using different coke inhibitors.developing a coking model in naphtha cracking reactors requires a suitable model of the thermal cracking reactor based on a reliable kinetic model.to obtain reliable results all these models shall be solved simultaneously.for this pu...
15 صفحه اولEfficient Computation of Jogging Routes
We study the problem of computing jogging (running) routes in pedestrian networks: Given source vertex s and length L, it asks for a cycle (containing s) that approximates L while considering niceness criteria such as the surrounding area, shape of the route, and its complexity. Unfortunately, computing such routes is NP-hard, even if the only optimization goal is length. We therefore propose t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Management Economics and Business
سال: 2020
ISSN: 2147-9208
DOI: 10.17130/ijmeb.853543