DSpace Repository

Approche Sous-gradient pour le problème du TSP " Travelling Salesman Problem "

Show simple item record

dc.contributor.author Rachid Belgacem
dc.date.accessioned 2018-11-26T19:05:20Z
dc.date.available 2018-11-26T19:05:20Z
dc.date.issued 2018-04-26
dc.identifier.uri http://e-biblio.univ-mosta.dz/handle/123456789/2676
dc.description.abstract A new deflected subgradient algorithm is presented for computing a tighter lower bound of the dual problem. These bounds may be useful in nodes evaluation in a Branch and Bound algorithm to find the optimal solution of large-scale integer linear programming problems. The deflected direction search used in this thesis is a convex combination of the Modified Gradient Technique and the Average Direction Strategy. In this context, we identify the optimal convex combination parameter allowing the deflected subgradient vector direction to form a more acute angle with the best direction towards an optimal solution. The modified algorithm gives encouraging results for a selected symmetric travelling salesman problem (TSPs) instances taken from TSPLIB library en_US
dc.language.iso fr en_US
dc.title Approche Sous-gradient pour le problème du TSP " Travelling Salesman Problem " en_US
dc.type Thesis en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Browse

My Account