Comparison of evolutionary multi objective algorithms for the dynamic network design problem

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

2 Citations (Scopus)

Abstract

In traffic and transport a significant portion of research and application is focused on single objective optimization, although there is rarely only one objective that is of interest. The externalities of traffic are of increasing importance for policy decisions related to the design of a road network. The optimization of externalities using dynamic traffic management measures is a multi objective network design problem. The presence of multiple conflicting objectives makes the optimization problem challenging to solve. Evolutionary multi objective algorithms has been proven successful in solving multi objective optimization problems. However, like all optimization methods, these are subject to the free lunch theorem. Therefore, we compare the NSGAII, SPEA2 and SPEA2+ algorithms in order to find a Pareto optimal solution set for this optimization problem. Because of CPU time limitation as a result of solving the lower level using a dynamic traffic assignment model, the performance by the algorithms is compared within a certain budget. The externalities optimized are noise, climate and accessibility. In a numerical experiment the SPEA2+ outperforms the SPEA2 on all used measures. Comparing NSGAII and SPEA2+, there is no clear evidence of one approach outperforming the other.
Original languageEnglish
Title of host publication8th IEEE International Conference on Networking, Sensing and Control, ICNSC 2011
Place of PublicationPiscataway, NJ, USA
PublisherIEEE
Pages275-280
ISBN (Print)978-1-4244-9570-2
DOIs
Publication statusPublished - 11 Apr 2011
Event8th IEEE International Conference on Networking, Sensing and Control, ICNSC 2011 - Delft, Netherlands
Duration: 11 Apr 201113 Apr 2011
Conference number: 8

Publication series

Name
PublisherIEEE

Conference

Conference8th IEEE International Conference on Networking, Sensing and Control, ICNSC 2011
Abbreviated titleICNSC 2011
CountryNetherlands
CityDelft
Period11/04/1113/04/11

Fingerprint

Multiobjective optimization
Program processors
Experiments

Keywords

  • METIS-267813
  • IR-101446

Cite this

Wismans, L. J. J., van Berkum, E. C., & Bliemer, M. C. J. (2011). Comparison of evolutionary multi objective algorithms for the dynamic network design problem. In 8th IEEE International Conference on Networking, Sensing and Control, ICNSC 2011 (pp. 275-280). Piscataway, NJ, USA: IEEE. https://doi.org/10.1109/ICNSC.2011.5874870
Wismans, Luc Johannes Josephus ; van Berkum, Eric C. ; Bliemer, Michiel C.J. / Comparison of evolutionary multi objective algorithms for the dynamic network design problem. 8th IEEE International Conference on Networking, Sensing and Control, ICNSC 2011. Piscataway, NJ, USA : IEEE, 2011. pp. 275-280
@inproceedings{cbfdaec1579d42fd974f03dd7fa8f928,
title = "Comparison of evolutionary multi objective algorithms for the dynamic network design problem",
abstract = "In traffic and transport a significant portion of research and application is focused on single objective optimization, although there is rarely only one objective that is of interest. The externalities of traffic are of increasing importance for policy decisions related to the design of a road network. The optimization of externalities using dynamic traffic management measures is a multi objective network design problem. The presence of multiple conflicting objectives makes the optimization problem challenging to solve. Evolutionary multi objective algorithms has been proven successful in solving multi objective optimization problems. However, like all optimization methods, these are subject to the free lunch theorem. Therefore, we compare the NSGAII, SPEA2 and SPEA2+ algorithms in order to find a Pareto optimal solution set for this optimization problem. Because of CPU time limitation as a result of solving the lower level using a dynamic traffic assignment model, the performance by the algorithms is compared within a certain budget. The externalities optimized are noise, climate and accessibility. In a numerical experiment the SPEA2+ outperforms the SPEA2 on all used measures. Comparing NSGAII and SPEA2+, there is no clear evidence of one approach outperforming the other.",
keywords = "METIS-267813, IR-101446",
author = "Wismans, {Luc Johannes Josephus} and {van Berkum}, {Eric C.} and Bliemer, {Michiel C.J.}",
year = "2011",
month = "4",
day = "11",
doi = "10.1109/ICNSC.2011.5874870",
language = "English",
isbn = "978-1-4244-9570-2",
publisher = "IEEE",
pages = "275--280",
booktitle = "8th IEEE International Conference on Networking, Sensing and Control, ICNSC 2011",
address = "United States",

}

Wismans, LJJ, van Berkum, EC & Bliemer, MCJ 2011, Comparison of evolutionary multi objective algorithms for the dynamic network design problem. in 8th IEEE International Conference on Networking, Sensing and Control, ICNSC 2011. IEEE, Piscataway, NJ, USA, pp. 275-280, 8th IEEE International Conference on Networking, Sensing and Control, ICNSC 2011, Delft, Netherlands, 11/04/11. https://doi.org/10.1109/ICNSC.2011.5874870

Comparison of evolutionary multi objective algorithms for the dynamic network design problem. / Wismans, Luc Johannes Josephus; van Berkum, Eric C.; Bliemer, Michiel C.J.

8th IEEE International Conference on Networking, Sensing and Control, ICNSC 2011. Piscataway, NJ, USA : IEEE, 2011. p. 275-280.

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

TY - GEN

T1 - Comparison of evolutionary multi objective algorithms for the dynamic network design problem

AU - Wismans, Luc Johannes Josephus

AU - van Berkum, Eric C.

AU - Bliemer, Michiel C.J.

PY - 2011/4/11

Y1 - 2011/4/11

N2 - In traffic and transport a significant portion of research and application is focused on single objective optimization, although there is rarely only one objective that is of interest. The externalities of traffic are of increasing importance for policy decisions related to the design of a road network. The optimization of externalities using dynamic traffic management measures is a multi objective network design problem. The presence of multiple conflicting objectives makes the optimization problem challenging to solve. Evolutionary multi objective algorithms has been proven successful in solving multi objective optimization problems. However, like all optimization methods, these are subject to the free lunch theorem. Therefore, we compare the NSGAII, SPEA2 and SPEA2+ algorithms in order to find a Pareto optimal solution set for this optimization problem. Because of CPU time limitation as a result of solving the lower level using a dynamic traffic assignment model, the performance by the algorithms is compared within a certain budget. The externalities optimized are noise, climate and accessibility. In a numerical experiment the SPEA2+ outperforms the SPEA2 on all used measures. Comparing NSGAII and SPEA2+, there is no clear evidence of one approach outperforming the other.

AB - In traffic and transport a significant portion of research and application is focused on single objective optimization, although there is rarely only one objective that is of interest. The externalities of traffic are of increasing importance for policy decisions related to the design of a road network. The optimization of externalities using dynamic traffic management measures is a multi objective network design problem. The presence of multiple conflicting objectives makes the optimization problem challenging to solve. Evolutionary multi objective algorithms has been proven successful in solving multi objective optimization problems. However, like all optimization methods, these are subject to the free lunch theorem. Therefore, we compare the NSGAII, SPEA2 and SPEA2+ algorithms in order to find a Pareto optimal solution set for this optimization problem. Because of CPU time limitation as a result of solving the lower level using a dynamic traffic assignment model, the performance by the algorithms is compared within a certain budget. The externalities optimized are noise, climate and accessibility. In a numerical experiment the SPEA2+ outperforms the SPEA2 on all used measures. Comparing NSGAII and SPEA2+, there is no clear evidence of one approach outperforming the other.

KW - METIS-267813

KW - IR-101446

U2 - 10.1109/ICNSC.2011.5874870

DO - 10.1109/ICNSC.2011.5874870

M3 - Conference contribution

SN - 978-1-4244-9570-2

SP - 275

EP - 280

BT - 8th IEEE International Conference on Networking, Sensing and Control, ICNSC 2011

PB - IEEE

CY - Piscataway, NJ, USA

ER -

Wismans LJJ, van Berkum EC, Bliemer MCJ. Comparison of evolutionary multi objective algorithms for the dynamic network design problem. In 8th IEEE International Conference on Networking, Sensing and Control, ICNSC 2011. Piscataway, NJ, USA: IEEE. 2011. p. 275-280 https://doi.org/10.1109/ICNSC.2011.5874870