On a Traveling Salesman based Bilevel Programming Problem

Pablo Adasme, Rafael Andrade, Janny Leung, Abdel Lisser

Abstract

In this paper, we consider a linear bilevel programming problem where both the leader and the follower maximize their profits subject to budget constraints. Additionally, we impose a Hamiltonian cycle topology constraint in the leader problem. In particular, models of this type can be motivated by telecommunication companies when dealing with traffic network flows from one server to another one within a ring topology framework. We transform the bilevel programming problem into an equivalent single level optimization problem that we further linearize in order to derive mixed integer linear programming (MILP) formulations. This is achieved by replacing the follower problem with the equivalent Karush Kuhn Tucker conditions and with a linearization approach to deal with the complementarity constraints. The topology constraint is handled by the means of two compact formulations and an exponential one from the classic traveling salesman problem. Thus, we compute optimal solutions and upper bounds with linear programs. One of the compact models allows to solve instances with up to 250 nodes to optimality. Finally, we propose an iterative procedure that allows to compute optimal solutions in remarkably less computational effort when compared to the compact models.

References

  1. Adasme, P., Andrade, R., Letournel, M., and Lisser, A. (2015). Stochastic maximum weight forest problem. Networks, 65:289-305.
  2. Audet, C., Hansen, P., Jaumard, B., and Savard, G. (1997). Links between linear bilevel and mixed 0-1 programming problems. Journal of Optimization Theory and Applications, 93:273-300.
  3. Cormen, T. H., Leiserson, C. E., Rivest, R. L., and Stein, C. (2009). Introduction to algorithms. MIT Press and McGraw-Hill, Cumberland, RI, USA.
  4. Dempe, S. (2002). Foundations of bilevel programming. (1st ed.). Freiberg: Kluwer Academic Publishers.
  5. Dempe, S. (2003). Annotated bibliography on bilevel programming and mathematical programs with equilibrium constraints. Optimization, 52:333-359.
  6. Floudas, C. and Pardalos, P. (2001). Encyclopedia of optimization. Dordrecht: Kluwer Academic Publishers.
  7. Gavish, B. and Graves, S. C. (1978). The travelling salesman problem and related problems. Operations Research Centre, Massachusetts Institute of Technology.
  8. Lee, D., Attias, R., Puri, A., Sengupta, R., Tripakis, S., and Varaiya, P. (2001). A wireless token ring protocol for intelligent transportation systems. In IEEE Proceedings of: Intelligent Transportation Systems, pages 1152-1157.
  9. Letchford, A. N., Nasiri, S. D., and Theis, D. O. (2013). Compact formulations of the steiner traveling salesman problem and related problems. European Journal of Operational Research, 228:83-92.
  10. Migdalas, A., Pardalos, P., and Varbrand, P. (1997). Multilevel optimization: Algorithms and Applications. The Netherlands: Kluwer Academic Publishers.
  11. Miller, C. E., Tucker, A. W., and Zemlin, R. A. (1960). Integer programming formulation of traveling salesman problems. J. Assoc. Comput. Mach., 7:326-329.
  12. Scholtes, S. (2004). Nonconvex structures in nonlinear programming. Operations Research, 52:368-383.
  13. Song, J. and Yang, O. (1997). Backbone networks using rotation counters. IEEE Transactions on Parallel and Distributed Systems, 8:1288-1298.
  14. Thirwani, D. and Arora, S. (1998). An algorithm for quadratic bilevel programming problem. International Journal of Management and System, 14:89-98.
  15. Vicente, L., Savard, G., and Judice, J. (1994). Descent approaches for quadratic bilevel programming. Journal of Optimization Theory and Applications, 81:379- 399.
  16. Wang, S., Wang, Q., and Rodriguez, R. (1994). Optimality conditions and an algorithm for linear-quadratic bilevel programs. Optimization, 31:127-139.
Download


Paper Citation


in Harvard Style

Adasme P., Andrade R., Leung J. and Lisser A. (2017). On a Traveling Salesman based Bilevel Programming Problem . In Proceedings of the 6th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-218-9, pages 329-336. DOI: 10.5220/0006190503290336


in Bibtex Style

@conference{icores17,
author={Pablo Adasme and Rafael Andrade and Janny Leung and Abdel Lisser},
title={On a Traveling Salesman based Bilevel Programming Problem},
booktitle={Proceedings of the 6th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2017},
pages={329-336},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006190503290336},
isbn={978-989-758-218-9},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 6th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - On a Traveling Salesman based Bilevel Programming Problem
SN - 978-989-758-218-9
AU - Adasme P.
AU - Andrade R.
AU - Leung J.
AU - Lisser A.
PY - 2017
SP - 329
EP - 336
DO - 10.5220/0006190503290336