A parallel multi-start NSGA II algorithm for multiobjective energy reduction vehicle routing problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 9018, Issue , 2015, Pages 336-350

  Psychas, Iraklis Dimitrios ^a   Marinaki, Magdalene ^a   Marinakis, Yannis ^a  

^a TECHNICAL UNIVERSITY OF CRETE   (Greece)

Author keywords

GRASP; Multiobjective energy reduction vehicle routing problem; NSGA II; VNS

Indexed keywords

ALGORITHMS; BENCHMARKING; EVOLUTIONARY ALGORITHMS; MULTIOBJECTIVE OPTIMIZATION; NETWORK ROUTING; OPTIMIZATION; ROUTING ALGORITHMS; VEHICLE ROUTING; VEHICLES;

ENERGY REDUCTION; GRASP; NSGA-II; OBJECTIVE FUNCTIONS; SIMULTANEOUS OPTIMIZATION; VARIABLE NEIGHBORHOOD SEARCH; VEHICLE ROUTING PROBLEMS; VNS;

TRAVELING SALESMAN PROBLEM;

EID: 84925325133     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-15934-8_23     Document Type: Conference Paper

References (22)

1. Chand, P., Mohanty, J.R.: Multi objective genetic approach for solving vehicle routing problem. International Journal of Computer Theory and Engineering 5(6), 846–849 (2013)
2. Christofides, N., Mingozzi, A., Toth, P.: The vehicle routing problem. In: Christofides, N., Mingozzi, A., Toth, P., Sandi, C. (Eds.) Combinatorial Optimization. Wiley, Chichester (1979)
3. Coello Coello, C.A., Van Veldhuizen, D.A., Lamont, G.B.: Evolutionary Algorithms for Solving Multi-Objective Problems. Springer (2007)
4. Deb, K., Agrawal, S., Pratap, A., Meyarivan, T.: A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. In: Deb, K., Rudolph, G., Lutton, E., Merelo, J.J., Schoenauer, M., Schwefel, H.-P., Yao, X. (eds.) PPSN 2000. LNCS, vol. 1917, pp. 849–858. Springer, Heidelberg (2000)
5. Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist Multiobjective Genetic Algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation 6(2), 182–197 (2002)
6. Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedure. Journal of Global Optimization 6, 109–133 (1995)
7. Gutin, G., Punnen, A.P.: The Traveling Salesman Problem and its Variations. Kluwer Academic Publishers, Dordrecht (2002)
8. Hansen, P., Mladenovic, N.: Variable neighborhood search: Principles and applications. European Journal of Operational Research 130, 449–467 (2001)
9. Huayu, X., Wenhui, F., Tian, W., Lijun, Y.: An Or-opt NSGA-II algorithm for multi-objective vehicle routing problem with time windows. In: 4th IEEE Conference on Automation Science and Engineering, 309–314 (2008)
10. Jemai, J., Zekri, M., Mellouli, K.: An NSGA-II Algorithm for the Green Vehicle Routing Problem. In: Hao, J.-K., Middendorf, M. (eds.) EvoCOP 2012. LNCS, vol. 7245, pp. 37–48. Springer, Heidelberg (2012)
11. Johnson, D.S., Papadimitriou, C.H.: Computational complexity. In: Lawer, E.L., Lenstra, J.K., Rinnoy Kan, A.H.D., Shmoys, D.B., (Eds.) The traveling salesman problem: a guided tour of combinatorial optimization. Wiley and Sons, 37–85 (1985)
12. Jozefowiez, N., Semet, F., Talbi, E.-G.: Enhancements of NSGA II and Its Application to the Vehicle Routing Problem with Route Balancing. In: Talbi, E.-G., Liardet, P., Collet, P., Lutton, E., Schoenauer, M. (eds.) EA 2005. LNCS, vol. 3871, pp. 131–142. Springer, Heidelberg (2006)
13. Jozefowiez, N., Semet, F., Talbi, E.G.: Multi-objective vehicle routing problems. European Journal of Operational Research 189, 293–309 (2008)
14. Laporte, G.: The vehicle routing problem: An overview of exact and approximate algorithms. European Journal of Operational Research 59, 345–358 (1992)
15. Lawer, E.L., Lenstra, J.K., Rinnoy Kan, A.H.G.R., Shmoys, D.B.: The Traveling Salesman Problem: a guided tour of combinatorial optimization. Wiley and Sons (1985)
16. Lichtblau, D.: Discrete optimization using Mathematica. In: Callaos, N., Ebisuzaki, T., Starr, B., Abe, J.M., Lichtblau, D. (Eds.) World multi-conference on systemics, cybernetics and informatics (SCI 2002), International Institute of Informatics and Systemics, 16, 169–174 (2002)
17. Lin, S.: Computer solutions of the traveling salesman problem. Bell Systems Technical Journal 44(10), 2245–2269 (1965)
18. Ombuki, B., Ross, B.J., Hanshar, F.: Multi-objective genetic algorithms for vehicle routing problem with time windows. Applied Intelligence 24, 17–30 (2006)
19. Sarker, R., Coello Coello, C.A.: Assessment methodologies for multiobjective evolutionary algorithms. Evolutionary Optimization, International Series in Operations Research and Management Science 48, 177–195 (2002)
20. Toth, P., Vigo, D.: The Vehicle Routing Problem. Monographs on Discrete Mathematics and Applications, Siam (2002)
21. Xiao, Y., Zhao, Q., Kaku, I., Xu, Y.: Development of a fuel consumption optimization model for the capacitated vehicle routing problem. Computers and Operations Research 39(7), 1419–1431 (2012)
22. Zitzler, E., Deb, K., Thiele, L.: Comparison of multiobjective evolutionary algorithms: Empirical results. Evolutionary Computation 8(2), 173–195 (2000)