top-1

top-2 top-3

top-4 top-5

menutop

   Program

 

   Committee

 

   Author Index

 

   Search

 

   About GECCO

 

   CD Tech Support

menubot2

 

 

 

 

Session:

Late Breaking Paper

Title:

Solving Multiobjective Shortest Path Problems by Using Ant Colony Optimization Combined with a new Heuristic-Value-Concept - The Look-Ahead-Heuristic

 

 

Authors:

Marco Fischer
Sascha Häckel
Kaminski Jens

 

 

Abstract:

The paper describes an improved method for the decision support during the selection of partners in a Virtual Enterprise. This needs a method for choosing the most capable offers (of the partners) for a customer inquiry from a pool of potential partners. The offers consist of more than one criterion and have to fulfil the tasks of a value chain. Especially on the popular field of supply chains, applicants are more and more confronted with the search for non-sequential paths which could contain parallelism. The problem arises to a Multiobjective Parallel Path Problem. Because complexity of those problems exceeds the capacities of exact procedures, the Ant Family Heuristic was developed. Improving the performance in the multiobjective case the Look-Ahead-Heuristic will be introduced in this contribution. With the usage of this new heuristic, clearly better results can be achieved.

 

 

CD-ROM Produced by X-CD Technologies