| dc.description.abstract | With the definite need for logistic management to fulfill orders more effectively in time
critical delivery than ever before, the use of vehicle routing problem with time windows
(VRPTW) is applied to schedule multi-arcs routes with minimum total cost while satisfying
customer demand requirements within their time bounds. In this paper, the case study TP
Link Technology Vietnam Company is investigated and resolved handling routes
scheduling problem by applying VRPTW algorithms: exact method Mixed Integer
Programming and metaheuristic method 2 phases Genetic Algorithm. The exact approach
used CPLEX as a programming tool which resulted in the global search for medium-sized
customer groups. Metaheuristic method, on the other hand, one-dimensional array Genetic
Algorithm is implemented by MATLAB for local search with large customer groups. In
addition, a sensitivity analysis was conducted based on the experimental design concept to
select the Genetic Algorithm parameter configuration. The numerical implications from the
alternatives’ results are compared and evaluated with the current operation to propose a final
approach that does not enhance truck capacity and maintain customer satisfaction with the
least spending. | en_US |
