Skip to main content
U.S. Department of Energy
Office of Scientific and Technical Information

A Parallel Computing Framework for Finding the Supported Solutions to a Biobjective Network Optimization Problem

Journal Article · · Journal of Multi-Criteria Decision Analysis
DOI:https://doi.org/10.1002/mcda.1541· OSTI ID:1401385
 [1];  [1]
  1. Department of Geography University of California Santa Barbara California USA
Abstract

Solving multi‐objective combinatorial optimization problems can quickly become computationally challenging when applied to large networks generated from big data. Present‐day first‐rate Mixed Integer Programming (MIP) solvers have parallelism built‐in to take advantage of multicore architectures; but specialized network optimization algorithms that can often solve graph problems more efficiently than a general MIP solver are typically programmed serially. Thus, these network algorithm implementations do not take full advantage of modern multicore computer capabilities. Many parallel computing languages include a fork/join framework into their concurrency packages that allow for simple conversion of recursive serial algorithms to operate in parallel without having to use complicated low‐level message‐passing interfaces. Fork/join is particularly well suited to divide and conquer algorithms such as Non‐Inferior Set Estimation (NISE) method for computing the supported Pareto front of a multi‐objective optimization problem. This work develops a simple general parallel NISE (pNISE) implementation using the Java 7 concurrency tools, and then offers results from a specific implementation of solving a bi‐objective shortest path problem. The results indicate that this method is capable of sizeable speed‐ups on both small‐scale personal computers as well as large‐scale shared memory supercomputers. Finally, other network problems suitable to this method are discussed, including multi‐objective variants of the minimum spanning tree problem, transportation problem, assignment problem, maximum flow problem, and the minimum‐cost flow problem. Copyright © 2015 John Wiley & Sons, Ltd.

Sponsoring Organization:
USDOE
OSTI ID:
1401385
Journal Information:
Journal of Multi-Criteria Decision Analysis, Journal Name: Journal of Multi-Criteria Decision Analysis Journal Issue: 5-6 Vol. 22; ISSN 1057-9214
Publisher:
Wiley Blackwell (John Wiley & Sons)Copyright Statement
Country of Publication:
Country unknown/Code not available
Language:
English

References (31)

Optimal Power Flow book November 2011
Parallel Bi-objective Shortest Paths Using Weight-Balanced B-trees with Bulk Updates book January 2014
Overview of Scheduling and Planning of Batch Process Operations book January 1996
A note on two problems in connexion with graphs journal December 1959
Shortest paths algorithms: Theory and experimental evaluation journal May 1996
Hybrid biobjective evolutionary algorithms for the design of a hospital waste management network journal January 2008
A model and algorithm for multicriteria route-mode choice journal December 1979
An interactive approach to identify the best compromise solution for two objective shortest path problems journal January 1990
Selection of bioclimatically representative biological reserve systems under climate change journal February 2005
Computing all efficient solutions of the biobjective minimum spanning tree problem journal January 2008
A comparison of solution strategies for biobjective shortest path problems journal April 2009
Multiple objective minimum cost flow problems: A review journal February 2007
Two phase algorithms for the bi-objective assignment problem journal March 2008
Optimal power flow solutions through multi-objective programming journal June 2012
Managing population and drought risks using many-objective water portfolio planning under uncertainty: MANY-OBJECTIVE WATER PORTFOLIOS journal December 2009
Generating multiobjective trade-offs: An algorithm for bicriterion problems journal October 1979
Transmission Corridor Location Modeling journal March 1985
An Evaluation of Lattice Solutions to the Problem of Corridor Location journal July 1977
Supplier Selection Using Multi‐objective Programming: A Decision Support System Approach journal February 1993
Parallel Label-Setting Multi-objective Shortest Path Search
  • Sanders, Peter; Mandow, Lawrence
  • 2013 IEEE International Symposium on Parallel & Distributed Processing (IPDPS), 2013 IEEE 27th International Symposium on Parallel and Distributed Processing https://doi.org/10.1109/IPDPS.2013.89
conference May 2013
Multicriteria path and tree problems: discussion on exact algorithms and applications journal January 2012
Strategic Facility Planning: the Analysis of Options journal January 1982
How good is the Chord algorithm? conference December 2013
Validity of the single processor approach to achieving large scale computing capabilities conference January 1967
A Java fork/join framework conference January 2000
Corridor Location for Infrastructure Development: A Fast Bi-objective Shortest Path Method for Approximating the Pareto Frontier journal October 2013
Solving the Bi-Objective Maximum-Flow Network-Interdiction Problem journal May 2007
A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme journal August 2010
Some Simple-Minded Observations on the Role of Optimization in Public Systems Decision-Making journal August 1976
Bicriteria Transportation Problem journal January 1979
Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms journal June 2007

Similar Records

Efficient Heterogeneous Execution on Large Multicore and Accelerator Platforms: Case Study Using a Block Tridiagonal Solver
Journal Article · Mon Dec 31 23:00:00 EST 2012 · Journal of Parallel and Distributed Computing · OSTI ID:1115349

Algorithm 1028: VTMOP: Solver for Blackbox Multiobjective Optimization Problems
Journal Article · Fri Sep 09 20:00:00 EDT 2022 · ACM Transactions on Mathematical Software · OSTI ID:1888744

Real-Time Stochastic Optimization of Complex Energy Systems on High-Performance Computers
Journal Article · Mon Sep 01 00:00:00 EDT 2014 · Computing in Science and Engineering · OSTI ID:1565223

Related Subjects