loading
Papers

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Pedro Henrique González 1 ; Luidi Gelabert Simonetti 2 ; Carlos Alberto de Jesus Martinhon 2 ; Philippe Yves Paul Michelon 3 and Edcarllos Santos 2

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-027-7

Keyword(s): Network Design Problem, Heuristic, Local Branching, Bi-level Problem.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence and Decision Support Systems ; Enterprise Information Systems ; Operational Research ; Problem Solving

Abstract: Due to the constant development of society, increasing quantities of commodities have to be transported in large urban centers. Therefore, network design problems arise as tools to support decision-making, aiming to meet the need of finding efficient ways to perform the transportation of each commodity from its origin to its destination. This paper reviews a bi-level formulation, an one level formulation obtained by applying the complementary slackness theorem, Bellman’s optimality conditions and Big-M linearizing technique. A heuristic procedure is proposed, through combining a randomized constructive algorithm with a Relax-and-Fix heuristic to generate an initial solution. After that a Local Branching technique is applied to improve the constructed solution, so high quality solutions can be found. Besides that, our computational results are compared with the results 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.233.219.101

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:
Henrique González, P.; Gelabert Simonetti, L.; Alberto de Jesus Martinhon, C.; Yves Paul Michelon, P. and Santos, E. (2014). A Heuristic Procedure with Local Branching for the Fixed Charge Network Design Problem with User-optimal Flow.In Proceedings of the 16th International Conference on Enterprise Information Systems - Volume 3: ICEIS, ISBN 978-989-758-027-7, pages 384-394. DOI: 10.5220/0004885903840394

@conference{iceis14,
author={Pedro Henrique González. and Luidi Gelabert Simonetti. and Carlos Alberto de Jesus Martinhon. and Philippe Yves Paul Michelon. and Edcarllos Santos.},
title={A Heuristic Procedure with Local Branching for the Fixed Charge Network Design Problem with User-optimal Flow},
booktitle={Proceedings of the 16th International Conference on Enterprise Information Systems - Volume 3: ICEIS,},
year={2014},
pages={384-394},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004885903840394},
isbn={978-989-758-027-7},
}

TY - CONF

JO - Proceedings of the 16th International Conference on Enterprise Information Systems - Volume 3: ICEIS,
TI - A Heuristic Procedure with Local Branching for the Fixed Charge Network Design Problem with User-optimal Flow
SN - 978-989-758-027-7
AU - Henrique González, P.
AU - Gelabert Simonetti, L.
AU - Alberto de Jesus Martinhon, C.
AU - Yves Paul Michelon, P.
AU - Santos, E.
PY - 2014
SP - 384
EP - 394
DO - 10.5220/0004885903840394

Login or register to post comments.

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