List of Articles routing problem

• Open Access Article
  • Abstract Page
  • Full-Text
  
  1 - An integrated model for a multi-product production-inventory-routing problem in a bi-echelon green supply chain
  Adel Aazami Ali Papi mir saman pishvaee
  Manufacturing company’s decisions regarding the quantity of production and inventory is a production planning and inventory control problem. Decisions about transferring products are expressed as a transportation and routing problem. Considering these three problems tog More

  Manufacturing company’s decisions regarding the quantity of production and inventory is a production planning and inventory control problem. Decisions about transferring products are expressed as a transportation and routing problem. Considering these three problems together results in an integrated production-inventory-routing planning (PIRP) which is one of the important supply chain problems. Companies which solve their PIRP problems better can decrease the cost of their products and gain more competitive advantage compared to other competing companies. Based on today’s strict regulations, companies must take into account environmental considerations in addition to economical ones in all their processes, from production until supply. Thus, an appropriate transportation planning can prevent the excessive increase in costs and decrease environmental pollution. Therefore, this study integrates the problem of decreasing environmental pollution with PIRP and develops a green PIRP (GPIRP) problem which efficiently considers the economic and social dimensions of production and supply. This problem is modeled in an integrated manner using the MILP approach. In order to show the applicability of the developed model and its practicability of environmental aspect, a case study is conducted on Ahvaz Sugar Refinery, Iran. Finally, some managerial insights are derived from the computational results. Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  2 - Resource Management in Multimedia Networks Using Software-Defined Network Technology
  Ahmadreza Montazerolghaem
  Nowadays, multimedia networks on the Internet have become a low-cost and efficient alternative to PSTN. Multimedia transfer applications on the Internet are becoming more and more popular. This connection consists of two phases: signaling and media. The signaling phase More

  Nowadays, multimedia networks on the Internet have become a low-cost and efficient alternative to PSTN. Multimedia transfer applications on the Internet are becoming more and more popular. This connection consists of two phases: signaling and media. The signaling phase is performed by SIP proxies and the media phase by network switches. One of the most important challenges in multimedia networks is the overload of SIP proxies and network switches in the signaling and media phases. The existence of this challenge causes a wide range of network users to face a sharp decline in the quality of service. In this article, we model the routing problem in multimedia networks to deal with the overload. In this regard, we present a technology-based method of software-based networks and a mathematical programming model in multimedia networks. The proposed method is simulated under various scenarios and topologies. The results investigate that the throughput and resource consumption has improved. Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  3 - An Individual-Oriented Shuffled Frog Leaping Algorithm for Solving Vehicle Routing Problem
  Soheila Shafiezadeh Zahra Beheshti
  The Vehicle Routing Problem (VRP) is one of the most important problems in supply chain management because the optimal allocation of vehicles has a significant impact on reducing costs. VRP is in the class of NP-hard problems and exact algorithms cannot find the best so More

  The Vehicle Routing Problem (VRP) is one of the most important problems in supply chain management because the optimal allocation of vehicles has a significant impact on reducing costs. VRP is in the class of NP-hard problems and exact algorithms cannot find the best solution in an acceptable time. Hence, meta-heuristic algorithms can be employed to solve it. Shuffled Frog Leaping Algorithm (SFLA) is one of the meta-heuristic algorithms, which is efficient, but in some cases, its population diversity rapidly reduces, and the algorithm falls in local optima. In this study, an Individual-Oriented Shuffled Frog Leaping Algorithm (IO-SFLA) is proposed to enhance the exploration and exploitation of SFLA by exchanging the global and local information. Several VRPs in different dimensions are applied to evaluate the performance of IO-SFLA. The efficiency of IO-SFLA is compared with several improved shuffled frog leaping algorithms, Simulated Annealing (SA) and Genetic Algorithm (GA). The results show that IO-SFLA provides significant results compared with the other competitor algorithms. IO-SFLA achieves an average of 1130.442 for the best path cost. The next rank belongs to SA with an average of 1228.725. Other compared algorithms are in the lower ranks with high differences in results. Manuscript profile