The rural postman problem with deadline classes

Article Abstract:

Dual cutting-plane method solves each Rural Postman Problem with Deadline Classes problems within a few minutes. The method works by formulating RPPDC problems into integer programme by first solving it as an ordinary Rural Postman Problem to identify violated inequalities and then adding the inequalities to the Linear Programme as cutting planes. The process continues until no more inequalities are found and then a branch-and-bound is employed to solve for the final LP relaxation.

Operations Research, Research, Scheduling (Management), Delivery of goods, Deliveries (Transportation)

---

Developing railway timetables which guarantee a better service

Article Abstract:

Linear programming and buffer times are used to develop a useful railway timetable.

Belgium, Analysis, Time management

---

Similar abstracts:

• Abstracts: So long, stomach problems! Ease irritable bowel syndrome. The tiring side effects of stress
• Abstracts: Redundancy optimization problems with uncertainty of combining randomness and fuzziness. The development of genetic algorithms for the finite capacity scheduling of complex products, with multiple levels of product structure
• Abstracts: Conflicts of interest and market discipline among financial service firms. Proactive thinking
• Abstracts: Repairable inventory theory: models and applications. Target setting for the departments in an aircraft repairable item system
• Abstracts: Capability indices for material balancing accounting. Neural network approach to forecasting of quasiperiodic financial time series

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.