The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
A delivery route optimization system greatly improves the real time delivery efficiency. To realize such an optimization, its distribution network requires solving several tens to hundreds (max. 1500-2000) cities Traveling Salesman Problems (TSP) within interactive response time (around 3 seconds) with expert-level accuracy (below 3% level of error rate). To meet these requirements, a Backtrack and...
In this paper we propose an underline removal method specific to Japanese business document. Automated removal of underlines is important, because underline is the main cause of OCR misrecognition. The main feature of our method is to remove various types of underlines such as touched, inclined, and blurred lines by line template matching. Moreover, our method makes it possible to remove all possible...
Building a delivery route optimization system that improves the delivery efficiency in real time requires to solve several tens to hundreds cities traveling salesman problems (TSP) within interactive response time, with expert-level accuracy (less than 3% of errors). To meet these requirements, a multi-inner-world genetic algorithm (Miw-GA) method is developed. This method combines several types of...
Building ??just in time?? distribution systems to improve the delivery efficiency requires solving at least several tens to hundred cities time-constraint Traveling Salesman Problems (TSP) within interactive response time, with practicable optimality. To meet these requirements, a Locally-Selfish-gene Tolerant Dynamic Control GA is proposed. Here, each gene of an individual satisfies only its constraints...
Building a delivery route optimization system that improves the delivery efficiency in real time requires to solve several tens to hundreds cities Traveling Salesman Problems (TSP) within interactive response time, with expert-level accuracy (less than 3% of errors). To meet these requirements, a multi-inner-world Genetic Algorithm (Miw-GA) method was developed. This method combines two types of GApsilas...
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...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.