Adaptive probabilities of crossover and mutation in genetic algorithm for solving stochastic vehicle routing problem Online publication date: Mon, 04-Jul-2016
by Rekik Ali; Gabsi Mounir; Temani Moncef
International Journal of Advanced Intelligence Paradigms (IJAIP), Vol. 8, No. 3, 2016
Abstract: The vehicle routing problem (vehicle routing problem, VRP in remainder of this paper) is a combinatorial optimisation problem and operational research. It belongs to the category of transportation problems, as the travelling salesman problem (travelling salesman problem, TSP) and the chance-constrained programming (CCP). These problems in the field of logistics, one or more vehicles must cover transportation network to deliver goods to customers or cover the roads network. Solving the problem is to determine a set of tours that minimise the best targets as the total distance travelled, the number of vehicles used, the sum of the delays of customers, i.e. this article describes a new algorithm for solving transportation problems with modified boundary conditions to minimise the uncertainty in the travel parameters, where a gain is associated with each customer and where the objective is to maximise the total gain collected and minimise the routing costs.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Advanced Intelligence Paradigms (IJAIP):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook