Ιδρυματικό Αποθετήριο [SANDBOX]
Πολυτεχνείο Κρήτης
EN  |  EL

Αναζήτηση

Πλοήγηση

Ο Χώρος μου

Minimizing the fuel consumption of a multiobjective vehicle routing problem using the parallel multi-start NSGA II algorithm

Psychas Iraklis-Dimitrios, Marinaki Magdalini, Marinakis Ioannis, Mygdalas Athanasios

Απλή Εγγραφή


URIhttp://purl.tuc.gr/dl/dias/102A0529-F3F8-4F93-BB9A-781E89D72608-
Αναγνωριστικόhttps://link.springer.com/chapter/10.1007%2F978-3-319-29608-1_5-
Αναγνωριστικόhttps://doi.org/10.1007/978-3-319-29608-1_5-
Γλώσσαen-
Μέγεθος20 pagesen
ΤίτλοςMinimizing the fuel consumption of a multiobjective vehicle routing problem using the parallel multi-start NSGA II algorithmen
ΔημιουργόςPsychas Iraklis-Dimitriosen
ΔημιουργόςΨυχας Ηρακλης-Δημητριοςel
ΔημιουργόςMarinaki Magdalinien
ΔημιουργόςΜαρινακη Μαγδαληνηel
ΔημιουργόςMarinakis Ioannisen
ΔημιουργόςΜαρινακης Ιωαννηςel
ΔημιουργόςMygdalas Athanasiosen
ΔημιουργόςΜυγδαλας Αθανασιοςel
ΕκδότηςSpringer New York LLCen
ΠερίληψηIn this paper, a new multiobjective formulation of the Vehicle Routing Problem, the Multiobjective Fuel Consumption Vehicle Routing Problem (MFCVRP), using two different objective functions is presented. The first objective function corresponds to the optimization of the total travel time and the second objective function is the minimization of the fuel consumption of the vehicle taking into account the travel distance, the load of the vehicle, and other route parameters. We solve two cases of the Multiobjective Fuel Consumption Vehicle Routing Problem. In the first case the problem is symmetric and in the second case the problem is asymmetric. The problem is solved with the Parallel Multi-Start NSGA II that uses more than one initial population of individuals and a Variable Neighborhood Search algorithm for the improvement of each produced solution. The instances that are used for the solution of the problem are modified instances based on the classic Euclidean Traveling Salesman Problem benchmark instances taken from the TSP library.en
ΤύποςΠλήρης Δημοσίευση σε Συνέδριοel
ΤύποςConference Full Paperen
Άδεια Χρήσηςhttp://creativecommons.org/licenses/by/4.0/en
Ημερομηνία2018-11-13-
Ημερομηνία Δημοσίευσης2016-
Θεματική ΚατηγορίαGRASPen
Θεματική ΚατηγορίαMultiobjective fuel consumption vehicle routing problemen
Θεματική ΚατηγορίαParallel Multi-Start NSGA IIen
Θεματική ΚατηγορίαVNSen
Βιβλιογραφική ΑναφοράI.-D. Psychas, M. Marinaki, Y. Marinakis and A. Migdalas, "Minimizing the fuel consumption of a multiobjective vehicle routing problem using the parallel multi-start NSGA II algorithm," in 4th International Conference on Network Analysis, 2016, pp. 69-88. doi: 10.1007/978-3-319-29608-1_5en

Υπηρεσίες

Στατιστικά