A metaheuristic penalty approach for the starting point in nonlinear programming.
David R. PenasMarcos RaydanPublished in: RAIRO Oper. Res. (2020)
Keyphrases
- nonlinear programming
- starting point
- metaheuristic
- optimization problems
- objective function
- evolutionary algorithm
- tabu search
- ant colony optimization
- linear programming
- combinatorial optimization problems
- combinatorial optimization
- combinatorial problems
- benchmark problems
- optimal solution
- cost function
- simulated annealing
- vehicle routing problem
- penalty function
- variational inequalities
- knapsack problem
- search space
- genetic algorithm
- multi objective
- exact algorithms
- feasible solution
- lower bound
- initial solution
- learning algorithm
- traveling salesman problem
- np hard