ACS Applied Computer Science

  • Increase font size
  • Default font size
  • Decrease font size

COMPARISON OF PARETO EFFICIENCY AND WEIGHTED OBJECTIVES METHOD TO SOLVE THE MULTI-CRITERIA VEHICLE ROUTING PROBLEM USING THE ARTIFICIAL IMMUNE SYSTEM

Print
The solutions to the multi-criteria vehicle routing problem, dependent on route length and travelling time of delivery van, are presented in the paper. This type of problem is known as a traveling salesman problem. The artificial immune system is used to solve it in this article. Since there are two variables – route length and travelling time - two methods are employed. They are: Weighted Objectives Method and Pareto Efficiency Method. The results of calculation are compared.
  • APA 6th style
Mrówczyńska, B. (2016). Comparison of Pareto Efficiency and Weighted Objectives Method to solve the multi-criteria vehicle routing problem using the artificial immune system. Applied Computer Science, 12(4), 78-87. 
  • Chicago style
Mrówczyńska, Bogna. "Comparison of Pareto Efficiency and Weighted Objectives Method to Solve the Multi-Criteria Vehicle Routing Problem Using the Artificial Immune System." Applied Computer Science 12, no. 4 (2016): 78-87.
  • IEEE style
B. Mrówczyńska, "Comparison of Pareto Efficiency and Weighted Objectives Method to solve the multi-criteria vehicle routing problem using the artificial immune system," Applied Computer Science, vol. 12, no. 4, pp. 78-87, 2016.
  • Vancouver style
Mrówczyńska B. Comparison of Pareto Efficiency and Weighted Objectives Method to solve the multi-criteria vehicle routing problem using the artificial immune system. Applied Computer Science. 2016;12(4):78-87.
​​​​