A103 (1997) 18-27 in heavily congested cities

Article Abstract:

A minimum cost network flow model is employed to solve the problem of bus trip scheduling in overcrowded cities, particularly Bangkok. It has been found that the proposed network model can also be applied in more complex situations and can also be a useful tool in many other environments and in less congested urban regions. However, the modelling technique is not capable of easily estimating customer demand, as in Bangkok, where commuters have no other choice of transportation.

Traffic & Transportation Mgmt, Transportation, Commuting, Traffic estimation, Bangkok, Thailand (City)

---

A branch and bound algorithm for the traveling purchaser problem

Article Abstract:

A branch and bound algorithm was developed for the traveling purchaser problem (TPP) for solving simple plant location. The bounds in the branch and bound algorithm were determined by solving a related simple plant location problem at each node. The algorithm considerably extended the size of the TPP that can be solved optimally. Furthermore, the TPP algorithm can be utilized to solve network design problems such as job scheduling and warehousing.

Operations Research, Heuristic, Heuristics (Psychology)

---

An efficient simplex type algorithm for sparse and dense linear programs

Article Abstract:

Big-M method for solving general linear programming problems, based on exterior point simplex algorithm, is discussed. Numerical experiments used to evaluate this algorithm are described.

Greece, Evaluation, Algorithm

Similar abstracts:

• Abstracts: Heuristics and exact algorithms for solving the Monden problem. Exact and heuristic algorithms for data sets reconstruction
• Abstracts: A genetic algorithm for multi-mode resource constrained project scheduling problem
• Abstracts: Maximizing a concave function over the efficient or weakly-efficient set. A polynomial-time algorithm for message routing in hierarchical communication networks

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