2017/03/19 by Robin H. Pearce, Pearce, Robin H, Michael A. Forbes +2
Business, Management and Accounting · Engineering · Social Sciences · #90B10 #90B80 #FOS: Mathematics #Facility Location and Emergency Management #Optimization and Control (math.OC) #Transportation Planning and Optimization #Transportation and Mobility Innovations #Vehicle Routing Optimization Methods
paper · pdf · doi:10.48550/arxiv.1703.06581
openalex publication_date 2017/03/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We present an approach for solving to optimality the budget-constrained\nDynamic Uncapacitated Facility Location and Network Design problem (DUFLNDP).\nThis is a problem where a network must be constructed or expanded and\nfacilities placed in the network, subject to a budget, in order to satisfy a\nnumber of demands. With the demands satisfied, the objective is to minimise the\nrunning cost of the network and the cost of moving demands to facilities. The\nproblem can be disaggregated over two different sets simultaneously, leading to\nmany smaller models which can be solved more easily. Using disaggregated\nBenders decomposition and lazy constraints, we solve many instances to\noptimality that have not previously been solved. We use an analytic procedure\nto generate Benders optimality cuts which are provably Pareto-optimal.\n