Institutional Repository
Technical University of Crete
Technical University of Crete
EN
|
EL
| URI: | http://purl.tuc.gr/dl/dias/3C81C90F-B185-44DB-9251-9A188CF1FF99 | ||
| Year | 2008 | ||
| Type of Item | Peer-Reviewed Journal Publication | ||
| License |
|
||
| Bibliographic Citation | Y. Marinakis , M. Marinaki,"A bilevel genetic algorithm for a real life location routing problem," Intern.J. of Logistics: Research and Appl., vol. 11,no. 1,pp. 49-65, 2008.doi:10.1080/13675560701410144 https://doi.org/10.1080/13675560701410144 | ||
| Appears in Collections |
A fast, robust and efficient algorithm for solving the Location routing problem (LRP) for one of the largest companies in Greece, which distributes wood products, is developed. To solve the company's problem, a new formulation of the LRP based on bilevel programming is proposed. Based on the fact that in the LRP, decisions are made at a strategic level and at an operational level, we formulate the problem in such a way that in the first level, the decisions of the strategic level are made, namely, the top manager finds the optimal location of the facilities: while in the second level, the operational level decisions are made, namely, the operational manager finds the optimal routing of vehicles. For this problem, a Bilevel Genetic Algorithm is proposed. The algorithm manages to provide practical solutions and significant economic benefits for the company. The algorithm is also tested on a set of benchmark instances. The results of the algorithm are also very satisfactory for those instances and, for six of them, a new best solution has been found.
Copyright © DIAS 2013
