Dynamic control of multicommodity fleet management problems

Article Abstract:

A new approach in solving multicommodity fleet management problems is presented. The problem involves making a fleet of vehicles meet current and future demands. The solution, which utilizes integer programming, is based on dynamic control of logistics queueing networks. It views the problem as a multicommodity network flow problem instead of a linear network. The novel approach presented is better than linear programming formulations in terms of providing integer solutions, taking into account real-world constraints and being able to handle large problems at less time.

Operations Research, Management, Motor vehicle fleets, Fleets (Automotive), Multiphase flow, Dynamic programming

---

The hub location and routing problem

Article Abstract:

The hub location and routing problem is investigated. The problem, which pertains to the demand for transportation services on different routes, was solved within a single-origin, multiple-destination framework. The solution, which was formulated in four versions, assumes that there are one-hub-stop, two-hub-stop and direct services for each route. In addition, the hubs communicate with each other, with the degree of interaction set by the two-hub-stop service routes.

Research, Transportation planning, Traffic flow

---

A comparative evaluation of modeling approaches to the labor shift scheduling problem

Article Abstract:

Modeling approaches to the labor shift scheduling problem are considered.

Similar abstracts:

• Abstracts: A dynamic approach to multiple-objective resource allocation problem. Practices of preventive maintenance and replacement for engines: a case study
• Abstracts: An approximately global optimization method for assortment problems. Dynamic programming using the Fritz-John conditions
• Abstracts: An iterative procedure for reducing problem size in large scale AHP problems. Minimizing makespan subject to minimum total flow-time on identical parallel machines

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