Abstracts - faqs.org

Abstracts

Business, international

Search abstracts:
Abstracts » Business, international

An effective implementation of the Lin-Kernighan traveling salesman heuristic

Article Abstract:

Research is presented concerning the generation of near-optimal and optimal solutions for traveling salesmen models through the use of the Lin-Kernighan heuristic. Computational tests of the Lin-Kernighan heuristic are discussed.

Author: Helsgaun, Keld
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2000
Traveling sales personnel, Traveling salespeople

User Contributions:

1
imrankhan
Report this comment as inappropriate
Aug 17, 2009 @ 2:02 am
seems some goood work has been caried out ,willing to review complete litrature as working on same

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

CAPTCHA


An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem

Article Abstract:

Research is presented concerning the hybridization of heuristics preserving bottom-left stability during packing procedures with simulated annealing, genetic algorithms and local search heuristics. The quality of the solution is discussed.

Author: Hopper, E., Turton, B.C.H.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2001
Mathematical optimization, Optimization theory, Simulated annealing (Mathematics)

User Contributions:

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

CAPTCHA


The multi-mode resource-constrained project scheduling problem with generalized precedence relations

Article Abstract:

A study has been conducted to develop a heuristic solution methodology for the multimode resource-constrained project scheduling problem with generalized precedence relations (MRCPSP-GRP) The MRCPSP problem was solved using a biased random sampling and a priority-based heuristic for heuristically solving the RCPSP for a fixed mode assignment. Result have indicated that the tabu search procedure is capable of outperforming all other heuristic approaches in terms of solving MRCPSP-GRP problems.

Author: Herroelen, Willy, Reyck, Bert De
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1999
Production Planning & Control, Project management, Scheduling (Management), Production control

User Contributions:

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

CAPTCHA


Subjects list: Operations research, Research, Management science, Analysis, Algorithms, Heuristic programming
Similar abstracts:
  • Abstracts: ProGen/pi chi - an instance generator for resource-constrained project scheduling problems with partially renewable resources and further extensions
  • Abstracts: The dynamic predicate stashing copy problem and the Steiner problem in graphs. Solving group Steiner problems as Steiner problems
  • Abstracts: Solving an assignment-selection problem with verbal information and using genetic algorithms. Economic expectations, fuzzy sets and financial planning
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.