Please use this identifier to cite or link to this item:
Title: Résolution du problème de tournées de véhicules avec contrainte du temps par l’algorithme Big Bang-Big Crunch
Other Titles: informatique
Authors: khelfa, amani
Issue Date: 20-Jun-2019
Abstract: The objective of this thesis is the resolution of VRP vehicle touring problems using metaheuristics. We are interested in a variant of the VRP, namely the problem VRPTW (Vehicle Routing Problem with Time Windows). This problem was treated using a metaheuristics called the Big Bung-Big Crunch algorithm a new optimization method that is based on one of the theories of the evolution of the universe namely the Big Bang and Big Crunch theory. This algorithm has been improved by the use of two heuristic improvement methods or operators, namely the 2-opt method and the 1-1 exchange method. Keywords: Vehicle routing problem, Time Windows, Big Bung-Big Crunch algorithm, Local Search, Heuristic improvement operator, 2-opt method, 1-1 exchange method.
Appears in Collections:Faculté des Sciences Exactes et des Sciences de la Nature et de la Vie (FSESNV)

Files in This Item:
File Description SizeFormat 
khelfa_amani.pdf822,7 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.