Solving the maximum edge disjoint path problem using a modified Lagrangian particle swarm optimisation hybrid
Year of publication: |
2021
|
---|---|
Authors: | Weiner, Jake ; Ernst, Andreas ; Li, Xiaodong ; Sun, Yuan ; Deb, Kalyanmoy |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 293.2021, 3 (16.9.), p. 847-862
|
Subject: | Combinatorial optimization | Large scale optimization | Metaheuristics | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Heuristik | Heuristics | Scheduling-Verfahren | Scheduling problem | Tourenplanung | Vehicle routing problem |
-
Quevedo-Orozco, Dagoberto R., (2015)
-
Relaxation heuristics for the set multicover problem with generalized upper bound constraints
Umetani, Shunji, (2018)
-
Juan, Angel A., (2015)
- More ...
-
Sun, Yuan, (2021)
-
Adaptive solution prediction for combinatorial optimization
Shen, Yunzhuang, (2023)
-
Boosting ant colony optimization via solution prediction and machine learning
Sun, Yuan, (2022)
- More ...