Abstracts - faqs.org

Abstracts

Business, international

Search abstracts:
Abstracts » Business, international

An efficient composite heuristic for the symmetric generalized traveling salesman problem

Article Abstract:

A new composite heuristic was proposed to resolve the symmetric generalized traveling salesman problem. The heuristic includes an introductory phase wherein development of an initial partial solution is undertaken. It is then followed by a phase in which insertion of a node from every non-visited node-subset is observed. Its last phase entails implementation of two solution improvement procedures to the solution generated by the second phase.

Author: Boctor, Fayez F., Renaud, Jacques
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1998

User Contributions:

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

CAPTCHA


Heuristic sensitivity analysis in a combinatorial environment: an exposition and case study

Article Abstract:

A method for sensitivity or post-optimality analysis was developed to solve the Generalized Assignment Problem (GAP). The method takes into consideration changes in problem parameters such as load sizes and capacities. Under a combinatoric environment, it was revealed that sensitivity analysis is also used to analyze the robustness of the heuristic, the problem instance, the solution and reoptimization.

Author: Amini, Mohammad M., Racer, Michael, Ghandforoush, Parviz
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1998
Analysis

User Contributions:

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

CAPTCHA


A hybrid heuristic for the generalized assignment problem

Article Abstract:

A hybrid heuristic has been developed to provide solution to the generalized assignment problem (GAP). The new heuristic combines the features of the heuristic GAP and the Variable-Depth-Search Heuristic to achieve high solution quality and minimal CPU time. The proposed heuristic has been applied in the solution of several classes of GAPs with satisfactory results.

Author: Amini, Mohammad M., Racer, Michael
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1995
Scheduling (Management), Heuristic programming

User Contributions:

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

CAPTCHA


Subjects list: Research, Mathematics, Heuristic, Combinatorial optimization, Heuristics (Psychology), Integer programming
Similar abstracts:
  • Abstracts: An adaptation of SH heuristic to the location set covering problem. The relationship between preventive maintenance and manufacturing system performance
  • Abstracts: A tabu search heuristic procedure for the fixed charge transportation problem. Determining buffer location and size in production lines using tabu search
  • Abstracts: A tabu search heuristic procedure for the fixed charge transportation problem. part 2 Search strategies for the feeder bus network design problem
  • Abstracts: The Benelux market for household cleaning agents. Textile washing products. The German market for dishwashing detergents: major markets: non-foods
  • Abstracts: Overcapacity is a basic woe. Slow growth, falling stocks spur ownership shuffles
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.