Synopsis
Bachelor Thesis from the year 2013 in the subject Business economics - Operations Research, grade: 1,0, Technical University of Munich (Lehrstuhl für Betriebswirtschaftslehre - Logistik und Supply Chain Management), language: English, abstract: In this thesis, metaheuristic solution approaches for the decentralized capacitated facility location problem are deduced, implemented and assessed. As the mentioned problem is a combinatorial bilevel problem it is not easily solvable by means of linear programming. Therefore, different metaheuristic techniques, namely Tabu Search and Simulated Annealing, are used. Each of them is split into several variants. Tabu Search has turned out to deliver better results than Simulated Annealing and converges also from bad initial solutions towards the global optimum. However, the performance of the algorithms is highly dependent on the concrete parameter settings. Thus, the gap between the optimum found and the global optimum can vary from 0 to a multiple of the global optimum depending on the used variant. The thesis on hand describes the comparison of different metaheuristics in order to generate solutions for the bilevel decentralized capacitated facility location problem. This optimization problem consists of choosing a set of facilities to be opened out of a superset of potential facilities. The objective is to minimize cost, while taking certain constraints into account. This usual facility location model, which can relatively easily be solved as a linear optimization problem, will be expanded. There is an additional submodel that is intended to develop an optimal production plan for the facilities chosen within the superordinate model. On the sublevel, also cost has to be minimized and as one major constraint the entire external demand has to be satisfied. Such a bilevel problem containing two hierarchically arranged objective functions cannot be solved using the usual methods of linear programming any more.
"synopsis" may belong to another edition of this title.
Search results for Comparing Heuristics for Solving Linear Bilevel Problems
Seller Image
Comparing Heuristics for Solving Linear Bilevel Problems
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 27170645-n
Seller Image
Comparing Heuristics for Solving Linear Bilevel Problems (Paperback or Softback)
Published by
Grin Verlag 8/11/2016, 2016
ISBN 10: 3668266336
ISBN 13: 9783668266339
New
Paperback or Softback
Seller: BargainBookStores, Grand Rapids, MI, U.S.A.
Seller rating 5 out of 5 stars
Paperback or Softback. Condition: New. Comparing Heuristics for Solving Linear Bilevel Problems. Book. Seller Inventory # BBS-9783668266339
Stock Image
Comparing Heuristics for Solving Linear Bilevel Problems
Seller: California Books, Miami, FL, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. Seller Inventory # I-9783668266339
Seller Image
Comparing Heuristics for Solving Linear Bilevel Problems
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition. Seller Inventory # 27170645
Seller Image
Comparing Heuristics for Solving Linear Bilevel Problems
Print on DemandSeller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Bachelor Thesis from the year 2013 in the subject Business economics - Operations Research, grade: 1,0, Technical University of Munich (Lehrstuhl für Betriebswirtschaftslehre - Logistik und Supply Chain Management), language: English, abstract: In this thesis, metaheuristic solution approaches for the decentralized capacitated facility location problem are deduced, implemented and assessed. As the mentioned problem is a combinatorial bilevel problem it is not easily solvable by means of linear programming. Therefore, different metaheuristic techniques, namely Tabu Search and Simulated Annealing, are used. Each of them is split into several variants. Tabu Search has turned out to deliver better results than Simulated Annealing and converges also from bad initial solutions towards the global optimum. However, the performance of the algorithms is highly dependent on the concrete parameter settings. Thus, the gap between the optimum found and the global optimum can vary from 0 to a multiple of the global optimum depending on the used variant. The thesis on hand describes the comparison of different metaheuristics in order to generate solutions for the bilevel decentralized capacitated facility location problem. This optimization problem consists of choosing a set of facilities to be opened out of a superset of potential facilities. The objective is to minimize cost, while taking certain constraints into account. This usual facility location model, which can relatively easily be solved as a linear optimization problem, will be expanded. There is an additional submodel that is intended to develop an optimal production plan for the facilities chosen within the superordinate model. On the sublevel, also cost has to be minimized and as one major constraint the entire external demand has to be satisfied. Such a bilevel problem containing two hierarchically arranged objective functions cannot be solved using the usual methods of linear programming any more. 68 pp. Englisch. Seller Inventory # 9783668266339
Seller Image
Comparing Heuristics for Solving Linear Bilevel Problems
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 27170645-n
Buy New
£ 47.09
£ 15 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Seller Image
Comparing Heuristics for Solving Linear Bilevel Problems
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition. Seller Inventory # 27170645
Buy Used
£ 52.16
£ 15 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
Comparing Heuristics for Solving Linear Bilevel Problems
Print on DemandSeller: Majestic Books, Hounslow, United Kingdom
Seller rating 4 out of 5 stars
Condition: New. Print on Demand pp. 70. Seller Inventory # 388973966
Buy New
£ 62.51
£ 6.50 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 4 available
Seller Image
Comparing Heuristics for Solving Linear Bilevel Problems
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Bachelor Thesis from the year 2013 in the subject Business economics - Operations Research, grade: 1,0, Technical University of Munich (Lehrstuhl für Betriebswirtschaftslehre - Logistik und Supply Chain Management), language: English, abstract: In this thesis, metaheuristic solution approaches for the decentralized capacitated facility location problem are deduced, implemented and assessed. As the mentioned problem is a combinatorial bilevel problem it is not easily solvable by means of linear programming. Therefore, different metaheuristic techniques, namely Tabu Search and Simulated Annealing, are used. Each of them is split into several variants. Tabu Search has turned out to deliver better results than Simulated Annealing and converges also from bad initial solutions towards the global optimum. However, the performance of the algorithms is highly dependent on the concrete parameter settings. Thus, the gap between the optimum found and the global optimum can vary from 0 to a multiple of the global optimum depending on the used variant. The thesis on hand describes the comparison of different metaheuristics in order to generate solutions for the bilevel decentralized capacitated facility location problem. This optimization problem consists of choosing a set of facilities to be opened out of a superset of potential facilities. The objective is to minimize cost, while taking certain constraints into account. This usual facility location model, which can relatively easily be solved as a linear optimization problem, will be expanded. There is an additional submodel that is intended to develop an optimal production plan for the facilities chosen within the superordinate model. On the sublevel, also cost has to be minimized and as one major constraint the entire external demand has to be satisfied. Such a bilevel problem containing two hierarchically arranged objective functions cannot be solved using the usual methods of linear programming any more. Seller Inventory # 9783668266339
Seller Image
Comparing Heuristics for Solving Linear Bilevel Problems
Print on DemandSeller: preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Comparing Heuristics for Solving Linear Bilevel Problems | Florian Grodeke | Taschenbuch | Aus der Reihe: [.] stipendiaten-wissen | 68 S. | Englisch | 2016 | GRIN Verlag | EAN 9783668266339 | Verantwortliche Person für die EU: GRIN Publishing GmbH, Waltherstr. 23, 80337 München, info[at]grin[dot]com | Anbieter: preigu Print on Demand. Seller Inventory # 103492221