Mean-standard-deviation-based electric vehicle routing problem with time windows using Lagrangian relaxation and extended alternating direction method of multipliers-based decomposition algorithm.
Jieman XiaZhou HeShuolei WangSiliang LiuShuai ZhangPublished in: Soft Comput. (2024)
Keyphrases
- standard deviation
- vehicle routing problem with time windows
- lagrangian relaxation
- decomposition algorithm
- column generation
- integer programming
- valid inequalities
- linear programming
- branch and bound
- cutting plane algorithm
- decomposition method
- np hard
- mixed integer programming
- feasible solution
- linear program
- constraint programming
- correlation coefficient
- cutting plane
- branch and bound algorithm
- vehicle routing problem
- lower and upper bounds
- lower bound
- dynamic programming
- integer program
- face recognition
- machine learning
- recognition algorithm
- convex optimization
- benchmark problems
- traveling salesman problem
- optimization problems