TY  - JOUR
T1  - Mathematic Model and an Improved Evolutionary Algorithm for Bi-Objective Vehicle Routing Problem with Dynamic Requests
AU - Elhassania, Messaoud AU - Alaoui Ahmed, Elhilali 
JO  - Journal of Engineering and Applied Sciences
VL  - 11
IS  - 12
SP  - 2740
EP  - 2749
PY  - 2016
DA  - 2001/08/19
SN  - 1816-949x
DO  - jeasci.2016.2740.2749
UR  - https://makhillpublications.co/view-article.php?doi=jeasci.2016.2740.2749
KW  - Vehicle routing problem
KW  -dynamic requests
KW  -bi-objective optimization
KW  -mathematic model
KW  -improved evolutionary algorithm
AB  - The Vehicle Routing Problem (VRP) can be described as the problem of designing optimal delivery
or collection routes from one or several depots to a number of geographically scattered cities or customers,
subject to side constraints. The dynamic case of this problem where the information is not completely known
in advance has not received enough consideration. In our research, we consider this case which new requests
are received along the day. Hence, they must be serviced at their locations by a set of vehicles in real time
minimizing two objectives simultaneously: the total travel distance and the response time of customers. The
main goal of this research is to propose a mathematic model and to find a solution for our problem using an
improved evolutionary algorithm. The experimental results show that the proposed approach proved to be
successful on a variety of benchmark instances in terms of solution quality.
ER  -