Domain reduction using GRASP construction phase for transmission expansion planning problem

Detalhes bibliográficos
Autor(a) principal: Rahmani, Mohsen [UNESP]
Data de Publicação: 2012
Outros Autores: Romero, Ruben A. [UNESP], Rider, Marcos J. [UNESP], Paredes, Miguel [UNESP]
Tipo de documento: Artigo de conferência
Idioma: eng
Título da fonte: Repositório Institucional da UNESP
Texto Completo: http://dx.doi.org/10.1007/978-3-642-29124-1_8
http://hdl.handle.net/11449/73280
Resumo: This paper proposes a new strategy to reduce the combinatorial search space of a mixed integer linear programming (MILP) problem. The construction phase of greedy randomized adaptive search procedure (GRASP-CP) is employed to reduce the domain of the integer variables of the transportation model of the transmission expansion planning (TM-TEP) problem. This problem is a MILP and very difficult to solve specially for large scale systems. The branch and bound (BB) algorithm is used to solve the problem in both full and the reduced search space. The proposed method might be useful to reduce the search space of those kinds of MILP problems that a fast heuristic algorithm is available for finding local optimal solutions. The obtained results using some real test systems show the efficiency of the proposed method. © 2012 Springer-Verlag.
id UNSP_2e2ef64260becbd84a3daa3f969d8e19
oai_identifier_str oai:repositorio.unesp.br:11449/73280
network_acronym_str UNSP
network_name_str Repositório Institucional da UNESP
repository_id_str 2946
spelling Domain reduction using GRASP construction phase for transmission expansion planning problemGRASP-CPMILPTM-TEPBranch and boundsCombinatorial searchConstruction phaseFast heuristic algorithmsGreedy randomized adaptive search procedureInteger variablesLocal optimal solutionMixed-integer linear programmingSearch spacesTest systemsTransmission expansion planningTransportation modelCombinatorial optimizationHeuristic algorithmsLinear programmingProblem solvingThis paper proposes a new strategy to reduce the combinatorial search space of a mixed integer linear programming (MILP) problem. The construction phase of greedy randomized adaptive search procedure (GRASP-CP) is employed to reduce the domain of the integer variables of the transportation model of the transmission expansion planning (TM-TEP) problem. This problem is a MILP and very difficult to solve specially for large scale systems. The branch and bound (BB) algorithm is used to solve the problem in both full and the reduced search space. The proposed method might be useful to reduce the search space of those kinds of MILP problems that a fast heuristic algorithm is available for finding local optimal solutions. The obtained results using some real test systems show the efficiency of the proposed method. © 2012 Springer-Verlag.Universidade Estadual Paulista Faculdade de Engenharia de Ilha Solteira, Ilha Solteira - SPUniversidade Estadual Paulista Faculdade de Engenharia de Ilha Solteira, Ilha Solteira - SPUniversidade Estadual Paulista (Unesp)Rahmani, Mohsen [UNESP]Romero, Ruben A. [UNESP]Rider, Marcos J. [UNESP]Paredes, Miguel [UNESP]2014-05-27T11:26:26Z2014-05-27T11:26:26Z2012-04-03info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/conferenceObject87-98http://dx.doi.org/10.1007/978-3-642-29124-1_8Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v. 7245 LNCS, p. 87-98.0302-97431611-3349http://hdl.handle.net/11449/7328010.1007/978-3-642-29124-1_82-s2.0-84859150018Scopusreponame:Repositório Institucional da UNESPinstname:Universidade Estadual Paulista (UNESP)instacron:UNESPengLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)0,295info:eu-repo/semantics/openAccess2024-07-04T19:11:55Zoai:repositorio.unesp.br:11449/73280Repositório InstitucionalPUBhttp://repositorio.unesp.br/oai/requestopendoar:29462024-08-05T23:01:54.098617Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)false
dc.title.none.fl_str_mv Domain reduction using GRASP construction phase for transmission expansion planning problem
title Domain reduction using GRASP construction phase for transmission expansion planning problem
spellingShingle Domain reduction using GRASP construction phase for transmission expansion planning problem
Rahmani, Mohsen [UNESP]
GRASP-CP
MILP
TM-TEP
Branch and bounds
Combinatorial search
Construction phase
Fast heuristic algorithms
Greedy randomized adaptive search procedure
Integer variables
Local optimal solution
Mixed-integer linear programming
Search spaces
Test systems
Transmission expansion planning
Transportation model
Combinatorial optimization
Heuristic algorithms
Linear programming
Problem solving
title_short Domain reduction using GRASP construction phase for transmission expansion planning problem
title_full Domain reduction using GRASP construction phase for transmission expansion planning problem
title_fullStr Domain reduction using GRASP construction phase for transmission expansion planning problem
title_full_unstemmed Domain reduction using GRASP construction phase for transmission expansion planning problem
title_sort Domain reduction using GRASP construction phase for transmission expansion planning problem
author Rahmani, Mohsen [UNESP]
author_facet Rahmani, Mohsen [UNESP]
Romero, Ruben A. [UNESP]
Rider, Marcos J. [UNESP]
Paredes, Miguel [UNESP]
author_role author
author2 Romero, Ruben A. [UNESP]
Rider, Marcos J. [UNESP]
Paredes, Miguel [UNESP]
author2_role author
author
author
dc.contributor.none.fl_str_mv Universidade Estadual Paulista (Unesp)
dc.contributor.author.fl_str_mv Rahmani, Mohsen [UNESP]
Romero, Ruben A. [UNESP]
Rider, Marcos J. [UNESP]
Paredes, Miguel [UNESP]
dc.subject.por.fl_str_mv GRASP-CP
MILP
TM-TEP
Branch and bounds
Combinatorial search
Construction phase
Fast heuristic algorithms
Greedy randomized adaptive search procedure
Integer variables
Local optimal solution
Mixed-integer linear programming
Search spaces
Test systems
Transmission expansion planning
Transportation model
Combinatorial optimization
Heuristic algorithms
Linear programming
Problem solving
topic GRASP-CP
MILP
TM-TEP
Branch and bounds
Combinatorial search
Construction phase
Fast heuristic algorithms
Greedy randomized adaptive search procedure
Integer variables
Local optimal solution
Mixed-integer linear programming
Search spaces
Test systems
Transmission expansion planning
Transportation model
Combinatorial optimization
Heuristic algorithms
Linear programming
Problem solving
description This paper proposes a new strategy to reduce the combinatorial search space of a mixed integer linear programming (MILP) problem. The construction phase of greedy randomized adaptive search procedure (GRASP-CP) is employed to reduce the domain of the integer variables of the transportation model of the transmission expansion planning (TM-TEP) problem. This problem is a MILP and very difficult to solve specially for large scale systems. The branch and bound (BB) algorithm is used to solve the problem in both full and the reduced search space. The proposed method might be useful to reduce the search space of those kinds of MILP problems that a fast heuristic algorithm is available for finding local optimal solutions. The obtained results using some real test systems show the efficiency of the proposed method. © 2012 Springer-Verlag.
publishDate 2012
dc.date.none.fl_str_mv 2012-04-03
2014-05-27T11:26:26Z
2014-05-27T11:26:26Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/conferenceObject
format conferenceObject
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://dx.doi.org/10.1007/978-3-642-29124-1_8
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v. 7245 LNCS, p. 87-98.
0302-9743
1611-3349
http://hdl.handle.net/11449/73280
10.1007/978-3-642-29124-1_8
2-s2.0-84859150018
url http://dx.doi.org/10.1007/978-3-642-29124-1_8
http://hdl.handle.net/11449/73280
identifier_str_mv Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v. 7245 LNCS, p. 87-98.
0302-9743
1611-3349
10.1007/978-3-642-29124-1_8
2-s2.0-84859150018
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
0,295
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv 87-98
dc.source.none.fl_str_mv Scopus
reponame:Repositório Institucional da UNESP
instname:Universidade Estadual Paulista (UNESP)
instacron:UNESP
instname_str Universidade Estadual Paulista (UNESP)
instacron_str UNESP
institution UNESP
reponame_str Repositório Institucional da UNESP
collection Repositório Institucional da UNESP
repository.name.fl_str_mv Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)
repository.mail.fl_str_mv
_version_ 1808129483759157248

Registros relacionados