An Approximate Solution Method for a Combinatorial Discrete Optimization Problem Involved Interference and Its Application to a Physical Distribution System

Abstract

This paper discusses an effective method for solving a combinatorial discrete optimization problems and considers a physical distribution problem, which consists of an assignment problem and a routing problem of automated guided vehicles, as one of the conbinatorial discrete optimization problems. Namely, when requests for traveling occur, the proposed method assigns them to available vehicles and determines a route for each of the vehicles without interference with realtime. The algorithm used to solve this problem utilizes knowledge processing which consists of a logic programming and a constraint processing, because this problem is regarded as a constraint satisfaction problem. The constraint processing is used to avoid the interference among vehicles which is an important element in an effective physical distribution. Finally, the capability of the proposed method is shown by discrete-event simulation results for a closed-loop traveling model.