File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A novel discrete network design problem formulation and its global optimization solution algorithm

TitleA novel discrete network design problem formulation and its global optimization solution algorithm
Authors
Wang, DZWLiu, HSzeto, WY
KeywordsGlobal optimization
Mixed-integer linear programming
Network design problem
Range reduction
User equilibrium
Issue Date2015
PublisherPergamon. The Journal's web site is located at http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description
Citation
Transportation Research Part E: Logistics and Transportation Review, 2015, v. 79, p. 213-230 How to Cite?
DOI: http://dx.doi.org/10.1016/j.tre.2015.04.005
AbstractConventional discrete transportation network design problem deals with the optimal decision on new link addition, assuming the capacity of each candidate link addition is predetermined and fixed. In this paper, we address a novel yet general discrete network design problem formulation that aims to determine the optimal new link addition and their optimal capacities simultaneously, which answers the questions on whether a new link should be added or not, and if added, what should be the optimal link capacity. A global optimization method employing linearization, outer approximation and range reduction techniques is developed to solve the formulated model.
Persistent Identifierhttp://hdl.handle.net/10722/215234
ISSN
1366-5545
2021 Impact Factor: 10.047
2020 SCImago Journal Rankings: 2.042
ISI Accession Number ID
WOS:000356736400013

 

DC FieldValueLanguage
dc.contributor.authorWang, DZW-
dc.contributor.authorLiu, H-
dc.contributor.authorSzeto, WY-
dc.date.accessioned2015-08-21T13:18:42Z-
dc.date.available2015-08-21T13:18:42Z-
dc.date.issued2015-
dc.identifier.citationTransportation Research Part E: Logistics and Transportation Review, 2015, v. 79, p. 213-230-
dc.identifier.issn1366-5545-
dc.identifier.urihttp://hdl.handle.net/10722/215234-
dc.description.abstractConventional discrete transportation network design problem deals with the optimal decision on new link addition, assuming the capacity of each candidate link addition is predetermined and fixed. In this paper, we address a novel yet general discrete network design problem formulation that aims to determine the optimal new link addition and their optimal capacities simultaneously, which answers the questions on whether a new link should be added or not, and if added, what should be the optimal link capacity. A global optimization method employing linearization, outer approximation and range reduction techniques is developed to solve the formulated model.-
dc.languageeng-
dc.publisherPergamon. The Journal's web site is located at http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description-
dc.relation.ispartofTransportation Research Part E: Logistics and Transportation Review-
dc.rightsThis work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.-
dc.subjectGlobal optimization-
dc.subjectMixed-integer linear programming-
dc.subjectNetwork design problem-
dc.subjectRange reduction-
dc.subjectUser equilibrium-
dc.titleA novel discrete network design problem formulation and its global optimization solution algorithm-
dc.typeArticle-
dc.identifier.emailSzeto, WY: ceszeto@hku.hk-
dc.identifier.authoritySzeto, WY=rp01377-
dc.description.naturepostprint-
dc.identifier.doi10.1016/j.tre.2015.04.005-
dc.identifier.scopuseid_2-s2.0-84929584523-
dc.identifier.hkuros250025-
dc.identifier.volume79-
dc.identifier.spage213-
dc.identifier.epage230-
dc.identifier.isiWOS:000356736400013-
dc.publisher.placeUnited Kingdom-
dc.identifier.issnl1366-5545-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats