A Lagrangian Relaxation Heuristic for a Bi-Objective Multimodal Transportation Planning Problem.
Zhaojin LiHaoxun ChenYa LiuKun JinPublished in: IEEE Trans. Intell. Transp. Syst. (2023)
Keyphrases
- lagrangian relaxation
- bi objective
- integer programming
- multi objective
- feasible solution
- shortest path problem
- efficient solutions
- lower and upper bounds
- shortest path
- lower bound
- set covering problem
- column generation
- dynamic programming
- np hard
- linear programming
- multi objective optimization
- branch and bound algorithm
- mixed integer programming
- ant colony optimization
- network design
- mixed integer program
- lagrangian heuristic
- dual decomposition
- randomly generated test problems
- multiple objectives
- single machine scheduling problem
- upper bound
- nsga ii
- network design problem
- knapsack problem
- cutting plane algorithm
- objective function
- evolutionary algorithm
- optimal solution
- heuristic methods
- routing problem
- tabu search