-
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 - 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
3 - 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
4 - 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
5 - 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
6 - Green Vehicle Routing Problem with Safety and Social Concerns
arghavan sharafi Mahdi Bashiri -
Open Access Article
7 - A Mixed Integer Programming Formulation for the Heterogeneous Fixed Fleet Open Vehicle Routing Problem
Majid Yousefikhoshbakht Frazad Didehvar Farhad Rahmati -
Open Access Article
8 - 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
9 - 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
10 - 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
11 - 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
12 - 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
13 - A novel heuristic algorithm for capacitated vehicle routing problem
Sena Kır Harun Res¸it Yazgan Emre Tüncel -
Open Access Article
14 - 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
15 - A green vehicle routing problem with customer satisfaction criteria
M. Afshar-Bakeshloo A. Mehrabi H . Safari M. Maleki F. Jolai -
Open Access Article
16 - Solving the vehicle routing problem by a hybrid meta-heuristic algorithm
Majid Yousefikhoshbakht Esmaile Khorram -
Open Access Article
17 - Cooperative vehicle routing problem: an opportunity for cost saving
Sedighe Zibaei Ashkan Hafezalkotob Seyed Sajad Ghashami -
Open Access Article
18 - Cuckoo search via Lévy flights for the capacitated vehicle routing problem
Jon Henly Santillan Samantha Tapucar Cinmayii Manliguez Vicente Calag -
Open Access Article
19 - 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
20 - Parallel computation framework for optimizing trailer routes in bulk transportation
Ugandhar Delli Ashesh Kumar Sinha -
Open Access Article
21 - A goal programming model for vehicle routing problem with backhauls and soft time windows
M Aghdaghi F Jolai -
Open Access Article
22 - A multi-criteria vehicle routing problem with soft time windows by simulated annealing
R Tavakkoli-Moghaddam N Safaei M.A Shariat
Sanad
Sanad is a platform for managing Azad University publications
Links
Related Centers
Technical Support
Official pages
The rights to this website are owned by the Raimag Press Management System.
Copyright © 2021-2024