A Branch-and-Bound Algorithm for Representative Integer Efficient Solutions in Multiple Objective Network Programming Problems
Author
Abstract
Suggested Citation
Download full text from publisher
References listed on IDEAS
- Current, John & Marsh, Michael, 1993. "Multiobjective transportation network design and routing problems: Taxonomy and annotation," European Journal of Operational Research, Elsevier, vol. 65(1), pages 4-19, February.
- D. Klingman & A. Napier & J. Stutz, 1974. "NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems," Management Science, INFORMS, vol. 20(5), pages 814-821, January.
- Ralph E. Steuer & Joe Silverman & Alan W. Whisman, 1993. "A Combined Tchebycheff/Aspiration Criterion Vector Interactive Multiobjective Programming Procedure," Management Science, INFORMS, vol. 39(10), pages 1255-1260, October.
- Current, John & Min, HoKey, 1986. "Multiobjective design of transportation networks: Taxonomy and annotation," European Journal of Operational Research, Elsevier, vol. 26(2), pages 187-201, August.
- Lee, Haijune & Simin Pulat, P., 1993. "Bicriteria network flow problems: Integer case," European Journal of Operational Research, Elsevier, vol. 66(1), pages 148-157, April.
- Ogryczak, Wlodzimierz & Studzinski, Krzysztof & Zorychta, Krystian, 1989. "A solver for the multi-objective transshipment problem with facility location," European Journal of Operational Research, Elsevier, vol. 43(1), pages 53-64, November.
- Hamacher, Horst W. & Pedersen, Christian Roed & Ruzika, Stefan, 2007. "Multiple objective minimum cost flow problems: A review," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1404-1422, February.
- Minghe Sun, 2003. "Procedures for Finding Nondominated Solutions for Multiple Objective Network Programming Problems," Transportation Science, INFORMS, vol. 37(2), pages 139-152, May.
- Özlen, Melih & Azizoglu, Meral, 2009. "Multi-objective integer programming: A general approach for generating all non-dominated solutions," European Journal of Operational Research, Elsevier, vol. 199(1), pages 25-35, November.
- Minghe Sun & Antonie Stam & Ralph E. Steuer, 1996. "Solving Multiple Objective Programming Problems Using Feed-Forward Artificial Neural Networks: The Interactive FFANN Procedure," Management Science, INFORMS, vol. 42(6), pages 835-849, June.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Minghe Sun, 2005. "Warm-Start Routines for Solving Augmented Weighted Tchebycheff Network Programs in Multiple-Objective Network Programming," INFORMS Journal on Computing, INFORMS, vol. 17(4), pages 422-437, November.
- Minghe Sun, 2003. "Procedures for Finding Nondominated Solutions for Multiple Objective Network Programming Problems," Transportation Science, INFORMS, vol. 37(2), pages 139-152, May.
- Hamacher, Horst W. & Pedersen, Christian Roed & Ruzika, Stefan, 2007. "Multiple objective minimum cost flow problems: A review," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1404-1422, February.
- Moradi, Siamak & Raith, Andrea & Ehrgott, Matthias, 2015. "A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem," European Journal of Operational Research, Elsevier, vol. 244(2), pages 369-378.
- Granat, Janusz & Guerriero, Francesca, 2003. "The interactive analysis of the multicriteria shortest path problem by the reference point method," European Journal of Operational Research, Elsevier, vol. 151(1), pages 103-118, November.
- Sedeno-Noda, A. & Gonzalez-Martin, C. & Gutierrez, J., 2005. "The biobjective undirected two-commodity minimum cost flow problem," European Journal of Operational Research, Elsevier, vol. 164(1), pages 89-103, July.
- F. Guerriero & R. Musmanno, 2001. "Label Correcting Methods to Solve Multicriteria Shortest Path Problems," Journal of Optimization Theory and Applications, Springer, vol. 111(3), pages 589-613, December.
- Mina, Hokey & Jayaraman, Vaidyanathan & Srivastava, Rajesh, 1998. "Combined location-routing problems: A synthesis and future research directions," European Journal of Operational Research, Elsevier, vol. 108(1), pages 1-15, July.
- Mesquita-Cunha, Mariana & Figueira, José Rui & Barbosa-Póvoa, Ana Paula, 2023. "New ϵ−constraint methods for multi-objective integer linear programming: A Pareto front representation approach," European Journal of Operational Research, Elsevier, vol. 306(1), pages 286-307.
- Sun, Minghe, 2005. "Some issues in measuring and reporting solution quality of interactive multiple objective programming procedures," European Journal of Operational Research, Elsevier, vol. 162(2), pages 468-483, April.
- Xie, Chi & Travis Waller, S., 2012. "Parametric search and problem decomposition for approximating Pareto-optimal paths," Transportation Research Part B: Methodological, Elsevier, vol. 46(8), pages 1043-1067.
- Matthias Ehrgott & Xavier Gandibleux, 2004. "Approximative solution methods for multiobjective combinatorial optimization," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 12(1), pages 1-63, June.
- Soroush, H.M., 2008. "Optimal paths in bi-attribute networks with fractional cost functions," European Journal of Operational Research, Elsevier, vol. 190(3), pages 633-658, November.
- K. Ramacandra Rao & Subhro Mitra & Joseph Szmerekovsky, 2021. "Bus Transit Network Structure Selection With Multiple Objectives," International Journal of Operations Research and Information Systems (IJORIS), IGI Global, vol. 12(4), pages 1-13, October.
- Coutinho-Rodrigues, João & Tralhão, Lino & Alçada-Almeida, Luís, 2012. "Solving a location-routing problem with a multiobjective approach: the design of urban evacuation plans," Journal of Transport Geography, Elsevier, vol. 22(C), pages 206-218.
- de Lima Pinto, Leizer & Bornstein, Cláudio Thomás & Maculan, Nelson, 2009. "The tricriterion shortest path problem with at least two bottleneck objective functions," European Journal of Operational Research, Elsevier, vol. 198(2), pages 387-391, October.
- Curtin, Kevin M. & Biba, Steve, 2011. "The Transit Route Arc-Node Service Maximization problem," European Journal of Operational Research, Elsevier, vol. 208(1), pages 46-56, January.
- Dung-Ying Lin & Chi Xie, 2011. "The Pareto-optimal Solution Set of the Equilibrium Network Design Problem with Multiple Commensurate Objectives," Networks and Spatial Economics, Springer, vol. 11(4), pages 727-751, December.
- Eusébio, Augusto & Figueira, José Rui, 2009. "On the computation of all supported efficient solutions in multi-objective integer network flow problems," European Journal of Operational Research, Elsevier, vol. 199(1), pages 68-76, November.
- Gutierrez, Genaro J. & Kouvelis, Panagiotis & Kurawarwala, Abbas A., 1996. "A robustness approach to uncapacitated network design problems," European Journal of Operational Research, Elsevier, vol. 94(2), pages 362-376, October.
More about this item
Keywords
Network Flow Algorithms; Multiple Objective Programming; Multiple Criteria Decision Making; Integer Programming; Branch-and-Bound;All these keywords.
JEL classification:
- C14 - Mathematical and Quantitative Methods - - Econometric and Statistical Methods and Methodology: General - - - Semiparametric and Nonparametric Methods: General
- C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:tsa:wpaper:0028mss. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wendy Frost (email available below). General contact details of provider: https://edirc.repec.org/data/cbutsus.html .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.