loading
Documents

Research.Publish.Connect.

Paper

Paper Unlock

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

ISBN: 978-989-758-017-8

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.

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.227.233.55

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
González, P.; Simonetti, L.; de Jesus Martinhon, C.; Santos, E. and Paul Michelon, P. (2014). An Improved Relax-and-Fix Algorithm for the Fixed Charge Network Design Problem with User-optimal Flow.In Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-017-8, pages 100-107. DOI: 10.5220/0004832601000107

@conference{icores14,
author={Pedro Henrique González. and Luidi Gelabert Simonetti. and Carlos Alberto de Jesus Martinhon. and Edcarllos Santos. and Philippe Yves Paul Michelon.},
title={An Improved Relax-and-Fix Algorithm for the Fixed Charge Network Design Problem with User-optimal Flow},
booktitle={Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2014},
pages={100-107},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004832601000107},
isbn={978-989-758-017-8},
}

TY - CONF

JO - Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - An Improved Relax-and-Fix Algorithm for the Fixed Charge Network Design Problem with User-optimal Flow
SN - 978-989-758-017-8
AU - González, P.
AU - Simonetti, L.
AU - de Jesus Martinhon, C.
AU - Santos, E.
AU - Paul Michelon, P.
PY - 2014
SP - 100
EP - 107
DO - 10.5220/0004832601000107

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.