{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:46:36Z","timestamp":1752461196209},"reference-count":7,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2007,3,21]],"date-time":"2007-03-21T00:00:00Z","timestamp":1174435200000},"content-version":"vor","delay-in-days":7384,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Systems &amp; Computers in Japan"],"published-print":{"date-parts":[[1987,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The trial\u2010and\u2010error efforts by experts have been considered as indispensable in compiling railroad timetables. There is a strong requirement to computerize the procedure, but it has been considered difficult. It is proposed to merge the following two concepts as a means to obtain an efficient trial\u2010and\u2010error procedure, which is the basis of the compilation of railroad timetables: (1) the concept of (time) belt, where a number of alternatives for arrival and departure is handled as one alternative, considering only the order of arrivals and departures; (2) the concept of the propagation of constraints, which is well known in the artificial intelligence where alternatives in conflict to the order of arrivals and departures are eliminated. This paper discusses the scheduling problem for the partially ordered set of events. The requirement for the time difference between events is considered as a constraint. An algorithm is proposed which calculates the permissible range of time for the event generation, as a closed interval on the time axis. It is shown that the constructed algorithm can be applied as the basic algorithm for the railroad timetable compilation system, where the timetable is considered as a specification for the order of arrivals and departures of the trains, and the arrival\u2010departure time is considered as a belt. An efficient method of compilating the timetable by the proposed algorithm is presented, based on the search for the possible orders of the trains, together with the construction example of the timetable for the actual railway.<\/jats:p>","DOI":"10.1002\/scj.4690180306","type":"journal-article","created":{"date-parts":[[2007,7,7]],"date-time":"2007-07-07T13:33:30Z","timestamp":1183815210000},"page":"52-64","source":"Crossref","is-referenced-by-count":15,"title":["Fundamental algorithm for train scheduling based on artificial intelligence"],"prefix":"10.1002","volume":"18","author":[{"given":"Koji","family":"Fukumori","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroshi","family":"Sano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toshiharu","family":"Hasegawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toshiyuki","family":"Sakai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2007,3,21]]},"reference":[{"issue":"4","key":"e_1_2_1_2_2","first-page":"199","article-title":"Compilation of railroad diagram by computer","volume":"10","author":"Inada","year":"1969","journal-title":"Inf. Proc. Jap."},{"key":"e_1_2_1_3_2","unstructured":"IidaandOkawa.Railroad diagram compilation system using man\u2010machine system Tech. Rep. Res. Lab. Nat. Railways No. 951 (Feb.1975)."},{"key":"e_1_2_1_4_2","first-page":"19","volume-title":"The Psychology of Computer Vision","author":"Winston P. H.","year":"1975"},{"key":"e_1_2_1_5_2","article-title":"Fundamental Scheme for Train Scheduling","volume":"596","author":"Fukumori K.","year":"1980","journal-title":"MIT AI Memo"},{"key":"e_1_2_1_6_2","unstructured":"K.Fukumori.Basic techniques in railroad diagram compilation using computer Tech. Rep. 70th Meeting Inf. Eng. Kyoto Univ. (Apr.1981)."},{"key":"e_1_2_1_7_2","first-page":"87","volume-title":"Artificial Intelligence","author":"Winston P. H.","year":"1977"},{"key":"e_1_2_1_8_2","unstructured":"S.ArayaandK.Fukumori.ESTRAC\u2010II: An Expert System for Train Traffic Control in Disturbed Situations 6th European Conference on Artificial Intelligence (Sept.1984)."}],"container-title":["Systems and Computers in Japan"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fscj.4690180306","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/scj.4690180306","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T02:29:45Z","timestamp":1697855385000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/scj.4690180306"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,1]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1987,1]]}},"alternative-id":["10.1002\/scj.4690180306"],"URL":"https:\/\/doi.org\/10.1002\/scj.4690180306","archive":["Portico"],"relation":{},"ISSN":["0882-1666","1520-684X"],"issn-type":[{"value":"0882-1666","type":"print"},{"value":"1520-684X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,1]]}}}