The Search is performed on all of the following fields:
Note: Please use complete words only.

Publication Title

Abstract

Publication Keywords

DOI

Proceeding Title

Proceeding Foreword

ISBN (Completed)

Insticc Ontology

Author Affiliation

Author Name

Editor Name

If you're looking for an exact phrase use quotation marks on text fields.

Paper

On a Traveling Salesman based Bilevel Programming ProblemTopics: Linear Programming; Network Optimization; Optimization; OR in Telecommunications; Resource Allocation; Routing; Simulation

Related
Ontology
Subjects/Areas/Topics:Agents
;
Applications
;
Artificial Intelligence
;
Bioinformatics
;
Biomedical Engineering
;
Enterprise Information Systems
;
Information Systems Analysis and Specification
;
Knowledge Discovery and Information Retrieval
;
Knowledge-Based Systems
;
Linear Programming
;
Methodologies and Technologies
;
Network Optimization
;
Operational Research
;
Optimization
;
OR in Telecommunications
;
Pattern Recognition
;
Resource Allocation
;
Routing
;
Simulation
;
Software Engineering
;
Symbolic Systems

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.(More)

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.

*Limit of Downloads ExceededJoin SciTePress now to download more papers for free and get access to over
full text papers.

Guests can use SciTePress Digital Library without having a SciTePress account. However, guests have limited access to downloading full text versions of papers and no access to special options.

Guests can use SciTePress Digital Library without having a SciTePress account. However, guests have limited access to downloading full text versions of papers and no access to special options.

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

@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}, }

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