Journal of New Researches in Mathematics
,
Issue37,Year,
Summer
2021
مساله مسیریابی وسیله نقلیه (VRP) یکی از مهمترین مسایل تحقیق در عملیات در صنایع و خدمات است که امروزه با توجه به هزینه بالای حمل و نقل در قیمت نهایی کالا، بسیار مورد توجه قرار میگیرد. از طرف دیگر با توجه به اینکه استفاده از وسایل نقلیه با ظرفیتهای گوناگون سبب کاهش بیش More
مساله مسیریابی وسیله نقلیه (VRP) یکی از مهمترین مسایل تحقیق در عملیات در صنایع و خدمات است که امروزه با توجه به هزینه بالای حمل و نقل در قیمت نهایی کالا، بسیار مورد توجه قرار میگیرد. از طرف دیگر با توجه به اینکه استفاده از وسایل نقلیه با ظرفیتهای گوناگون سبب کاهش بیشتر این هزینه میگردد، مسئله مسیریابی وسایل نقلیه آمیخته (FSMVRP) ارایه شد و از آن زمان، پیشرفت قابلتوجهی در مورد این مسائل و انواع آن در جهت استفاده در وسایل واقعی صورت گرفت. در این مساله، انواع مختلفی از وسایل نقلیه با ظرفیت متفاوت موجود در انبار کالای یکتا، برای خدمت به مجموعهای از مشتریان با موقعیتهای جغرافیایی شناخته شده، وجود دارند. به علاوه در این مسئله، هر یک از مشتریها به میزان خاصی کالا نیاز دارند که باید توسط ناوگانی ثابت از وسائل نقلیه به آنها تحویل گردد. هدف تعیین مجموعهای از تورها برای وسائل نقلیه با کمترین هزینه است به شرط آنکه هر وسیله نقلیه از انبار شروع به حرکت کرده و در انتها به آن بازگردد، هر مشتری دقیقاً یکبار توسط یک وسیله نقلیه بازدید شود و کل تقاضای مشتریهای هر تور از ظرفیت هر نوع از وسیله نقلیه، که 〖 q〗_iدر نظر گرفته میشود، تجاوز نکند. هدف این مقاله، طبقهبندی و بررسی مطالب مربوط به FSMVRP است. در این مقاله همچنین یک تحلیل مقایسهای از الگوریتمهای فراابتکاری برای این مساله ارائهشده است.
Manuscript profile
Journal of Optimization in Industrial Engineering
,
Issue18,Year,
Autumn
2015
The heterogeneous fixed fleet open vehicle routing problem (HFFOVRP) is one of the most significant extension problems of the open vehicle routing problem (OVRP). The HFFOVRP is the problem of designing collection routes to a number of predefined nodes by a fixed fleet More
The heterogeneous fixed fleet open vehicle routing problem (HFFOVRP) is one of the most significant extension problems of the open vehicle routing problem (OVRP). The HFFOVRP is the problem of designing collection routes to a number of predefined nodes by a fixed fleet number of vehicles with various capacities and related costs. In this problem, the vehicle doesn’t return to the depot after serving the last customer. Because of its numerous applications in industrial and service problems, a new model of the HFFOVRP based on mixed integer programming is proposed in this paper. Furthermore, due to its NP-hard nature, an ant colony system (ACS) algorithm was proposed. Since there were no existing benchmarks, this study generated some test problems. From the comparison with the results of exact algorithm, the proposed algorithm showed that it can provide better solutions within a comparatively shorter period of time.
Manuscript profile
Journal of Optimization in Industrial Engineering
,
Issue16,Year,
Winter
2014
The multiple traveling salesman problem (MTSP) is a generalization of the famous traveling salesman problem (TSP), where more than one salesman is used in the solution. Although the MTSP is a typical kind of computationally complex combinatorial optimization problem, it More
The multiple traveling salesman problem (MTSP) is a generalization of the famous traveling salesman problem (TSP), where more than one salesman is used in the solution. Although the MTSP is a typical kind of computationally complex combinatorial optimization problem, it can be extended to a wide variety of routing problems. This paper presents an efficient and evolutionary optimization algorithm which has been developed through combining Modified Imperialist Competitive Algorithm and Lin-Kernigan Algorithm (MICA) in order to solve the MTSP. In the proposed algorithm, an absorption function and several local search algorithms as a revolution operator are used. The performance of our algorithm was tested on several MTSP benchmark problems and the results confirmed that the MICA performs well and is quite competitive with other meta-heuristic algorithms.
Manuscript profile
Journal of Optimization in Industrial Engineering
,
Issue8,Year,
Summer
2011
The multiple traveling salesman problem (MTSP) involves scheduling m > 1 salesmen to visit a set of n > m nodes so that each node is visited exactly once. The objective is to minimize the total distance traveled by all the salesmen. The MTSP is an example of combi More
The multiple traveling salesman problem (MTSP) involves scheduling m > 1 salesmen to visit a set of n > m nodes so that each node is visited exactly once. The objective is to minimize the total distance traveled by all the salesmen. The MTSP is an example of combinatorial optimization problems, and has a multiplicity of applications, mostly in the areas of routing and scheduling. In this paper, a modified hybrid metaheuristic algorithm called GA2OPT for solving the MTSP is proposed. In this algorithm, at the first stage, the MTSP is solved by the modified genetic Algorithm (GA) in each iteration, and, at the second stage, the 2-Opt local search algorithm is used for improving solutions for that iteration. The proposed algorithm was tested on a set of 6 benchmark instances from the TSPLIB and in all but four instances the best known solution was improved. For the rest instances, the quality of the produced solution deviates less than 0.01% from the best known solutions ever.
Manuscript profile
Sanad
Sanad is a platform for managing Azad University publications