Abstracts - faqs.org

Abstracts

Business, international

Search abstracts:
Abstracts » Business, international

Parallel processing for difficult combinatorial optimization problems

Article Abstract:

Branch and Bound (B & B) is employed in complex algorithmic problems arising from the design and analysis of parallel algorithms. Good results are obtained with correct application of parallel processing in B & B solutions of combinatorial optimization issues. Specifically, in large-scale applications, parallelism limits combinatorial explosions while affording effective real-time solutions. Moreover, parallelism promotes local optimization in major problems where only heuristic programs are applicable.

Author: Roucairol, Catherine
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1996
Usage, Parallel processing

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


A parallel depth first search branch and bound algorithm for the quadratic assignment problem

Article Abstract:

A branch and bound algorithm is developed for the quadratic assignment problem (QAP). Although the QAP is recognized as a combinatorial optimization method with extensive applications, its use has been hampered by computational problems. Branch and bound techniques offer exact parallel solution methods for QAP. The feeding tree is an example of an efficient parallel algorithm that distributes processor work while optimizing speedup and overhead.

Author: Mans, Bernard, Mautor, Thierry, Roucairol, Catherine
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1995

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Using Tabu search for solving a dynamic multi-terminal truck dispatching problem

Article Abstract:

A two-phase model is developed to solve a tank truck dispatching problem. Route sequences are calculated using a decomposition method in the first phase while these results are modified using a Tabu search method in the second phase. Applications of the model show that solutions generated deviate by only 1% from the optimal solution. Small orders were also integrated into other routes to reduce the number of trucks.

Author: Rego, Cesar, Roucairol, Catherine
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1995
Models, Scheduling (Management), Delivery of goods, Deliveries (Transportation)

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Subjects list: Research, Combinatorial optimization, Branch and bound algorithms
Similar abstracts:
  • Abstracts: Backtracking of jobs in one-dimensional machine location problems. Optimal models for a multi-stage supply chain system controlled by kanban under just-in-time philosophy
  • Abstracts: The year of cutting dangerously. Coming soon, to a station near you: energy taxes. Taxing the rich
  • Abstracts: Peace and prosperity. Help comes in a package. Winds of change
  • Abstracts: Computing for conservation. The integrated practice. Choosing low-cost CAD
  • Abstracts: Tsingtao loses fizz as competition, rising ingredient costs sop up profits. Problems at China's Daya Bay reactor could mean opportunities for U.S. firms
This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.
Some parts © 2025 Advameg, Inc.