Skip to main content
Intended for healthcare professionals
Restricted access
Research article
First published online January 1, 2011

Comparison of Multiobjective Evolutionary Algorithms for Optimization of Externalities by Using Dynamic Traffic Management Measures

Abstract

The externalities of traffic are increasingly important for policy decisions related to design of a road network. Optimization of externalities with dynamic traffic management measures influencing the supply of infrastructure is a multiobjective network design problem, which in turn is a bi-level optimization problem. The presence of conflicting objectives makes the solution to the optimization problem a challenge. Evolutionary multiobjective algorithms have proved successful in solving such problems. However, like all optimization methods, these are subject to the no-free-lunch theorem. Therefore, this paper compares the nondominated sorting genetic algorithm II (NSGA-II), the strength Pareto evolutionary algorithm 2 (SPEA2), and the strength Pareto evolutionary algorithm 2+ (SPEA2+) to find a Pareto optimal solution set for this problem. Because incorporation of traffic dynamics is important, the lower level should be solved through a dynamic traffic assignment model, which increases needed CPU time. Therefore, algorithm performance is compared within a certain budget. The approaches are compared in a numerical experiment through different metrics. The externalities optimized are noise, climate, and congestion. The results show that climate and congestion are aligned and that both are opposed to noise in the case study. On average, SPEA2+ outperforms SPEA2 in this problem on all used measures. Results of NSGA-II and SPEA2+ are inconclusive. A larger population results on average in a larger space coverage, while a smaller population results in higher performance on spacing and diversity. Most performance measures are relatively insensitive for the mutation rate.

Get full access to this article

View all access and purchase options for this article.

References

1. LeBlanc L. J., and Abdulaal M. An Efficient Dual Approach to the Urban Network Design Problem. Computers & Mathematics with Applications, Vol. 5, 1978, pp. 11–19.
2. Zhang G., and Lu J. Genetic Algorithm for Continuous Network Design Problem. Journal of Transportation Systems Engineering and Information Technology, Vol. 7, 2007, pp. 101–105.
3. Gao Z., Wu J., and Sun H. Solution Algorithm for the Bi-Level Discrete Network Design Problem. Transportation Research Part B, Vol. 39, 2005, pp. 479–495.
4. Chiou S. Bilevel Programming for the Continuous Transport Network Design Problem. Transportation Research Part B, Vol. 39, 2005, pp. 361–383.
5. Possel B., Wismans L. J. J., Van Berkum E. C., and Bliemer M. C. J. The Multi-Objective Network Design Problem Using Minimizing Externalities as Objectives: Comparison of a Genetic Algorithm and Simulated Annealing Framework. Journal of Advanced Transportation, in press.
6. Deb K. Multi-Objective Optimization Using Evolutionary Algorithms. John Wiley and Sons, Chichester, United Kingdom, 2001.
7. Zitzler E., Laumanns M., and Thiele L. SPEA2: Improving the Performance of the Strength Pareto Evolutionary Algorithm. Technical Report 103. Computer Engineering and Communication Networks Lab, Swiss Federal Institute of Technology, Zurich, Switzerland, 2001.
8. Deb K., Pratap A., Agarwal S., and Meyarivan T. A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, Vol. 6, No. 2, 2002, pp. 182–197.
9. Kim M., Hiroyasu T., Miki M., and Watanabe S. SPEA2+: Improving the Performance of the Strength Pareto Evolutionary Algorithm 2. Lecture Notes in Computer Science Proc., Parallel Problem Solving from Nature: PPSN VIII, Vol. 3242, 2004, pp. 742–751.
10. Wolpert D., and Macready W. No-Free-Lunch Theorems for Optimization. IEEE Transactions on Evolutionary Computation, Vol. 1, 1997, No. 1, pp. 67–82.
11. Ho Y. C., and Pepyne D. L. Simple Explanation of the No-Free-Lunch Theorem and Its Implications. Journal of Optimization Theory and Applications, Vol. 115, 2002, No. 3, pp. 549–570.
12. Wismans L. J. J., Van Berkum E. C., and Bliemer M. C. J. Modeling Externalities Using Dynamic Traffic Assignment Models: A Review. Transport Reviews, Vol. 31, No. 4, 2011, pp. 521–545.
13. LeBlanc L. J. An Algorithm for the Discrete Network Design Problem. Transportation Science, 1975, pp. 183–199.
14. Poorzahedy H., and Turnquist M. A. Approximate Algorithms for the Discrete Network Design Problem. Transportation Research Part B, Vol. 16, 1982, pp. 45–55.
15. Dantzig G. B., Harvey R. P., Lansdowne Z. F., Robinson D. W., and Maier S. F. Formulating and Solving the Network Design Problem by Decomposition. Transportation Research Part B, Vol. 13, 1978, pp. 5–17.
16. Friesz T. L., Anandalingam G., Mehta N. J., Nam K., Shah S. J., and Tobin R. L. The Multi-Objective Equilibrium Network Design Problem Revisited: A Simulated Annealing Approach. European Journal of Operational Research, Vol. 65, No. 1, 1993, pp. 44–57.
17. Meng Q., Yang H., and Bell M. G. H. An Equivalent Continuously Differentiable Model and a Locally Convergent Algorithm for the Continuous Network Design Problem. Transportation Research Part B, Vol. 35, 2001, pp. 83–105.
18. Xu T., Wei H., and Wang Z. Study on Continuous Network Design Problem Using Simulated Annealing and Genetic Algorithm. Expert Systems with Applications, Vol. 36, 2009, pp. 2735–2741.
19. Cantarella G. E., Pavone G., and Vitetta A. Heuristics for Urban Road Network Design: Lane Layout and Signal Settings. European Journal of Operational Research, Vol. 175, No. 3, 2006, pp. 1682–1695.
20. Waller S. T., and Ziliaskopoulos A. K. Stochastic Dynamic Network Design Problem. In Transportation Research Record: Journal of the Transportation Research Board, No. 1771, TRB, National Research Council, Washington, D.C., 2001, pp. 106–113.
21. Chen A., Kim J., Lee S., and Kim Y. Stochastic Multi-Objective Models for Network Design Problem. Expert Systems with Applications, Vol. 37, 2010, pp. 1608–1619.
22. Ukkusuri S. V., and Patil G. Multi-Period Transportation Network Design Under Demand Uncertainty. Transportation Research Part B, 2009, pp. 625–642.
23. Sharma S., Ukkusuri S. V., and Mathew T. V. Pareto Optimal Multi-objective Optimization for Robust Transportation Network Design Problem. In Transportation Research Record: Journal of the Transportation Research Board, No. 2090, Transportation Research Board of the National Academies, Washington, D.C., 2009, pp. 95–104.
24. Brands T., van Berkum E., and van Amelsfort D. H. Optimal Toll Design in Dynamic Traffic Networks Using a Pattern Search Approximation Algorithm. Presented at 88th Annual Meeting of the Transportation Research Board, Washington, D.C., 2009.
25. Yang H., and Bell M. G. H. Models and Algorithms for Road Network Design: A Review and Some New Developments. Transport Reviews, Vol. 18, 1998, pp. 257–278.
26. Drezner Z., and Wesolowsky G. O. Network Design: Selection and Design of Links and Facility Location. Transportation Research Part A, Vol. 37, 2003, pp. 241–256.
27. Mathew T. V., and Sharma S. Continuous Network Design with Emission Pricing as a Bi-Level Optimization Problem. Proc. 9th International Conference on Applications of Advanced Technology in Transportation, Chicago, Ill., 2006.
28. Cantarella G. E., and Vitetta A. The Multi-Criteria Road Network Design Problem in an Urban Area. Transportation, Vol. 33, No. 6, 2006, pp. 567–588.
29. Yin Y., and Lawphongpanich S. Internalizing Emission Externality on Road Networks. Transportation Research Part D, Vol. 11, 2006, pp. 292–301.
30. Duthie J., and Waller S. T. Incorporating Environmental Justice Measures into Equilibrium-Based Network Design. In Transportation Research Record: Journal of the Transportation Research Board, No. 2089, Transportation Research Board of the National Academies, Washington, D.C., 2008, pp. 58–65.
31. Santos B., Antunes A., and Miller E. Multiobjective Approach to Long-Term Interurban Multilevel Road Network Planning. Journal of Transportation Engineering, Vol. 135, No. 9, 2009, pp. 640–649.
32. Sumalee A., Shepherd S. P., and May A. D. Road User Charging Design: Dealing with Multi-Objectives and Constraints. Transportation, Vol. 36, No. 2, 2009, pp. 167–186.
33. Raadsen M. P. H., Mein H. E., Schilpzand M. P., and Brandt F. Implementation of a Single Dynamic Traffic Assignment Model on Mixed Urban and Highway Transport Networks Including Junction Modeling. Presented at 3rd International Symposium on Dynamic Traffic Assignment, Takayama, Japan, 2010.
34. Artemis: Assessment and Reliability of Transport Emission Models and Inventory Systems. Road Emission Model, Model Description. Deliverable No. 13. INFRAS, Bern, Switzerland, 2007.
35. While L., Hingston P., Barone L., and Huband S. A Faster Algorithm for Calculating Hypervolume. IEEE Transactions on Evolutionary Computation, 2006, Vol. 10, No 1, pp. 29–38.
36. Grosan C., Oltean M., and Dumitrescu D. Performance Metrics for Multiobjective Optimization Evolutionary Algorithms. In Proc., Conference on Applied and Industrial Mathematics, Oradea, Romania, 2003.
37. Tan K. C., Khor E. F., and Lee T. H. Multiobjective Evolutionary Algorithms and Applications. Springer-Verlag, London, 2005.

Cite article

Cite article

Cite article

OR

Download to reference manager

If you have citation software installed, you can download article citation data to the citation manager of your choice

Share options

Share

Share this article

Share with email
EMAIL ARTICLE LINK
Share on social media

Share access to this article

Sharing links are not relevant where the article is open access and not available if you do not have a subscription.

For more information view the Sage Journals article sharing page.

Information, rights and permissions

Information

Published In

Article first published online: January 1, 2011
Issue published: January 2011

Rights and permissions

© 2011 National Academy of Sciences.
Request permissions for this article.

Authors

Affiliations

Luc J. J. Wismans
Faculty of Engineering Technology, Center for Transport Studies, University of Twente, P.O. Box 217, 7500 AE, Enschede, Netherlands.
Eric. C. Van Berkum
Faculty of Engineering Technology, Center for Transport Studies, University of Twente, P.O. Box 217, 7500 AE, Enschede, Netherlands.
Michiel C. J. Bliemer
Faculty of Civil Engineering and Geosciences, Department of Transport and Planning, Delft University of Technology, P.O. Box 5048, 2600 GA Delft, Netherlands.

Notes

Metrics and citations

Metrics

Journals metrics

This article was published in Transportation Research Record: Journal of the Transportation Research Board.

VIEW ALL JOURNAL METRICS

Article usage*

Total views and downloads: 51

*Article usage tracking started in December 2016


Altmetric

See the impact this article is making through the number of times it’s been read, and the Altmetric Score.
Learn more about the Altmetric Scores



Articles citing this one

Receive email alerts when this article is cited

Web of Science: 0

Crossref: 9

  1. Maintenance applications of multi-criteria optimization: A review
    Go to citation Crossref Google Scholar
  2. Multimodal Foraging by Honey Bees Toward Optimizing Profits at Multipl...
    Go to citation Crossref Google Scholar
  3. Dynamic traffic assignment: A review of the methodological advances fo...
    Go to citation Crossref Google Scholar
  4. The multi-objective network design problem using minimizing externalit...
    Go to citation Crossref Google Scholar
  5. Multiobjective Environmentally Sustainable Road Network Design Using P...
    Go to citation Crossref Google Scholar
  6. A review of sustainable network design for road networks
    Go to citation Crossref Google Scholar
  7. Multi-objective transportation network design: Accelerating search by ...
    Go to citation Crossref Google Scholar
  8. Acceleration of Solving the Dynamic Multi-Objective Network Design Pro...
    Go to citation Crossref Google Scholar
  9. Multi-objective optimization of traffic externalities using tolls
    Go to citation Crossref Google Scholar

Figures and tables

Figures & Media

Tables

View Options

Get access

Access options

If you have access to journal content via a personal subscription, university, library, employer or society, select from the options below:


Alternatively, view purchase options below:

Purchase 24 hour online access to view and download content.

Access journal content via a DeepDyve subscription or find out more about this option.

View options

PDF/ePub

View PDF/ePub