Exact solution of multicommodity network optimization problems with general step cost functions

Authors:
V. Gabrel;A. Knippel;M. Minoux
Affiliations:
Université Paris 13 LIPN-Avenue J.-B. Clément, 93430 Villetaneuse, France;Laboratoire d' Informatique de Paris 6, Université Paris 6-LIP6-4 Place Jussieu, 75005 Paris, France;Laboratoire d' Informatique de Paris 6, Université Paris 6-LIP6-4 Place Jussieu, 75005 Paris, France
Venue:
Operations Research Letters
Year:
1999

Citing 2
Cited 16

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Network Design Using Cut Inequalities

SIAM Journal on Optimization

Robust and Parallel Solving of a Network Design Problem

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
A Comparison of Heuristics for the Discrete Cost Multicommodity Network Optimization Problem

Journal of Heuristics
A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems

Management Science
Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs

Operations Research
A survey on benders decomposition applied to fixed-charge network design problems

Computers and Operations Research
0-1 reformulations of the multicommodity capacitated network design problem

Discrete Applied Mathematics
Benders, metric and cutset inequalities for multicommodity capacitated network design

Computational Optimization and Applications
A Parallel Algorithm for NMNF Problems with a Large Number of Capacity Constraints

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Large-Scale, Less-than-Truckload Service Network Design

Operations Research
Power-efficient radio configuration in fixed broadband wireless networks

Computer Communications
Minimizing Routing Energy Consumption: From Theoretical to Practical Results

GREENCOM-CPSCOM '10 Proceedings of the 2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing
Adaptive memory in multistart heuristics for multicommodity network design

Journal of Heuristics
Minimum-cost optimization in multicommodity logistic chain network

IWMM'04/GIAE'04 Proceedings of the 6th international conference on Computer Algebra and Geometric Algebra with Applications
An improved Benders decomposition applied to a multi-layer network design problem

Operations Research Letters
A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems

Operations Research Letters
Piecewise Linear Multicriteria Programs: The Continuous Case and Its Discontinuous Generalization

Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe an exact solution procedure, based on the use of standard LP software, for multicommodity network optimization problems with general discontinuous step-increasing cost functions. This class of problems includes the so-called single-facility and multiple-facility capacitated network loading problems as special cases. The proposed procedure may be viewed as a specialization of the well-known BENDERS partitioning procedure, leading to iteratively solving an integer 0-1 linear programming relaxed subproblem which is progressively augmented through constraint generation. We propose an improved implementation of the constraint generation principle where, at each step, several (O(N)) new constraints are included into the current problem, thanks to which the total number of iterations is greatly reduced (never exceeding 15 in all the test problems treated). We report on systematic computational experiments for networks up to 20 nodes, 37 links and cost functions with an average six steps per link.