A feasible path-based branch and bound algorithm for strongly nonconvex MINLP problems

A feasible path-based branch and bound algorithm for strongly nonconvex MINLP problems

In this paper, a feasible path-based branch and bound (B&B) algorithm is proposed to solve mixed-integer nonlinear programming problems with highly nonconvex nature through integration of the previously proposed hybrid feasible-path optimisation algorithm and the branch and bound method. The...

Full description

Bibliographic Details
Main Authors:	Chao Liu, Yingjie Ma, Dongda Zhang, Jie Li
Format:	Article
Language:	English
Published:	Frontiers Media S.A. 2022-09-01
Series:	Frontiers in Chemical Engineering
Subjects:	branch and bound (B&B) MINLP (mixed integer nonlinear programming) feasible path optimisation algorithm process synthesis process intensification
Online Access:	https://www.frontiersin.org/articles/10.3389/fceng.2022.983162/full

Similar Items

A group theoretic branch and bound algorithm for the zero-one integer programming problem,
by: Shapiro, Jeremy F.
Published: (2009)

A Branch and Bound Algorithm for Transmission Network Expansion Planning Using Nonconvex Mixed-Integer Nonlinear Programming Models
by: Reinaldo T. Zoppei, et al.
Published: (2022-01-01)

Binary goal programming model for optimizing tire selection using branch and bound algorithm
by: Aly Shady
Published: (2021-01-01)

The MINLP Approach to Topology, Shape and Discrete Sizing Optimization of Trusses
by: Simon Šilih, et al.
Published: (2022-01-01)

Optimal Design and Competitive Spans of Timber Floor Joists Based on Multi-Parametric MINLP Optimization
by: Primož Jelušič, et al.
Published: (2022-04-01)

Feasible rounding based diving strategies in branch-and-bound methods for mixed-integer optimization
by: Christoph Neumann, et al.
Published: (2022-01-01)

THE RAY-METHOD: THEORETICAL BACKGROUND AND COMPUTATIONAL RESULTS
by: Erik Bajalinov, et al.
Published: (2012-12-01)

Historical Load Balance in Distribution Systems Using the Branch and Bound Algorithm
by: Jorge Arias, et al.
Published: (2019-03-01)

A Branch-and-Bound Algorithm for the Bi-Objective Quay Crane Scheduling Problem Based on Efficiency and Energy
by: Hongming Li, et al.
Published: (2022-12-01)

Simulated Annealing Algorithm for Determining Travelling Salesman Problem Solution and Its Comparison with Branch and Bound Method
by: Bib Paruhum Silalahi, et al.
Published: (2022-07-01)

Feasible Path-Based Branch and Bound Algorithm for Highly Nonconvex Mixed-Integer Nonlinear Programming Problems
by: Chao Liu, et al.
Published: (2022-09-01)

Tool for Simulating Branch and Bound Computations
by: Ignatov Andrei, et al.
Published: (2020-05-01)

Branch-and-bound methods : a survey /
by: 325876 Lawler, E. L., et al.

Branch-and bound strategies for dynamic programming
by: Morin, Thomas L., et al.
Published: (2009)

Branch-and-bound strategies for dynamic programming
by: Morin, Thomas L., et al.
Published: (2009)

Branch and bound methods for combinatorial problems.
by: Little, John D. C.
Published: (2009)

A branch and bound and simulated annealing approach for job shop scheduling [UTM article journal] /
by: 260551 Tan, Hui Woon, et al.

Branch-and-bound applications in combinatorial data analysis /
by: 293815 Brusco, Michael J., et al.
Published: (2005)

Rounding-based heuristics for nonconvex MINLPs
by: Nannicini, Giacomo, et al.
Published: (2016)

Constrained optimization with integer and continuous variables using inexact restoration and projected gradients
by: Ernesto G. Birgin, et al.
Published: (2016-09-01)

Global optimization using the branch‐and‐bound algorithm with a combination of Lipschitz bounds over simplices
by: Remigijus Paulavičius, et al.
Published: (2009-06-01)

An implementation of a parallel generalized branch and bound template
by: Milda Baravykaitė, et al.
Published: (2007-09-01)

PENERAPAN BRANCH AND BOUND ALGORITHM DALAM OPTIMALISASI PRODUKSI ROTI
by: GEDE SURYAWAN, et al.
Published: (2016-11-01)

An ultra-fast optimization algorithm for unit commitment based on neural branching
by: Yi Sun, et al.
Published: (2023-09-01)

Fast and optimal branch-and-bound planner for the grid-based coverage path planning problem based on an admissible heuristic function
by: Jaël Champagne Gareau, et al.
Published: (2023-01-01)

Computational Enhancement in the Application of the Branch and Bound Method for Linear Integer Programs and Related Models
by: Masar Al-Rabeeah, et al.
Published: (2019-10-01)

A Branch-and-Bound Algorithm for Minimizing the Total Tardiness of Multiple Developers
by: Chung-Ho Su, et al.
Published: (2022-04-01)

Using infeasible path cuts to solve Electric Vehicle Routing Problems with realistic charging functions exactly within a branch-and-cut framework
by: Arne Schulz
Published: (2024-01-01)

A Novel Branch and Bound Pure Integer Programming Phase Unwrapping Algorithm for Dual-Baseline InSAR
by: Hui Liu, et al.
Published: (2022-06-01)

Branching processes /
by: 340303 Athreya, K. B., et al.
Published: (1972)

Globally optimal phasor measurement unit placement using branch and bound algorithm
by: Mohamed Z. Kamh, et al.
Published: (2021-09-01)

Processor load balancing for parallel branch and bound algorithms
by: Milda Baravykaitė
Published: (2005-12-01)

Introducing an Educational Tool for Learning Branch & Bound Strategy
by: Sofriesilero Zumaytis, et al.
Published: (2017-04-01)

Exact Solutions for Minimizing cost Function with Five Criteria and Release Dates on Single Machine
by: Hanan Ali Chachan, et al.
Published: (2020-07-01)

The Trade-Offs between Optimality and Feasibility in Online Routing with Dedicated Path Protection in Elastic Optical Networks
by: Ireneusz Olszewski, et al.
Published: (2022-06-01)

Optimasi Kendaraan Pengangkut Sampah di Kecamatan Kertapati Menggunakan Pemrograman Bilangan Bulat Biner 0 dan 1
by: Eka Susanti, et al.
Published: (2016-12-01)

On aggregation of multitype Galton–Watson branching processes with immigration
by: Mátyás Barczy, et al.
Published: (2018-02-01)

A General Scheme of a Branch-and-Bound Approach for the Sensor Selection Problem in Near-Field Broadband Beamforming
by: Agnieszka Wielgus, et al.
Published: (2024-01-01)

Pre-decomposition of discrete optimization problems to speed up the branch and bound method in a distributed computing environment
by: S. A. Smirnov, et al.
Published: (2015-06-01)

Integrated Saving Matrix - Branch And Bound Method to Optimize Sugar Product’s Distribution Route
by: Ryan Rafli Devanda, et al.
Published: (2022-10-01)