科研之友
微信
新浪微博
Facebook
分享链接
摘要
The min-max vehicle routing problem (VRP) is a variant of the classical VRP in which the objective is to minimize the duration of the longest route. Examination of the VRP literature indicates that the min-max VRP has received less attention than other variants have over the years. However, the problem has important practical applications, such as those related to routing school buses. In this setting, in addition to the min-max criterion imposed on the time it takes to complete the longest route, school districts are concerned with the minimization of the total distance traveled, which is the objective of the classical VRP. Hence, the problem is formulated as a bi-objective optimization model that trades off service (i.e., the minimization of the longest route) and operational cost (i.e., the minimization of the total distance traveled). We develop a solution procedure for this problem by applying tabu search within the framework of Multiobjective Adaptive Memory Programming and compare it to an implementation of the Non-dominated Sorting Genetic Algorithm-a well-known approach to multiobjective optimization. We also assess the merit of the solution method by comparing our approximations with solution frontiers obtained with an epsilon-constraint implementation.
- 出版日期2013-8
