Name
Abstract | ||
|---|---|---|
There is a variety of methods for ranking objectives in multiobjective optimization and some are difficult to define because they require information a priori (e.g. establishing weights in a weighted approach or setting the ordering in a lexicographic approach). In manyobjective optimization problems, those methods may exhibit poor diversification and intensification performance. We propose the Dynamic Lexicographic Approach (DLA). In this ranking method, the priorities are not fixed, but they change throughout the search process. As a result, the search process is less liable to get stuck in local optima and therefore, DLA offers a wider exploration in the objective space. In this work, DLA is compared to Pareto dominance and lexicographic ordering as ranking methods within a Discrete Particle Swarm Optimization algorithm tackling the Vehicle Routing Problem with Time Windows. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/978-3-642-15871-1_4 | PPSN (2) |
Keywords | Field | DocType |
multi objective optimization,combinatorial optimization,vehicle routing problem,lexicographic order | Particle swarm optimization,Mathematical optimization,Vehicle routing problem,Vector optimization,Computer science,Local optimum,Multi-swarm optimization,Multi-objective optimization,Combinatorial optimization,Optimization problem | Conference |
Volume | ISSN | ISBN |
6239 | 0302-9743 | 3-642-15870-6 |
Citations | PageRank | References |
2 | 0.37 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Juan Pedro Castro Gutiérrez | 1 | 9 | 0.90 |
| Dario Landa Silva | 2 | 316 | 28.38 |
| José A. Moreno-pérez | 3 | 640 | 37.05 |