| dc.description.abstract | The speedy development of e-commerce has promoted the following demand of pickup and delivery
activities not only at quantitative aspect but also at qualitative one. Although G is one of the biggest
transportation, cash-on-delivery, and e-Logistics companies in Vietnam with revenue of 70 billion
VND in 2018, 99% coverage nationwide and staff size of more than 17,000 people, it meets a lot of
difficulties and obstacles in building the company's effective network to obtain particular success in
domestic logistics area. Due to the fact that manual activities in contribution of the operations
accounts for the majority, it is complicated for managing the costs as well as the processes.
In order to handle the trouble, this thesis directs to find the optimal routes for trucks in transiting
order between regions in the South East area with each warehouse’s pickup quantity known and time
interval of incoming truck at each warehouse clarifies. This problem will focus on the first part of
dismemberment network, which aims at designing optimal routes for each vehicle to transport goods
from province to other provinces within time windows in relation to adapt committed delivery
service.
By defining and constructing the problem as numerical method, it is more efficient when a suitable
solving approach is selected. The solution derived by using Genetic Algorithm compared to the
practical case that can bring more advantages to the company in both economic, social, and
environmental aspect. | en_US |
