التفاصيل البيبلوغرافية
| العنوان: |
A branch-and-cut algorithm for vehicle routing problems. |
| المؤلفون: |
Araque, J. R. G.1 araque@ecn.purdue.edu, Kudva, G.2 kudva@ecn.purdue.edu, Morin, T. L.1 morin@ecn.purdue.edu, Pekny, J. F.2 pekny@ecn.purdue.edu |
| المصدر: |
Annals of Operations Research. 1994, Vol. 50 Issue 1-4, p37-59. 23p. 2 Diagrams, 2 Charts, 3 Graphs. |
| مصطلحات موضوعية: |
*ALGORITHMS, *MATHEMATICAL analysis, ROUTING-machines, POLYHEDRAL functions, MATRICES (Mathematics), TRAFFIC flow |
| مستخلص: |
We present a branch-and-cut algorithm for the identical customer Vehicle Routing Problem. Transforming the problem into an equivalent Path-Partitioning Problem allows us to exploit its polyhedral structure and to generate strong cuts corresponding to facet-inducing inequalities. By using cuts defined by multistars, partial multistars and generalized subtour elimination constraints, we are able to consistently solve 60-city problems to proven optimality and are currently attempting to solve problems involving a hundred cities. We also present details of the computer implementation and our computational results. [ABSTRACT FROM AUTHOR] |
|
Copyright of Annals of Operations Research is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| قاعدة البيانات: |
Business Source Index |
