Warm-Start Routines for Solving Augmented Weighted Tchebycheff Network Programs in Multiple-Objective Network Programming

Three warm-start routines are developed to find initial basic feasible solutions for augmented weighted Tchebycheff network programs, subproblems derived from multiple-objective network-programming problems. In an interactive solution procedure, a series of augmented weighted Tchebycheff network programs need to be solved sequentially to find representative nondominated solutions. To speed up the solution process using the network structure of the problem, these warm-start routines start the solution process of one augmented weighted Tchebycheff network program from the optimal solution of the previous one. All three warm-start routines use the same strategy but different ways of reducing the number of basic flow variables, or equivalently increasing the number of basic nonflow variables to construct a basic solution. These warm-start routines can be used by any interactive procedures to facilitate the solution process of multiple-objective network-programming problems. A detailed example is presented. A computational experiment is conducted to compare the performance of these warm-start routines. A cold-start routine and NETSIDE, specialized software for solving network problems with side constraints, are also used as references in the experiment. These warm-start routines can save substantial computation time.

[1]  Herminia I. Calvete,et al.  An approach for the network flow problem with multiple objectives , 1995, Comput. Oper. Res..

[2]  R. V. Helgason,et al.  Algorithms for network programming , 1980 .

[3]  John M. Mulvey,et al.  Testing of a large-scale network optimization program , 1978, Math. Program..

[4]  Wlodzimierz Ogryczak,et al.  DINAS: A computer-assisted analysis system for multiobjective transshipment problems with facility location , 1992, Comput. Oper. Res..

[5]  F. Glover,et al.  The simplex SON algorithm for LP/embedded network problems , 1981 .

[6]  R. S. Laundy,et al.  Multiple Criteria Optimisation: Theory, Computation and Application , 1989 .

[7]  Minghe Sun,et al.  A Multiple Objective Embedded Network Model for Human Resource Planning and an Implementation of the Tchebycheff Method , 1996 .

[8]  P. Simin Pulat,et al.  Bicriteria network flow problems: Continuous case , 1991 .

[9]  Marek Makowski,et al.  Model-Based Decision Support Methodology with Environmental Applications , 2000 .

[10]  Katta G. Murty,et al.  Network programming , 1992 .

[11]  S. Chen,et al.  A primal algorithm for solving a capacitated network flow problem with additional linear constraints , 1977, Networks.

[12]  John M. Mulvey,et al.  Pivot Strategies for Primal-Simplex Network Codes , 1978, JACM.

[13]  Darwin Klingman,et al.  NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems , 1974 .

[14]  Xavier Gandibleux,et al.  A survey and annotated bibliography of multiobjective combinatorial optimization , 2000, OR Spectr..

[15]  F. Glover,et al.  Basis exchange characterizations for the simplex son algorithm for LP/embedded networks , 1985 .

[16]  Minghe Sun,et al.  Interactive multiple objective programming procedures via adaptive random search and feed-forward artificial neural networks , 1992 .

[17]  Darwin Klingman,et al.  Solving Singly Constrained Transshipment Problems , 1978 .

[18]  P. Simin Pulat,et al.  Efficient solutions for the bicriteria network flow problem , 1992, Comput. Oper. Res..

[19]  Minghe Sun,et al.  Interactive multiple objective programming using Tchebycheff programs and artificial neural networks , 2000, Comput. Oper. Res..

[20]  Fred W. Glover,et al.  Network models in optimization and their applications in practice , 1992 .

[21]  Włodzimierz Ogryczak,et al.  A solver for the multi-objective transshipment problem with facility location , 1989 .

[22]  Minghe Sun,et al.  Solving Multiple Objective Programming Problems Using Feed-Forward Artificial Neural Networks: The Interactive FFANN Procedure , 1996 .

[23]  Ralph E. Steuer,et al.  An interactive weighted Tchebycheff procedure for multiple objective programming , 1983, Math. Program..

[24]  Lorraine R. Gardiner,et al.  Unified interactive multiple objective programming , 1994 .

[25]  A. Wierzbicki.  A Mathematical Basis for Satisficing Decision Making , 1982 .

[26]  Hokey Min,et al.  Multiobjective design of transportation networks: taxonomy and annotation , 1986 .

[27]  Minghe Sun,et al.  Procedures for Finding Nondominated Solutions for Multiple Objective Network Programming Problems , 2003, Transp. Sci..

[28]  Andrzej P. Wierzbick.  Basic properties of scalarizmg functionals for multiobjective optimization , 1977 .

[29]  Andrzej P. Wierzbicki,et al.  The Use of Reference Objectives in Multiobjective Optimization , 1979 .

[30]  John R. Current,et al.  Multiobjective transportation network design and routing problems: Taxonomy and annotation , 1993 .

[31]  Lorraine R. Gardiner,et al.  A Bibliographic Survey of the Activities and International Nature of Multiple Criteria Decision Making , 1996 .

[32]  P. S. Pulat,et al.  Bicriteria network flow problems: Integer case , 1993 .