Optimal Network Design with End-to-End Service Requirements

• 成果类型: Article
• 署名作者: Balakrishnan, Anantaram; Li, Gang; Mirchandani, Prakash
• 署名单位: University of Texas System; University of Texas Austin; Bentley University; Pennsylvania Commonwealth System of Higher Education (PCSHE); University of Pittsburgh
• 刊物名称: OPERATIONS RESEARCH
• ISSN/ISSBN: 0030-364X
• DOI: 10.1287/opre.2016.1579
• 发表日期: 2017
• 页码: 729-750
• 关键词: steiner tree problem; cut algorithms; models; formulations; revenues; budget

摘要

Long-term planning for transportation, telecommunications, and other service operations entails designing networks that are both cost effective and responsive. Because infrastructure networks are expensive and the network's design determines its service capabilities, planners must address complex trade-offs between minimizing the total cost of the network while meeting end-to-end service requirements such as limits on transit time, latency, and transshipments. To address this problem, we study a minimum cost multicommodity network design model to select arcs and route the required flows along these arcs so that each origin-to-destination route satisfies limits on various service metrics. To effectively solve this service network design problem, we focus on a polyhedral approach to strengthen its arc flow formulation. We develop several classes of strong cuts, with appropriate separation procedures, and propose an optimization-based heuristic method. We characterize the dimension of the problem's feasible region and show that two classes of inequalities are facet-defining under appropriate conditions. Our computational results demonstrate that our Composite method, incorporating the valid inequalities and heuristic algorithm, significantly reduces computational time and generates near-optimal solutions. The model and methods developed in this paper provide a valuable planning tool for service providers in transportation, telecommunication, and other sectors.