Takuya Maekawa

GA Applied VRP Solving method for a Cooperative Logistics Network

A method of solving the vehicle routing problem (VRP) that can obtain a highly optimal solution to achieve steady logistics operation is required to optimize a cooperative logistics network. To satisfy this requirement, a multi-stage GA and a method of multipoint evaluation are proposed. The multi-stage GA enables us to obtain an accurate solution under various conditions. Moreover, the method of multi-point evaluation can generate a delivery schedule that enables stable logistics operation. The experimental results revealed the method we propose can obtain accurate solutions to achieve stable operation.

Long-distance transportation network planning method using selfish constraint satisfaction type GA

To build a cooperative logistics network covering multiple enterprises, a planning method that can build a long-distance transportation network is required. Many strict constraints are imposed on this type of problem. To solve these strict-constraint problems, a selfish-constraint-satisfaction type genetic algorithm (GA) is proposed. Moreover, a constraint pre-checking method is also applied. Our experimental result shows that the proposed method can obtain an accurate solution in a practical response time.