An efficient algorithm for facility location in the presence of forbidden regions

Article Abstract:

A novel algorithm is proposed for solving the classical Weber problem which involves the location of a new facility in the presence of convex polygonal forbidden regions. The algorithm relies on an iterative procedure to solve a series of unconstrained problems with the solution terminating at a local optimum to the original constrained problem. It is also less time consuming than other solutions used in solving the Weber problem.

Algorithms

---

Dynamic capacitated user-optimal departure time/route choice problem with time-window

Article Abstract:

A discrete-time predictive dynamic user-optimal departure time/route problem is devised and solved using a previously formulated nested diagonalization method.

Usage, Lagrange equations

---

A hybrid genetic algorithm for the container loading problem

Article Abstract:

Research is presented describing the development of a stowage planning strategy where containers of differing sizes are placed within a specified area.

Transportation, Storage, Freight, Containers

Similar abstracts:

• Abstracts: An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem. A set packing model for the ground holding problem in congested networks
• Abstracts: Lot-sizing algorithm for a coordinated multi-item, multi-source distribution problem. Coordinated stocking, clearance sales, and return policies for a supply chain
• Abstracts: The Role of Weights and Scales in the Application of Multiobjective Decision Making. Premediation analysis of the energy taxation dispute in Finland
• Abstracts: A total stand WIP estimation method for wafter fabrication. Partially adaptive robust estimation of regression models and applications

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