NDLI: A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method

Content Provider	Springer Nature Link
Author	Nasini, Stefa Castro, Jordi Saldanha da Gama, Francisco
Copyright Year	2016
Abstract	We propose a cutting-plane approach (namely, Benders decomposition) for a class of capacitated multi-period facility location problems. The novelty of this approach lies on the use of a specialized interior-point method for solving the Benders subproblems. The primal block-angular structure of the resulting linear optimization problems is exploited by the interior-point method, allowing the (either exact or inexact) efficient solution of large instances. The consequences of different modeling conditions and problem specifications on the computational performance are also investigated both theoretically and empirically, providing a deeper understanding of the significant factors influencing the overall efficiency of the cutting-plane method. The methodology proposed allowed the solution of instances of up to 200 potential locations, one million customers and three periods, resulting in mixed integer linear optimization problems of up to 600 binary and 600 millions of continuous variables. Those problems were solved by the specialized approach in less than one hour and a half, outperforming other state-of-the-art methods, which exhausted the (144 GB of) available memory in the largest instances.
Ending Page	444
Page Count	34
Starting Page	411
File Format	PDF
ISSN	00255610
e-ISSN	14364646
Journal	Mathematical Programming
Issue Number	1-2
Volume Number	163
Language	English
Publisher	Springer Berlin Heidelberg
Publisher Date	2016-09-19
Publisher Place	Berlin, Heidelberg
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Theoretical, Mathematical and Computational Physics Mixed integer programming Interior-point methods Discrete location and assignment Large-scale problems Mathematical Methods in Physics Cutting planes Benders decomposition Mixed integer linear optimization Calculus of Variations and Optimal Control; Optimization Mathematics of Computing Numerical Analysis Large-scale optimization Multi-period facility location Combinatorics
Content Type	Text
Resource Type	Article
Subject	Mathematics Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

The Ancestral Benders’ cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming

A note on the selection of Benders’ cuts

Capacitated facility location: Separation algorithms and computational experience

Mingling: mixed-integer rounding with bounds

Cutting planes for integer programs with general integer variables

Two row mixed-integer cuts via lifting

An algorithm for the separation of two-row cuts

Cutting planes for RLT relaxations of mixed 0–1 polynomial programs

On the strength of Gomory mixed-integer cuts as group cuts

A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method

Similar Documents

The Ancestral Benders’ cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming

A note on the selection of Benders’ cuts

Capacitated facility location: Separation algorithms and computational experience

Mingling: mixed-integer rounding with bounds

Cutting planes for integer programs with general integer variables

Two row mixed-integer cuts via lifting

An algorithm for the separation of two-row cuts

Cutting planes for RLT relaxations of mixed 0–1 polynomial programs

On the strength of Gomory mixed-integer cuts as group cuts

A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method