A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction.
Tobias BuerHerbert KopferPublished in: Comput. Oper. Res. (2014)
Keyphrases
- reverse auction
- bi objective
- metaheuristic
- multi objective
- ant colony optimization
- multi objective optimization
- genetic algorithm
- particle swarm optimization
- evolutionary algorithm
- optimization problems
- multi attribute
- simulated annealing
- scatter search
- tabu search
- nsga ii
- combinatorial optimization problems
- multiple objectives
- search space
- optimal solution
- shortest path problem
- multiobjective optimization
- combinatorial optimization
- pareto optimal
- optimization algorithm
- efficient solutions
- winner determination
- path relinking
- objective function
- hybrid algorithms
- traveling salesman problem
- group buying
- benchmark instances
- fitness function
- vehicle routing problem
- differential evolution
- network design
- global optimization
- benchmark problems
- neural network
- reinforcement learning
- lower bound
- computational complexity
- auction mechanisms
- routing problem
- multiple independent