A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction
Tobias BuerHerbert KopferPublished in: CoRR (2012)
Keyphrases
- reverse auction
- bi objective
- metaheuristic
- multi objective
- ant colony optimization
- multi objective optimization
- genetic algorithm
- particle swarm optimization
- evolutionary algorithm
- optimization problems
- simulated annealing
- multi attribute
- tabu search
- multiple objectives
- combinatorial optimization problems
- objective function
- multiobjective optimization
- optimal solution
- search space
- efficient solutions
- scatter search
- combinatorial optimization
- optimization algorithm
- nsga ii
- vehicle routing problem
- path relinking
- pareto optimal
- shortest path problem
- winner determination
- group buying
- benchmark instances
- knapsack problem
- auction mechanisms
- differential evolution
- traveling salesman problem
- network design
- fitness function
- hybrid algorithms
- combinatorial auctions
- cost function