By Topic

A method for solving nested combinatorial optimization problems - a case of optimizing a large-scale distribution network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Onoyama, T. ; Dept. of Res. & Dev., Hitachi Software Eng. Co. Ltd., Yokohama, Japan ; Kubota, S. ; Oyanagi, K. ; Tsuruta, S.

The optimization of a large-scale distribution network is considered to be a nested combinatorial problem consisting of the following steps: (1) the decision about part delivery volume per part manufacturer; (2) the decision about depots and trucks for the transportation of parts; and (3) the generation of delivery routes for each truck. In such a nested combinatorial problem, a high-level and mathematically strict optimization is desirable as the first step. In addition, at each step, human multi-sided inspection is desired, which requires interactive simulation. Thus, for the first step, a method using linear programming (LP) is proposed. For the second and third steps, a method using a genetic algorithm (GA) is proposed. The latter guarantees interactive responsiveness and realizes expert-level accuracy, through enabling the solution of 1000 mid-scale traveling salesman problems (TSPs) for a distribution network within 30 seconds and within a 3% error. Experimental results proved that the proposed method enables the optimization of a nationwide large-scale distribution network

Published in:

Systems, Man, and Cybernetics, 2000 IEEE International Conference on  (Volume:1 )

Date of Conference:

2000