| dc.description.abstract | Considering the fact that many businesses are seeking for ways to manage their supply
chain with strong delivery, this study addresses the integrated location-routing problem
with time window whose expected outcome is an effective assignment and routing plan
of delivering goods from depots to customers using a fleet of homogeneous vehicles.
For each customer, a soft time window and hard time window is attached, which is
associated with the penalty of violation. Thus, the objective is to suggest an optimal plan
in terms of depots, vehicles, and route to minimize the total cost including operational
cost, vehicle cost, transportation cost, and penalties while still pursuing customer
satisfaction. To achieve this, two potential methods are analyzed, consisting of a
mathematical model solved by CPLEX and a hybrid algorithm of Firefly Optimization
and Ant Colony Optimization (FO-ACO). Also, this study develops an interface
possessing the work of FO-ACO to facilitate the application of FO-ACO. After a
comprehensive analysis, the study recommends CPLEX for small problem size and FO ACO for larger size. Furthermore, a sensitivity analysis is conducted to determine the
combination of parameters that brings out the best performance of FO-ACO | en_US |
