Locomotive assignment is a classic planning problem in railway industry. Different models and algorithms (e.g., network flow model, MIP model, adaptive dynamic programming) are proposed to solve this problem and have got remarkable progress. In practice, the locomotives are usually in the size of hundreds to even more than a thousand. So assigning individual locomotives to trains on railway net...

The Japanese Orthopaedic Association has proposed the term locomotive syndrome to designate a condition of individuals in high-risk groups with musculoskeletal disease who are highly likely to require nursing care. This study investigates the influence of spinal factors on locomotive syndrome in Japanese men. A total of 105 men older than 50 years were enrolled in the study. Those answering yes...

Life-like animated interface agents for knowledgebased learning environments can provide timely, customized advice to support students' problem solving. Because of their strong visual presence, they hold signi cant promise for substantially increasing students' enjoyment of their learning experiences. A key problem posed by life-like agents that inhabit arti cial worlds is deictic believability...

Generally, the inventory routing problem occurs in a supply chain where customers consider the supplier responsible for inventory replenishment. In this situation, the supplier finds the answer to questions regarding the time and quantity of delivery to the customer as well as the sequence of customers in the routes. Considering the effect of production decisions on answering these questions, t...

in this paper, we study the multi-depot vehiclerouting problem with inter-depot routes, in which the vehicles can replenish atintermediate depots. vehicles leave the origin depot with load on-board andserve customers until out of load. they may visit an intermediate depot toreplenish and finally return to the origin depot, completing their route. weinitiate a mathematical mixed integer programm...

0

In this research it was considered the particular case of a railway problem, specifically, the construction of orders delivery schedule for one locomotive plying among three railway stations. In this paper it was suggested a polynomial algorithm and were shown the results of a computing experiment.