Authors:
Pedro Henrique González
1
;
Luidi Gelabert Simonetti
2
;
Carlos Alberto de Jesus Martinhon
2
;
Edcarllos Santos
2
and
Philippe Yves Paul Michelon
3
Affiliations:
1
Fluminense Federal University and Université d'Avignon et des Pays de Vaucluse, Brazil
;
2
Fluminense Federal University, Brazil
;
3
Université d'Avignon et des Pays de Vaucluse, France
Keyword(s):
Network Design Problem, Dynamic Programming, Relax-and-Fix, Bi-level Problem
Related
Ontology
Subjects/Areas/Topics:
Applications
;
Artificial Intelligence
;
Dynamic Programming
;
e-Business
;
Enterprise Information Systems
;
Knowledge Discovery and Information Retrieval
;
Knowledge-Based Systems
;
Linear Programming
;
Logistics
;
Mathematical Programming
;
Methodologies and Technologies
;
Network Optimization
;
Operational Research
;
Optimization
;
OR in Transportation
;
Pattern Recognition
;
Software Engineering
;
Symbolic Systems
Abstract:
Due to the constant development of society, increasing quantities of commodities have to be transported in large urban centers. Therefore, network planning problems arise as tools to support decision-making, aiming to meet the need of finding efficient ways to perform such transportations. This paper review a bi-level formulation, an one level formulation obtained by applying the complementary slackness theorem, Bellman's optimality conditions and presents an improved Relax-and-Fix heuristic, through combining a randomized constructive algorithm with a Relax-and-Fix heuristic, so high quality solutions could be found. Besides that, our computational results are compared with the results found by an one-level formulation and other heuristics found in the literature, showing the efficiency of the proposed method.