Getting Beyond the First Result of Solving a Vehicle Routing Problem

INFORMS Transactions on Education

article

John F. Wellington¹  Stephen A. Lewis¹ 

[1] Purdue University Fort Wayne

关键词: Excel spreadsheet modeling;    traveling salesman problem;    vehicle routing problem;   

DOI  :  10.1287/ited.2021.0255

学科分类：数学（综合）

来源: INFORMS

【 摘 要 】

The simple vehicle routing problem (VRP) is a common topic of discussion in introductory operations research/management science courses. The VRP can be framed in a variety of ways, and it can be difficult to solve to optimality. For solution purposes, introductory textbooks demonstrate how Excel’s Evolutionary Solver (ES) add-in produces a routing. The ES utilizes a genetic algorithm with a heuristic stopping rule to produce a routing that is not guaranteed to be optimal. Beyond pointing out that search controls, such as maximum execution time, may be extended and followed by restart(s) of ES, textbook treatments do not offer alternative ways to continue the search for a possibly better routing. In this paper, a suite of ways is presented in which students may investigate beyond what ES produces or any other optimality-uncertain VRP solution method. The suite includes perturbation methods and other ways that function within an Excel spreadsheet environment that is popular with students and textbook writers. Because there is no demonstrable feature that confirms optimality, the student problem Solver must settle for a ‘best found’ result as unsettling as it may be. The incertitude is addressed.

【 授权许可】

CC BY|CC BY-SA|CC BY-ND|CC BY-NC|CC BY-NC-SA|CC BY-NC-ND