Abstract
We consider a framework for obtaining a sequence of converging primal and dual bounds based on mixed integer linear programming formulations on layered graphs. The proposed iterative algorithm avoids the typically rather large size of the full layered graph by approximating it incrementally. We focus in particular on this refinement step that extends the graph in each iteration. Novel path-based approaches are compared to existing variants from the literature. Experiments on two benchmark problems—the traveling salesman problem with time windows and the rooted distance-constrained minimum spanning tree problem—show the effectiveness of our new strategies. Moreover, we investigate the impact of a strong heuristic component within the algorithm, both for improving convergence speed and for improving the potential of an employed reduced cost fixing step.
Supported by the Vienna Science and Technology Fund through project ICT15-014.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
When referring to the full LG \(G_{\mathrm {L}}\) in the following, we assume this step to be completed.
- 2.
In case of cycles due to zero travel times, these inequalities become mandatory.
References
Ascheuer, N., Fischetti, M., Grötschel, M.: Solving the asymmetric travelling salesman problem with time windows by branch-and-cut. Math. Program. Ser. B 90(3), 475–506 (2001)
Baldacci, R., Mingozzi, A., Roberti, R.: New state-space relaxations for solving the traveling salesman problem with time windows. INFORMS J. Comput. 24(3), 356–371 (2012)
Boland, N., Hewitt, M., Marshall, L., Savelsbergh, M.: The continuous-time service network design problem. Oper. Res. 65(5), 1303–1321 (2017)
Boland, N., Hewitt, M., Vu, D.M., Savelsbergh, M.: Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks. In: Salvagnin, D., Lombardi, M. (eds.) CPAIOR 2017. LNCS, vol. 10335, pp. 254–262. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-59776-8_21
Clautiaux, F., Hanafi, S., Macedo, R., Voge, M.É., Alves, C.: Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints. Eur. J. Oper. Res. 258(2), 467–477 (2017)
Dash, S., Günlük, O., Lodi, A., Tramontani, A.: A time bucket formulation for the traveling salesman problem with time windows. INFORMS J. Comput. 24(1), 132–147 (2012)
Dumas, Y., Desrosiers, J., Gelinas, E., Solomon, M.M.: An optimal algorithm for the traveling salesman problem with time windows. Oper. Res. 43(2), 367–371 (1995)
Gouveia, L., Leitner, M., Ruthmair, M.: Layered graph approaches for combinatorial optimization problems. Comput. Oper. Res. 102, 22–38 (2019)
Gouveia, L., Paias, A., Sharma, D.: Modeling and solving the rooted distance-constrained minimum spanning tree problem. Comput. Oper. Res. 35(2), 600–613 (2008). Part Special Issue: Location Modeling Dedicated to the memory of Charles S. ReVelle
Leitner, M., Ruthmair, M., Raidl, G.R.: Stabilizing branch-and-price for constrained tree problems. Networks 61(2), 150–170 (2013)
Macedo, R., Alves, C., de Carvalho, J.M.V., Clautiaux, F., Hanafi, S.: Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model. Eur. J. Oper. Res. 214(3), 536–545 (2011)
Picard, J.C., Queyranne, M.: The time-dependent traveling salesman problem and its application to the tardiness problem in one-machine scheduling. Oper. Res. 26(1), 86–110 (1978)
Riedler, M., Jatschka, T., Maschler, J., Raidl, G.R.: An iterative time-bucket refinement algorithm for a high-resolution resource-constrained project scheduling problem. Int. Trans. Oper. Res. (2017). https://doi.org/10.1111/itor.12445
Ruthmair, M.: On solving constrained tree problems and an adaptive layers framework. Ph.D. thesis, TU Wien, Vienna (2012)
Ruthmair, M., Raidl, G.R.: A layered graph model and an adaptive layers framework to solve delay-constrained minimum tree problems. In: Günlük, O., Woeginger, G.J. (eds.) IPCO 2011. LNCS, vol. 6655, pp. 376–388. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-20807-2_30
Wang, X., Regan, A.C.: Local truckload pickup and delivery with hard time window constraints. Transp. Res. B 36(2), 97–112 (2002)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Riedler, M., Ruthmair, M., Raidl, G.R. (2019). Strategies for Iteratively Refining Layered Graph Models. In: Blesa Aguilera, M., Blum, C., Gambini Santos, H., Pinacho-Davidson, P., Godoy del Campo, J. (eds) Hybrid Metaheuristics. HM 2019. Lecture Notes in Computer Science(), vol 11299. Springer, Cham. https://doi.org/10.1007/978-3-030-05983-5_4
Download citation
DOI: https://doi.org/10.1007/978-3-030-05983-5_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-05982-8
Online ISBN: 978-3-030-05983-5
eBook Packages: Computer ScienceComputer Science (R0)