-
Open Access Article
1 - Combined optimization of the bi-level supply chain of closed loop in uncertainty conditions
Shahram Rostampour soleyman Iranzadeh Naser Feghhi farahmandSupply chain management is considered one of the most important pillars of today's businesses, and a large portion of the cost of any manufacturing and service organization is spent in this cycle.One of the most important components of the efficiency of each supply chai MoreSupply chain management is considered one of the most important pillars of today's businesses, and a large portion of the cost of any manufacturing and service organization is spent in this cycle.One of the most important components of the efficiency of each supply chain is the availability of an optimal transportation system. The mathematical approach governing the modeling and optimization of this transportation system is the Vehicle Routing Problem Approach. In this paper, with the aim of minimizing supply chain costs and maximizing customer satisfaction, modeling, solving and verifying the distribution system in a bi-level closed loop supply chain with uncertain variables has been undertaken.Here, due to the uncertainty of the modeling variables, and that the optimal answer can be any vector combination of the studied graph nodes, the problem is classified in terms of the degree of complexity of the NP-hard issues and its optimal solution through methods Classical mathematical programming is not possible.In this study, a metaheuristic fire-fly algorithm used to solve the problem. In this regard, the main variables and parameters included in the model are the number, speed, capacity, average loaded and distance traveled,and the number, Geographical distribution, the amount of goods requested and returned of retailers. In order to investigate the validity of the obtained response, we also modeling and solving of 3 scenarios and comparing the results with a random method(current method in distribution company), which shows the effectiveness of the proposed method. Manuscript profile -
Open Access Article
2 - IMNTV-Identifying Malicious Nodes using Trust Value in Wireless Sensor Networks
Swathi B H Megha V Gururaj H L Hamsaveni M Janhavi V -
Open Access Article
3 - Congestion estimation of router input ports in Network-on-Chip for efficient virtual allocation
Midia Reshadi Ali Ramezanzad Akram Reza -
Open Access Article
4 - Robot Path Planning Using Cellular Automata and Genetic Algorithm
Zeynab Sedreh Mehdi Sadeghzadeh -
Open Access Article
5 - CAFT: Cost-aware and Fault-tolerant routing algorithm in 2D mesh Network-on-Chip
Akram Reza Parisa Jolani Midia Reshadi -
Open Access Article
6 - An Improved Junction-Based Directional Routing Protocol (IJDRP) for VANETs
Bharat Mahaur Aishwarya Gupta -
Open Access Article
7 - Routing Hole Handling Techniques for Wireless Sensor Networks: A Review
Swathi B H Gururaj H L -
Open Access Article
8 - Orienteering Problem with Variable Profits, Fractional Objective Function and Demand on Arcs
S. M. khorramizadeh D. EsfandyaranNowadays, due to the high expectations of customers in meeting their demand and the competition environment among service providers, employers are working to provide customers with new methods in the shortest possible time and in the best possible way to attract custome MoreNowadays, due to the high expectations of customers in meeting their demand and the competition environment among service providers, employers are working to provide customers with new methods in the shortest possible time and in the best possible way to attract customer’s satisfaction and maximize profits. In this paper, the orienteering problem with variable profits, fractional objective function and demand on arcs is studied. An appropriate integer programming model is proposed to solve it. In this case, the purpose is to determine a route for a vehicle so that it maximizes the profit, the start and end of its route is at the origin, serving demands of customers, and does not exceed a maximum allowed travel time. In the orinteering problem with variable profits and fractional objective function the customers are located on vertices of the graph corresponding to the problem. Next, a problem is considered in which the service is performed on arcs. The resulting problem is called the orinteering arc routing problem with variable profits and fractional objective function. We solve the problem by bisection method. In the end, the numerical efficiency of the proposed model is examined. The proposed algorithms can solve problems in a reasonable amount of time. We will also see that the time of solving problems depends on their graph structure and not on their size. Manuscript profile -
Open Access Article
9 - Expansions and algorithms of the fleet and mix vehicle routing problem
Majid Yousefikhoshbakht Mohamadreza ChaharmahaliThe vehicle routing problem (VRP) is one of the most important research issues in operations in industries and services, which is highly regarded today due to the high cost of transportation in the final price of goods. On the other hand, considering that the use of veh MoreThe vehicle routing problem (VRP) is one of the most important research issues in operations in industries and services, which is highly regarded today due to the high cost of transportation in the final price of goods. On the other hand, considering that the use of vehicles with different capacities will further reduce this cost, the issue of fleet size and mix vehicle routing (FSMVRP) was introduced and since then significant progress has been made on these issues and their types for use in Real tools were made. In this case, there are different types of vehicles with different capacities available in the unique depot to serve a group of customers with known geographical locations. In addition, in this case, each customer needs a certain amount of goods that must be delivered to them by a fixed fleet of vehicles. The goal is to determine the set of tours for the vehicles with the lowest cost, provided that: each vehicle starts from the depot and returns to it at the end, each customer is visited exactly once by one vehicle and the total customer demand of each tour exceeds the capacity do not exceed any type of vehicle, which is considered Qi. The purpose of this article is to categorize and review issues related to FSMVRP. This paper also provides a comparative analysis of meta-heuristic algorithms for these problems. Manuscript profile -
Open Access Article
10 - An Imperialist Competitive Algorithm and a Mixed Integer Programming Formulation for the Capacitated Vehicle Routing Problem
M. YousefikhoshbakhtThe Vehicle Routing Problem (VRP), a famous problem of operation research, holds a central place in combinatorial optimization problems. In this problem, a fleet vehicles with Q capacity start to move from depot and return after servicing to customers in which visit onl MoreThe Vehicle Routing Problem (VRP), a famous problem of operation research, holds a central place in combinatorial optimization problems. In this problem, a fleet vehicles with Q capacity start to move from depot and return after servicing to customers in which visit only ones each customer and load more than its capacity not at all. The objective is to minimize the number of used vehicles and total distance traversed. This paper presents an application of Imperialist Competitive Algorithm (ICA)) in VRP. Unlike other evolutionary optimization algorithms, ICA is inspired from a socio political process, the competition among imperialists and colonies. Comparison between this method and famous meta-heuristic algorithms shows the effectiveness of the proposed approach. Computational experience with two groups of instances involving from 50 to 200 confirms that proposed algorithm is competitive in compared to the famous meta-heuristic algorithms in terms of the quality of generated solutions. In addition, this algorithm finds closely the best known solutions (BKS) for most of the instances. Manuscript profile -
Open Access Article
11 - The role of flood routing in determination and Prioritizing hydrologic units Bostan Dam Basin from flooding and showing management technique
Seyed Alireza Bahrami Majid Onagh Hasan FarazjooDetermining flood producing regions and sub-basins flood producing priorities are considered very important in the management of large watersheds. In this paper the flood routing role in separating and determining flood producing regions in the Bostan dam wate MoreDetermining flood producing regions and sub-basins flood producing priorities are considered very important in the management of large watersheds. In this paper the flood routing role in separating and determining flood producing regions in the Bostan dam watershed of Golestan province in northern Iran after discharge routing of sub-basins in main waterways up to the main outlet of watershed was studied. For achieving the above goal, geographical information system (GIS), a hydrological model (HEC-HMS) and individual iterative elimination of sub-basins was used to calculate related hydrographs with design precipitation for each sub-basin. With consecutive elimination of sub-basins in each run of the model, the total discharge from whole watershed basin after flood routing in main waterways with considering the eliminated sub-basin was calculated; therefore effect of each sub-basin in flood producing capacity at the main outlet was determined. The sub-basin, with highest contribution in producing watershed outlet flood was recognized as most producing flood sub-basin. Then other sub-basins were ranked according to their quantitative share in producing flood discharge at outlet. Flood routing in waterways showed that contribution rate of sub-basins in outlet flood was not proportional with peak discharge of sub-basins and those sub basins with higher discharge do not necessarily have the highest contribution in basin's outlet flood, since waterways parameters of routing and the spatial location of sub-basins can change the contribution status. In order to eliminate the area effect in sub-basin ranking, the degree of influence of every sub-basin unit in the outlet flood was calculated, which changed the flood producing ranking of sub-basins. Finally with respect to the obtained results, required management guidelines were suggested. Manuscript profile -
Open Access Article
12 - بهینه سازی مسیریابی در شبکه های اجتماعی خودرویی با استفاده از الگوریتم کرم شب تاپ
مینا زندی محسن جهانشاهی علیرضا هدایتیشبکههای اجتماعی بینخودرویی(VSNs) ، نوعی از شبکههای­ موردی هستند که امکان برقراری ارتباط بین دو وسیله نقلیه مجاور را بصورت بی­سیم برقرار میکنند. یکی از مشکلات موجود در شبکه­های VSN مشکل مسیریابی و ارتباط با گره­ها ی مجاور است؛ بنابراین با بررسی تحقیقا Moreشبکههای اجتماعی بینخودرویی(VSNs) ، نوعی از شبکههای­ موردی هستند که امکان برقراری ارتباط بین دو وسیله نقلیه مجاور را بصورت بی­سیم برقرار میکنند. یکی از مشکلات موجود در شبکه­های VSN مشکل مسیریابی و ارتباط با گره­ها ی مجاور است؛ بنابراین با بررسی تحقیقات موجود در این زمینه مشخص شد که بعلت وسعت جغرافیایی و سرعت تحرک وسایل نقلیه با مشکل محدودیت زمان جهت انتقال داده و مسیریابی روبرو هستیم. در این مقاله با استفاده از الگوریتم بهینه سازی کرم شب­تاب تلاش می­شود یک راه حل نزدیک به بهینه با کمترین تاخیر برای مساله مسیریابی در این شبکه­ها ارائه شود که تا بحال در هیچ پژوهشی استفاده نشده است بطوریکه قابلیت بکارگیری در محیط پویا و وسعت جغرافیایی بزرگ را نیز دارا باشد. وسایل نقلیه (خودروها) در حکم کرمهای شبتاب لحاظ شده و حرکت بین خودروها در حکم جذب کرمهای شبتاب توسط سایرین لحاظ میشود. دو معیار میانگین فاصله و احتمال رسیدن دو خودرو به یکدیگر برای جذب خودروها و مسیریابی مورد آزمایش قرارگرفت. همچنین، تعداد خودروهای هر ناحیه که با چگالی متفاوت وسایل نقلیه در دو منطقه شهری و بینشهری سنجیده میشود نیز معیاری است که در صحت مسیریابی تاثیر مستقیم دارد. نهایتا روش پیشنهادی در حوزه شبکه­های نسل پنجم مخابراتی شبیه­سازی میشود و نتایج عددی نشان داد که روش پیشنهادی در مقایسه با نتایج استفاده از الگوریتم تقسیم پویای دسته جمعی از نظر میانگین فاصله مسیریابی خودروها، تفکیک مناطق شهری و بین شهری، تغییرات پارامتر میزان روشنایی، تغییرات پارامتر­ضریب جذب نور، تغییرات پارامتر عدد تصادفی بین صفر و یک، تغییرات پارامترحرکت اولیه خوردوها بطورتصادفی به­ترتیب 68.14، 63.13، 65.2، 08.20، 39.18، 57.17، 45.18بهبود حاصل شد. Manuscript profile -
Open Access Article
13 - A multi-product vehicle routing scheduling model with time window constraints for cross docking system under uncertainty: A fuzzy possibilistic-stochastic programming
B. Vahdani SH. Sadigh Behzadi -
Open Access Article
14 - FTRTA : Fault Tolerance and Reliable Transmissions Algorithm based on the Internet of Things
Mohsen Mozafari Vanani Pouya KhosraviandehkordiThe limitations of IoT have led to increased failures and the need for guaranteed fault tolerance to ensure adequate network performance. Although previous studies have effectively improved fault tolerance by focusing on various aspects of this area, previous methods ar MoreThe limitations of IoT have led to increased failures and the need for guaranteed fault tolerance to ensure adequate network performance. Although previous studies have effectively improved fault tolerance by focusing on various aspects of this area, previous methods are ineffective in ensuring the stability and accuracy of data exchange in the event of failure. The existence of this problem shows the need to propose a new method that can guarantee the stability and accuracy of data exchange to guarantee the stability of network performance in case of failure. To achieve this, this research introduced a method called FTRTA, which is based on the development of the RPL protocol and data distribution techniques. Distribution techniques are effective in improving load balancing and fault tolerance of network traffic. The FTRTA was developed based on this technique and in three operational steps. Firstly, the situation of the network nodes is evaluated and analyzed in the same way as when sending DIO messages. In the second step, the network communication graph is created. Finally, in the third step, data transmission is based on a distribution technique to ensure fault tolerance. The simulation results using Cooja software show the high performance of FTRTA in ensuring the stability and accuracy of data exchange, improving factors such as successful receptions and network throughput compared to similar studies. Manuscript profile -
Open Access Article
15 - A New Model for Enhancing Efficiency in On-Chip Optical Networks Based on Adaptive Routing Algorithm.
Mohammadreza Hemmati Sayed Mohammad Ali Zanjani Elham YaghoubiThe lower power consumption, larger communication bandwidth, and reduced latency are advantages of optical networks over electrical communications. However, there are challenges in these networks, such as routing and connectivity issues, which result in increased networ MoreThe lower power consumption, larger communication bandwidth, and reduced latency are advantages of optical networks over electrical communications. However, there are challenges in these networks, such as routing and connectivity issues, which result in increased network size and wastage. As networks become more complex and larger, building on-chip networks brings problems like communication costs between components and the likelihood of unpredictable failures in communication circuits. Therefore, providing an error-tolerant routing algorithm plays a crucial role in the development of on-chip network architecture. In this article, an adaptive fault-tolerant routing algorithm will be presented, whose main objective is to create the ability to handle a reasonable number of faults without disrupting the healthy nodes in the network. The simulation results of message delay in the proposed method show a gradient norm equal to 1.1691E-5 and μ = 1E-8 for epoch=280, demonstrating its capability to reduce delay in the network. A very slight change in message delay in evaluating the proposed method also indicates the acceptability of the proposed method. Moreover, the presence of a gradient of 1.527E-3 and μ = 1E-7 for epoch=350 in the energy consumption value indicates a reduction in energy consumption compared to conventional methods in existing references, although the proposed system may incur additional overhead compared to some previous methods. Manuscript profile -
Open Access Article
16 - Use of fuzzy technique to optimally route control cables in the presence of interfering fields in transmission substations.
Hadith Zare Faramarz Faqihi Fatemeh AbbasianElectromagnetic compatibility and interference is the premise of any electrical and electronic device; Therefore, the modern design of electronic and telecommunication systems requires that these systems be compatible with the electromagnetic environment around them; An MoreElectromagnetic compatibility and interference is the premise of any electrical and electronic device; Therefore, the modern design of electronic and telecommunication systems requires that these systems be compatible with the electromagnetic environment around them; And the design must be done in such a way that these disturbances inflict the least impact on the performance of the system. In transmission substations, equipment that passes high currents leads to the production of interfering and disturbing fields. Because control cables are sensitive equipment of transmission substations, they are affected by these interference fields. Satisfying the path of control cables in the event of unconventional fields is one of the points to consider in the posts. The strategy and type of analysis are such that the parameters of electromagnetic compatibility, price and voltage drop are reviewed as decision criteria for optimal routing. Manuscript profile -
Open Access Article
17 - Adaptive-PGRP: Routing Algorithm Based on PGRP Algorithm with Adaptive Hello Messages in VANET
Robabeh Ghafouri Vayghan Reza Akbari SefidehIntroduction: In the vehicular ad hoc networks (VANETs), routing is a challenging issue due to the nodes mobility speed and frequent changes in the network topology. In these networks, geographic routing algorithms are more popular and have attracted more attention. T MoreIntroduction: In the vehicular ad hoc networks (VANETs), routing is a challenging issue due to the nodes mobility speed and frequent changes in the network topology. In these networks, geographic routing algorithms are more popular and have attracted more attention. The efficiency of geographic routing algorithms depends on the two factors: strategy of choosing the best neighbor and how to manage the mobility of neighbor nodes by the procedure of broadcasting Hello messages. Broadcasting Hello messages leads to the exchange of many control packets and causes the channel saturation and increases the probability of congestion and collision. Method: In this work, with the aim of reducing the control overhead messages, the broadcast rate of Hello messages is adjusted adaptively based on the congestion and link expiration time. By applying the proposed method on the PGRP (Predictive Geographic Routing Protocol) algorithm, the broadcast rate of Hello packets is adjusted according to the network conditions. As a result, routing overhead packets are reduced and service quality in the network is improved. Results: Two groups of experiments have been conducted. In the first group, the aim is to investigate the effect of increasing the number of vehicles. In the second group experiments, the goal is to investigate the nodes speed increasing. The simulation results show that the proposed method improves the performance of the PGRP protocol in different scenarios. It has been shown the proposed method for a different number of vehicles increases the packet delivery ratio on average by 16%; decrease end to end delay on average by 7%; decreases normalized routing overhead by 18% compared to PGRP. Also, it has been shown the proposed method for a varying speed of vehicles increases the packet delivery ratio by 18%; decreases average end to end delay by 5% and decreases the normalized routing overhead by 22% compared to PGRP. Discussion: When the number of vehicles increases, the sources of broadcasting Hello messages increase, and the probability of collision increases. In the proposed method this situation is detected and the broadcast rate of Hello messages reduces. As the same way, when the speed of the nodes is low, the expiration time of links increases, and the proposed method reduces the broadcast of Hello messages to avoid wasting the network resources. Manuscript profile -
Open Access Article
18 - A review of meta-heuristic methods for solving location allocation financial problems
Mehdi Fazli Somayyeh Faraji Amoogin -
Open Access Article
19 - Designing an Integrated Model of Mathematical Planning and IoT with Emphasis on Cost-Time-Routing Optimization of Intercity Transportation Systems
Shahrzad Babaie Mohammad Seyedhosseini Mohammadreza Motadel -
Open Access Article
20 - Proposing A Multi-objective Model of Routing and Location in the Green and Sustainable Supply Chain Mode
Somaieh Alavi Alireza Habibi Ehsan EsfandiariIn a supply chain network, implementing a sound management system in the process of shipment can lead to lower costs and increase customer satisfaction by improving the flow of products. Therefore, in this study, a multi-objective mathematical model was presented and so MoreIn a supply chain network, implementing a sound management system in the process of shipment can lead to lower costs and increase customer satisfaction by improving the flow of products. Therefore, in this study, a multi-objective mathematical model was presented and solved to optimize the vehicle routing problem by locating the warehouse in the green supply chain while simultaneously receiving and delivering goods. The main limitations considered in this model include manufacturers' capacity, vehicle capacity, vehicle selection based on green supply chain criteria, vehicle routing and cross-stock warehouse location to minimize costs and fuel consumption and reduce pollution. In this case, the goods received from suppliers will be delivered to customers on the route after being categorized in a cross-stock warehouse or delivered directly to customers if necessary. It is assumed that product pickup and delivery are allowed on a single route and there is also a planning horizon for receiving products on the go. In general, the model aims to determine the best route in the green supply chain mode and the optimal number of vehicles used in the distribution network so that the total operating and relocation costs are minimized. The proposed model was validated using Gams software and Comprehensive Criterion Method and the results were evaluated in accordance with the articles presented in this efficient field and compared to similar articles. Manuscript profile -
Open Access Article
21 - Drug logistics network design based on the fleet routing by using the improved gray wolf optimizer algorithm
farzad mahmoodi Farzad Pouyan farTransportation of pharmaceuticals as one of the most complex types of transportation has always been studied by researchers. This issue, which is a subset of a key issue called the transportation of hazardous substances, is one of the most integral and high-risk activit MoreTransportation of pharmaceuticals as one of the most complex types of transportation has always been studied by researchers. This issue, which is a subset of a key issue called the transportation of hazardous substances, is one of the most integral and high-risk activities in the industrial activity cycle. Trying to find the optimal solution to this problem is one of the most useful topics in logistics. Accordingly, this study optimized the design of the drug logistics network. In this regard, the issue of vehicle routing (VRP) has been inspired. In this regard, the issue of vehicle routing (VRP) is inspired. To this end, first a conceptual model for this problem and a new mathematical model for routing drug transport vehicles with the role of path sensitivity and time window uncertainty are presented. In order to solve the problem, the Gray Wolf meta-heuristic algorithm has been used as a new and efficient algorithm. To evaluate the performance of the proposed algorithm, this algorithm is compared with the exact solution method and genetic algorithms and particle swarm and the results of the gray wolf algorithm show that this algorithm provides answers with the least possible error in a very short time. Manuscript profile -
Open Access Article
22 - Provide a system dynamics model for optimizing multi-objective production-inventory-routing in the green supply chain under conditions of uncertainty
Katayoun Naderi Roya M.ahari Javid Jouzdani Atefeh AmindoustThis study examines the cost, customer satisfaction and environmental protection to design a multi-objective optimization model using system dynamics and to provide a system dynamics model for multi-objective production-inventory-routing in the green supply chain under MoreThis study examines the cost, customer satisfaction and environmental protection to design a multi-objective optimization model using system dynamics and to provide a system dynamics model for multi-objective production-inventory-routing in the green supply chain under uncertainty. Considers.By customer demand for several periods, the model can make decisions by focusing on decisions such as the choice of supplier and retailer according to the distance between them, production models and the nascent level of transportation technology. For this purpose, to collect information, first using previous studies, the variables affecting the model (20 variables) were determined, then according to the experts, these variables were analyzed, then the relationships between the selected variables using the model. Cause and effect were identified and then the research modeling was completed by designing a system dynamics model and evaluating it through tests defined by execution in vensim software. Finally, three scenarios were developed to determine the strategies affecting the model. The results indicate the most effective strategies in achieving the desired situation, maximum customer satisfaction, minimum cost and inventory and maximum production with proper implementation of ongoing projects in the direction of green production using appropriate technical knowledge. Manuscript profile -
Open Access Article
23 - Integration of order preparation process in warehouse and distribution to production lines to minimize cost with adaptive whale algorithm approach
Amir Reza Ahmadi Keshavarz davood jaafari mehran khalaj Parshang DokouhakiOne of the most costly logistics activities is the picking process in the warehouse. Considering the internal logistics aspects, due to the limitations and resources available in order to reduce costs by increasing the level of capability, the supply systems of material MoreOne of the most costly logistics activities is the picking process in the warehouse. Considering the internal logistics aspects, due to the limitations and resources available in order to reduce costs by increasing the level of capability, the supply systems of materials and components will be achieved along the line. Considering the effect of the completion time of pick operations on the start time of distribution operations and the cost of order preparation tardiness, the present study aimed to investigate a new issue related to the integrated process of order preparation in the warehouse and delivery on time to minimize cost according to the data of a car companys. In this regard, an integer nonlinear programming model is proposed to minimize the costs caused by tardiness. In order to validate the model, the small problem is solved in exact way. To solve the model, since the problem is NP-Hard, the method of whale optimization algorithm was used and to improve the optimal routing solutions, the problem was investigated by designing an adaptive whale algorithm considering the cost and time of visiting workstations as a fitting function. Also, to assess the proposed adaptive whale algorithm, the results were compared with two meta-heuristic algorithms of particle swarm optimization and gray wolf. The results show that the proposed adaptive wall algorithm performs better than other methods, which improves and reduces costs. Manuscript profile -
Open Access Article
24 - Combination of Taboo Search and Ant Colony System Approach to Solve the Vehicle Routing Problem
Narges Mahmoodi Darani Azam Dolatnejad Majid YousefikhoshbakhtThe Vehicle Routing Problem (VRP) is one of the most important combinational optimization problems that is received much attention because of wide applications in routing problems. In this problem, fleet vehicles with Q capacity start to move from the depot and return a MoreThe Vehicle Routing Problem (VRP) is one of the most important combinational optimization problems that is received much attention because of wide applications in routing problems. In this problem, fleet vehicles with Q capacity start to move from the depot and return after servicing to customers in which visit only ones each customer and load more than its capacity not at all. The objective is to minimize the number of used vehicles and total distance traversed. This paper proposes a hybrid tabu search for the VRP. In this algorithm, three types of neighborhood moves including insert, swap and ant colony system are used for searching the neighborhood and moving from current solution to next solution. Computational experience with the benchmark test instances involving from 50 to 199 confirms that proposed algorithm is competitive in compared to the famous meta-heuristic algorithms in terms of the quality of generated solutions. In addition, this algorithm finds closely the best-known solutions (BKS) for most of the instances in which three best-known solutions are also found Manuscript profile -
Open Access Article
25 - Proposing a New Genetic Algorithm Multi-capacity to Solve the Multi-Storage Routing problem with Multi-capacity Vehicles
Hossien Afzali Gholam Reza Einy Sarkalleh Mojtba Khademy Nejad Elnaz MiandoabchiVehicle routing issues are one of the most common issues in supply chain management and in transport planning. So far, there have been many published academic articles and applied research papers referred in this study. A new innovative algorithm is proposed in this inv MoreVehicle routing issues are one of the most common issues in supply chain management and in transport planning. So far, there have been many published academic articles and applied research papers referred in this study. A new innovative algorithm is proposed in this investigation in order to solve the problem of routing different vehicles with different capacities. The main purpose of this paper is to allocate demand points to each center and determine the best route between the points assigned to each center, as well as determine the best means of transport. The quotes are for each center and the results obtained by the new algorithm are extracted C has been compared with the original algorithms and the results show that this algorithm will be able to compete with innovative algorithms and other interoperability. Manuscript profile -
Open Access Article
26 - Optimizing of Open Vehicle Routing Problem by Using an Efficient Hybrid Meta-heuristic Algorithm
Majid Yousefi khoshbakht Hassan Zarie Zahra Sadati Eskandari Narges Mahmmudi Daranie Ahmad Mahmmud JanloThe Open Vehicle Routing Problem (OVRP) is one of the most intensively studied problems in computational mathematics that nowadays and it has been receiving much attention by researchers and scientists. In this Problem, the objective is to define minimized distance trav MoreThe Open Vehicle Routing Problem (OVRP) is one of the most intensively studied problems in computational mathematics that nowadays and it has been receiving much attention by researchers and scientists. In this Problem, the objective is to define minimized distance traveled of the several vehicles that start to move simultaneously from the depot and visit some customers. It is noted that against to the Vehicle Routing Problem (VRP), it is not necessary that vehicles return to the depot after servicing the customers. This paper proposes a meta-heuristic algorithm in which at the first stage, a modified elite ant colony (EAS) is applied for finding a suboptimal solution, and at the second stage, the insert and swap local search algorithms are used for finding better solutions. Computational results on fifteen standard benchmark problem instances show that the proposed algorithm is comparable in terms of solution quality of other meta-heuristic algorithms. Manuscript profile -
Open Access Article
27 - A Hybrid Meta-Heuristic Approach for Design and Solving a Location Routing Problem Considering the Time Window
Mohammad Amin Rahmani Ahamd Mirzaei Milad Hamzehzadeh Aghbelagh -
Open Access Article
28 - Green Vehicle Routing Problem with Safety and Social Concerns
arghavan sharafi Mahdi Bashiri -
Open Access Article
29 - A new mathematical model for the closed-loop supply chains considering pricing for product, a fleet of heterogeneous vehicles, and inventory costs
Isa Nakhai Kamalabadi mohammad mohammadnejad Ramin sadeghian Fardin ahmadizar -
Open Access Article
30 - A New Mathematical Model for the Green Vehicle Routing Problem by Considering a Bi-Fuel Mixed Vehicle Fleet
Neda Manavizadeh Hamed Farrokhi-Asl Stanley Frederick W.T. Lim -
Open Access Article
31 - A New School Bus Routing Problem Considering Gender Separation, Special Students and Mix Loading: A Genetic Algorithm Approach
Alireza Rashidi Komijan Peiman Ghasemi Kaveh Khalili-Damghani Fakhrosadat HashemiYazdi -
Open Access Article
32 - Multimodal Transportation p-hub Location Routing Problem with Simultaneous Pick-ups and Deliveries
Saeed Zameni Jafar Razmi -
Open Access Article
33 - A Mixed Integer Programming Formulation for the Heterogeneous Fixed Fleet Open Vehicle Routing Problem
Majid Yousefikhoshbakht Frazad Didehvar Farhad Rahmati -
Open Access Article
34 - A Comparison of NSGA II and MOSA for Solving Multi-depots Time-dependent Vehicle Routing Problem with Heterogeneous Fleet
Behrouz Afshar-nadjafi Arian Razmi-farooji -
Open Access Article
35 - A Comparative Study of Meta-heuristic Algorithms for dynamic vehicle routing problem in order to provide efficiency of transportation systems
Nazila Mosayebzadeh Farzin Modarres khiyabaniVehicle Routing Problem (VRP) wasone of the mostpopularoptimization problems that hadmany usages for productivity andefficiency of transportation systems in recent decades.The VehicleRouting Problem with Simultaneous pick-up and deliveries (VRP/SPD),which considers simu MoreVehicle Routing Problem (VRP) wasone of the mostpopularoptimization problems that hadmany usages for productivity andefficiency of transportation systems in recent decades.The VehicleRouting Problem with Simultaneous pick-up and deliveries (VRP/SPD),which considers simultaneous distribution and collection of goodsfrom/to customers (VRP/SDP/SDC) was a variant of the classical vehiclerouting problem where customers require simultaneous pick-up anddelivery at their locations to be completed within a specified time.Applications of the SPD and its related variants are commonly comeacross in every day transportation and optimizing logistic planning. Thispaper had used Meta-heuristic to this end. The proposed method wasapplied for solving capacitated vehicle routing problem (CVRP) toimprove the distribution efficiency and productivity with an objective ofminimizing the total distance covered in each route, while consideringthe capacity of different routes. This problemwas essentially an NP-Hardin nature, so there was no known optimal solution method withpolynomial time. To solve this NP-hard VRP a hybrid genetic basedalgorithm was developed. The proposed geneticalgorithm was tested onsome standardproblem with respect to computational efficiency andsolution quality. The presented method was implemented and itsperformance was further investigated by comparing it against existingheuristics for the same problem. Theresults showed that the success ofthe proposed approach in handling the difficult problem constraints anddevising simple and robust solution mechanisms that can be integratedwith routing optimization tools and used in real world applications. Manuscript profile -
Open Access Article
36 - Vehicle Routing Problem with a Time Window and Stochastic Demand and by Assuming a Competitor in Meeting the Customers' Demands
Behzad Ghasemi Ebrahim Mohammadipirlar Amir Sadeghi -
Open Access Article
37 - Radio Band Utilization Improvement in Wireless Mesh Networks for Multicast Routing
Zeinab Asgari Avid Avokh Mahmood Daneshvar FarzaneganThis paper addresses the cross-layer design for multicast routing in Multi-Radio Multi-Channel Wireless Mesh Networks (MRMC-WMNs) with directional antennas. WMNs have a limited capacity because of existence of interference between the wireless links. This issue becomes MoreThis paper addresses the cross-layer design for multicast routing in Multi-Radio Multi-Channel Wireless Mesh Networks (MRMC-WMNs) with directional antennas. WMNs have a limited capacity because of existence of interference between the wireless links. This issue becomes more crucial in the multicast communications. Directional antennas can focus the transmission power to the limited sector. Thus, equipping the wireless nodes with these antennas leads to degrade interference. This paper proposes two cross-layer algorithms named “Directional Multicast Tree Construction (DMTC)” and the “Directional Interference-aware Multicast Tree Construction (DIMTC)” to solve the aforementioned problems. In the first algorithm, we jointly consider the channel diversity; the wireless broadcast advantage and the directional antenna technology to reduce number of transmissions in the routing trees. In the second one, in addition to above factors we use interference aware path selection factor to eliminate the interference among the multicast sessions. This scheme is aiming at improving the utilization of radio resources reducing both number of transmissions and interference, at the same time. Simulation results demonstrate that our schemes are more efficient than other existing schemes as well. Manuscript profile -
Open Access Article
38 - A New Proposed Clustering Method for Energy Efficient Routing in Wireless Sensor Networks
Sara Nasirian Farhad FaghaniWireless Sensor Networks, have found plenty of applications, nowadays. Due to the presence of tiny and restricted batteries in these little sensors, deployment of a power-efficient routing protocol is a must. Between all the already-proposed routing protocols, the hiera MoreWireless Sensor Networks, have found plenty of applications, nowadays. Due to the presence of tiny and restricted batteries in these little sensors, deployment of a power-efficient routing protocol is a must. Between all the already-proposed routing protocols, the hierarchical ones are more efficient in energy conservation than flat routing protocols. In order to decrease energy consumption and increase the network lifetime, we proposed a new hierarchical routing protocol, by dividing the network area to sectors and two levels and choosing Cluster Heads from the lower level, which is more near to the Base Station. In order to minimize the reverse flow of the data from BS, we use a tree structure in each sector. In addition, the frontier between two levels can be moved during network lifetime and having dead nodes. The results of simulations show that our proposed TSBC protocol outperforms LEACH, Multi-Hop LEACH and many other conventional routing protocols in energy conservation and in network lifetime. One of the most important properties of our scheme that can distinguish it from any other scheme is reverse flow from BS cancellation or at least deduction. The special formula, which is used in our protocol for CH selection, in order to prevent battery depletion in a special spot, can also be adapted to any other hierarchical clustering protocols to achieve higher energy-efficiency. It is still noteworthy to mention that thanks to devising special measures we highly prevent fragmentation occurrence in routing process in the network. Manuscript profile -
Open Access Article
39 - A Road-Aware Routing Protocol for Inter-Vehicle Ad-Hoc Networks
Bahareh Mazloumi Fard Abdolreza HatamlouVehicle ad-hoc networks are examples of mobile ad-hoc networks where vehicles are the mobile nodes. Inthese networks, vehicles are interconnected and can send messages to each other, but also to the roadsideinfrastructure. In such networks, routing is essential for netw MoreVehicle ad-hoc networks are examples of mobile ad-hoc networks where vehicles are the mobile nodes. Inthese networks, vehicles are interconnected and can send messages to each other, but also to the roadsideinfrastructure. In such networks, routing is essential for network design. Poor design causes seriousproblems for vehicle networks. Multi-hop data transmission over VANET networks is a complex task,since network nodes are very mobile and therefore very likely to be disconnected. Therefore, informationdissemination techniques in car networks are very important and have received special attention in recent years. In this research, we present a distributed routing protocol with end-to-end delay computation approach to the generated paths before sending the data packet. This protocol creates a stable backbone on the road components and connects them through bridge nodes. Bridge nodes allocate weight to road components, which it does on the basis of information gathered from delays in routes and communication quality. The simulation results show the success of the proposed protocol compared to two well-known vehicle network protocols including AODV and AOMDV. Manuscript profile -
Open Access Article
40 - Wireless Sensor Networks Routing Using Clustering Based on Multi-Objective Particle Swarm Optimization Algorithm
Seyed Reza Nabavi Nafiseh Osati Eraghi Javad Akbari TorkestaniWith the spread of applications of wireless sensor networks, in recent years, the use of this type of network in order to monitor the environment and analyze data collected from specific environments in a variety of ways has become very common. Wireless sensor networks MoreWith the spread of applications of wireless sensor networks, in recent years, the use of this type of network in order to monitor the environment and analyze data collected from specific environments in a variety of ways has become very common. Wireless sensor networks are one of the best options for collecting data from the environment due to their easy configuration and no need for expensive equipment. The energy of sensors in wireless sensor networks is limited, which is a major challenge due to the lack of a fixed charge source. Because most of the sensors' energy is wasted during data transmission, a sensor that transmits more data than others and transmits data over long distances with packets will run out of energy sooner than others. When a sensor in the network runs out of energy, the network process may be disrupted. Therefore, due to the dynamic topology and distributed nature of wireless sensor networks, designing energy efficient routing protocols is one of the main challenges. Therefore, in this article, energy-aware routing protocol based on multi-objective particle swarm optimization algorithm is presented. In the proposed approach, the fitness function of the particle swarm optimization algorithm for selecting the optimal cluster head based on quality-of-service goals including residual energy, link quality, end-to-end delay and delivery rate. The simulation results show that the proposed approach has less energy consuming and extend network lifetime due to balancing the goals of quality-of-service criteria than other approaches. Manuscript profile -
Open Access Article
41 - A New QoS-Based Routing Protocol for Video Streaming in VANETs Using ACO Algorithm and Fuzzy Logic
Mohammad Vafaei Ahmad Khademzadeh Mohammad Ali PourminaThe multi-path transmission is an appropriate transmission method for high data rate packets like video streaming. To provide video streaming with high quality, the video packets are divided into different frames for transmitting through various paths. Nevertheless, reg MoreThe multi-path transmission is an appropriate transmission method for high data rate packets like video streaming. To provide video streaming with high quality, the video packets are divided into different frames for transmitting through various paths. Nevertheless, regarding the results of numerous inherent features of vehicular ad-hoc networks (VANETs), designing an efficient and stable routing protocol is difficult for various applications of VANETs. In particular, the dynamic nature of topology and intermittent connectivity make maintaining the quality of service (QoS) task very difficult. To provide QoS to entertainment applications and traffic safety in VANET, we offer a routing protocol based on the adaptive intersection with QoS support regarding delay, packet delivery ratio (PDR), and connectivity probability. To establish the best QoS routes, we considered the equivalent routing problem as the optimization problem and then proposed an algorithm based on ant colony optimization (ACO) for solving it. Furthermore, a fuzzy logic-based algorithm was employed to select the best next-hop vehicle by incorporating multiple metrics associated with the vehicle’s position, link quality, and vehicle mobility. According to the simulation results, the proposed approach achieves the average PDR of more than 84.2%, the end-to-end delay of less than 3.58 s, the overhead of less than 15.65%, and the peak signal to noise ratio (PSNR) of more than 20.82 dB. It is understandable from the result analysis that the performance of the proposed approach is excellent. Manuscript profile -
Open Access Article
42 - Delay-Tolerant Routing Optimization Using Simulated Annealing Heuristic Algorithm in Disrupted Mobile Ad-Hoc Networks
Somaye Pirzadi Mohammad Ali Pourmina Seyed Mostafa Safavi-HemamiGiven the importance of reducing data latency in discrete wireless networks in critical situations, we present the combined routing protocol with a storage and forwarding approach in Throw-Box-based network topology concerning aspects such as proper relay prediction and MoreGiven the importance of reducing data latency in discrete wireless networks in critical situations, we present the combined routing protocol with a storage and forwarding approach in Throw-Box-based network topology concerning aspects such as proper relay prediction and effective buffer management. To reduce the data transfer time in the relay node selection criteria, we consider the effect of different factors: node records, end-to-end latency, the nodes' available buffer space, and information such as average speed and node movement direction. We also use artificial intelligence to perform optimal routing using the Simulated Annealing algorithm. Important common performance criteria such as average latency, delivery ratio, number of lost messages, and network overhead were used to evaluate the performance of the proposed model. The results showed that our proposed routing method has less reception delay than other routing methods and maintains maximum transmission. Manuscript profile -
Open Access Article
43 - Reliable Relay Node Selection to Real-Time Messaging in Vehicular Networks
Yaser Taj Bahador BakhshiSareskanrood Hessam ZandHessamiOne of the intelligent transportation systems' goals is to improve safety and increase the quality of service on road journeys. Transmitting the message in critical situations with minimal delay and on time is essential for ensuring the health and safety of citizens on MoreOne of the intelligent transportation systems' goals is to improve safety and increase the quality of service on road journeys. Transmitting the message in critical situations with minimal delay and on time is essential for ensuring the health and safety of citizens on road trips. Frequent topological changes pose significant challenges to the operation of safety programs and reduce the probability of sending critical messages in real-time. This article proposes the reliable relay node selection to real-time messaging (RRRM) routing algorithm to increase the reliability of sending real-time messages in vehicular networks. To expedite the transmission of information, by introducing three indicators for selecting intermediate vehicles entitled "Record of vehicle displacement", "Similarity of vehicle velocity with the velocity average of neighbor vehicles", and "Amount of trusty adjacent vehicles", the route vehicles are scored. The worthiest vehicles are selected as members of the route. RRRM measures the temporal conformity of the vehicles' previous presence in the current route and the stability of their connection with neighboring vehicles. It avoids route failure, increased delays, and failure to send critical messages to the destination by preventing the selection of unreliable vehicles as relays. Extensive simulations with multiple scenarios in the NS-3 and SUMO demonstrate the superiority of the RRRM in reducing route-failure, mean latency, and control overload, as well as increasing packet delivery rates in urban and highway environments. Manuscript profile -
Open Access Article
44 - Comparison of the accuracy of the Modified At-kin and the Convex methods in flood routing in a Dalaki River reach
Masoud Mesbahi Majid Abbasizadeh Mohammadreza NikmaneshIn this research, using two hydrological methods, convex and At-Kin, the flood routing was investigated in the Sarqanat and Kalel reach located in the Dalki River. To perform this operation, 26 flood hydrographs were selected as input to the model. and the output hydrog MoreIn this research, using two hydrological methods, convex and At-Kin, the flood routing was investigated in the Sarqanat and Kalel reach located in the Dalki River. To perform this operation, 26 flood hydrographs were selected as input to the model. and the output hydrographs of the models were compared to the observed output hydrograph at the station located in downstream of reach. In order to evaluate the efficiency and accuracy of the models, the RMSE was used. The results showed that the hydrological method of Atkin is significantly less accurate than the graphic (regression) method of Convex, but it is more accurate compared to the two sub-methods of Singh and SCS of Convex. Also it was found that the graphical method of Convex (or regression) with an average error value of 21.26 m3/s. is more suitable than other methods in this research. And then the best methods include Atkin, Singh and SCS with RMSE values of 70.16, 77.87 and 79.3 m3/s. However, the difference between Singh and SCS methods is not serious. The RMSE values in all methods used in this research show a lower value in 50% Qp compared to the Qp. In Atkin's method, the amount of error in the conditions of using 50%Qp has reached from 78.5 to 70.71 m3/s. According to the mentioned results, it is recommended that researchers use 50%Qp in flood routing operation. Manuscript profile -
Open Access Article
45 - A New Method to Reduce Energy Consumption in Manet Network Routing based on OLSR Protocol and Genetic Algorithm
Samira Fardin Far Mohammad Alaei -
Open Access Article
46 - Improve range-free localization accuracy in wireless sensor network using DV-hop and zoning
Fahimeh Doagoey -
Open Access Article
47 - Non-Blocking Routers Design Based on West First Routing Algorithm & MZI Switches for Photonic NoC
Masoume Seifolahi Elham Yaghoubi -
Open Access Article
48 - an Adaptive Routing Strategy to Reduce Energy Consumption in Network on Chip
Mohammad Trik Saadat Pour Mozafari Amir Massoud Bidgoli -
Open Access Article
49 - A Meta-heuristic Approach to CVRP Problem: Local Search Optimization Based on GA and Ant Colony
Arash Mazidi Mostafa Fakhrahmad Mohammadhadi Sadreddini -
Open Access Article
50 - A New Greedy Geographical Routing in Wireless Sensor Networks
Majid Hatamian Hamid Barati Ali Movaghar -
Open Access Article
51 - An Improved Modified Tabu Search Algorithm to Solve the Vehicle Routing Problem with Simultaneous Pickup and Delivery
Majid Yousefikhoshbakht Farzad Didehvar Farhad Rahmati -
Open Access Article
52 - Optimizing a sustainable inventory-routing problem in tomato agri-chain considering postharvest biological behavior
Shima Shirzadi Vahidreza Ghezavati Reza Tavakkoli-Moghaddam Sadoullah Ebrahimnejad -
Open Access Article
53 - Designing a model of product arrangement and multi-warehouse location-routing problem
saeed sadeghi mohammad fallah esmaeil najafi -
Open Access Article
54 - A heuristic algorithm for solving bi-level programming problems with application to large-scale location-arc routing in urban traffic lights maintenance
Amir Abbas Shojaie Alireza Rashidi Komijan Mohammad AmirabadiThe present study developed a bi-level mathematical model to determine optimal routes for repair teams in charge of inspecting urban traffic lights. In this model, the municipality as the leader locates the construction sites of urban spare parts warehouses and repair c MoreThe present study developed a bi-level mathematical model to determine optimal routes for repair teams in charge of inspecting urban traffic lights. In this model, the municipality as the leader locates the construction sites of urban spare parts warehouses and repair centers to minimize the costs of constructing the facilities. At the follower level, the contractor determines the optimal routes for the repair teams. Bi-level models are strongly NP-hard in type. A heuristic algorithm is therefore developed to solve numerical examples, in which the leader first determines different decision-making strategies for the follower through generating a set of justified solutions. In response to the leader’s set of strategies, the follower presents a set of corresponding solutions. The individual solutions of the follower are then entered into the leader model and the corresponding values of the objective function are calculated. A solution with the optimal numerical value for the leader is ultimately selected as the Stackelberg equilibrium. The efficiency of the proposed model and algorithm was evaluated by presenting the computational results obtained from solving several random numerical examples of small, medium and large dimensions through generating the Stackelberg equilibrium and establishing a relationship between the leader and follower levels. The present findings are recommended to be used as a management tool by policymakers in the urban management sector. Manuscript profile -
Open Access Article
55 - Aircraft routing problem considering various maintenance operation factors: A literature review
Masoumeh Mirjafari Alireza Rashidi Komijan Ahmad Shoja -
Open Access Article
56 - Solving a bi-objective location routing problem by a NSGA-II combined with clustering approach: application in waste collection problem
Masoud Rabbani Hamed Farrokhi-Asl Bahare Asgarian -
Open Access Article
57 - A novel heuristic algorithm for capacitated vehicle routing problem
Sena Kır Harun Res¸it Yazgan Emre Tüncel -
Open Access Article
58 - A hybrid meta-heuristic algorithm for the vehicle routing problem with stochastic travel times considering the driver's satisfaction
Reza Tavakkoli-Moghaddam Mehdi Alinaghian Alireza Salamat-Bakhsh Narges Norouzi -
Open Access Article
59 - Locomotive assignment problem with train precedence using genetic algorithm
Siamak Noori Seyed Farid Ghannadpour -
Open Access Article
60 - A green vehicle routing problem with customer satisfaction criteria
M. Afshar-Bakeshloo A. Mehrabi H . Safari M. Maleki F. Jolai -
Open Access Article
61 - Solving the vehicle routing problem by a hybrid meta-heuristic algorithm
Majid Yousefikhoshbakht Esmaile Khorram -
Open Access Article
62 - Cooperative vehicle routing problem: an opportunity for cost saving
Sedighe Zibaei Ashkan Hafezalkotob Seyed Sajad Ghashami -
Open Access Article
63 - Two phase genetic algorithm for vehicle routing and scheduling problem with cross-docking and time windows considering customer satisfaction
Ali Baniamerian Mahdi Bashiri Fahime Zabihi -
Open Access Article
64 - Cuckoo search via Lévy flights for the capacitated vehicle routing problem
Jon Henly Santillan Samantha Tapucar Cinmayii Manliguez Vicente Calag -
Open Access Article
65 - A set-covering formulation for a drayage problem with single and double container loads
A. Ghezelsoflu M. Di Francesco A. Frangioni P. Zuddas -
Open Access Article
66 - Parallel computation framework for optimizing trailer routes in bulk transportation
Ugandhar Delli Ashesh Kumar Sinha -
Open Access Article
67 - A goal programming model for vehicle routing problem with backhauls and soft time windows
M Aghdaghi F Jolai -
Open Access Article
68 - A multi-criteria vehicle routing problem with soft time windows by simulated annealing
R Tavakkoli-Moghaddam N Safaei M.A Shariat -
Open Access Article
69 - Advanced operations research techniques for multi-constraint QoS routing in internet
HK Arunkumar S Sivakumar -
Open Access Article
70 - Power Distribution Expansion Planning
مختار درخشی جواد علمایی -
Open Access Article
71 - A New method for Routing Optimization in Vehicular Ad Hoc Networks (VANETs)
Akram Khaleghi Tabar Razieh Farazkish -
Open Access Article
72 - Multi-objective Dynamic Planning of Substations and Primary Feeders Considering Uncertainties and Reliability
Masoumeh Karimi Mahmoud Reza Haghifam -
Open Access Article
73 - A Novel Secure Routing Method based on Hybrid Encryption in Heterogeneous Wireless Sensor Networks
Milad Jafari Mohsen Chekin Amin Mehranzadeh -
Open Access Article
74 - A New Method based on Intelligent Water Drops for Multicast Routing in Wireless Mesh Networks
shiva zendehdelan Reza Ravanmehr babak vaziri