Bibliographic Details
| Title: |
Valid inequalities for the non-unit demand capacitated minimum spanning tree problem with arc time windows and flow costs. |
| Authors: |
Kritikos, Manolis N.1 (AUTHOR), Ioannou, George1 (AUTHOR) ioannou@aueb.gr |
| Superior Title: |
International Journal of Production Research. Jan2024, Vol. 62 Issue 1/2, p574-585. 12p. |
| Subject Terms: |
*INTEGER programming, *OPERATIONS research, SPANNING trees, VEHICLE routing problem, ROUTING algorithms |
| Abstract: |
In this paper, we introduce the non-unit demand capacitated minimum spanning tree problem with arc time windows and flow costs. The problem is a variant of the capacitated minimum spanning tree problem with arc time windows (CMSTP_ATW). We devise a mixed integer programming (MIP) formulation to model the problem and solve it using CPLEX. Furthermore, we propose three sets of inequalities, and we prove that they are valid. These valid inequalities tighten the model and lead to better lower bounds. To examine the quality of the solutions obtained, we convert the original data sets of Solomon (1987, "Algorithms for the Vehicle Routing and Scheduling Problem with Time Window Constraints." Operations Research 35 (2): 254–265. ) to approximate the non-unit demand CMSTP_ATW instances and provide results for the problems with 100 nodes. We execute extensive computational experiments, and the results show the positive effect of the inclusion of valid inequalities in the MIP. [ABSTRACT FROM AUTHOR] |
|
Copyright of International Journal of Production Research is the property of Taylor & Francis Ltd 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.) |
| Database: |
Business Source Premier |
