Abstracts - faqs.org

Abstracts

Petroleum, energy and mining industries

Search abstracts:
Abstracts » Petroleum, energy and mining industries

Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem

Article Abstract:

The problem of order-picking in a rectangular warehouse that contains crossovers only at the ends of aisles is addressed. An algorithm is presented for picking an order in minimum time. The computational effort required is linear in the number of aisles. The procedure has been implemented on a microcomputer. A 50-aisle problem requires only about one minute to solve. Graphs are available showing the warehouse aisle configuration, an order picking, example, and possible area configurations.

Author: Ratliff, H.D., Rosenthal, A.S.
Publisher: Operations Research Society of America
Publication Name: Operations Research
Subject: Petroleum, energy and mining industries
ISSN: 0030-364X
Year: 1983
Warehousing, Materials handling, Applications

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


An Algorithm for the Bottleneck Traveling Salesman Problem

Article Abstract:

The Traveling salesman problem is to find a circuit that minimizes the cost of any of its arcs. Lower bounds are combined to obtain a bounding procedure for the branch and bound algorithm. At each node a Heuristic search to find the arcs whose cost is lower than the current lower bound is conducted. This reduces the number of nodes explored. Results are discussed.

Author: Carpaneto, G., Martello, S., Toth, P.
Publisher: Operations Research Society of America
Publication Name: Operations Research
Subject: Petroleum, energy and mining industries
ISSN: 0030-364X
Year: 1984
Decision trees, Scientific Research, Decision Making, Theory, Heuristic Methods, Branch and Bound, Decision Tree

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


An Exact Algorithm for the Time-Constrained Traveling Salesman Problem

Article Abstract:

The time-constrained traveling salesman routing-scheduling problem is discussed. A concise formulation is given by a model. The distances in the model are assumed symmetrical and the triangle inequality holds. The problem is shown to be a disjunctive graph model. Computational results are presented in a table.

Author: Baker, E.K.
Publisher: Operations Research Society of America
Publication Name: Operations Research
Subject: Petroleum, energy and mining industries
ISSN: 0030-364X
Year: 1983
Transportation, Models, Scheduling, Routing, Delivery Routes

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Subjects list: Management science, Algorithms, Algorithm, Operations Research
Similar abstracts:
  • Abstracts: Clearing the way. Recalling fear of the atom
  • Abstracts: Up for grabs; the fight is on for control of the meter in retail markets
  • Abstracts: On the Use of Replacements to Extend System Life. Some Reliability Applications of the Variability Ordering. Inspection Policies for Fault Location
  • Abstracts: Triangular bonds. Seas of conflict. In GATT's name
  • Abstracts: Picking up the pieces of the USSR. Life on the edge. All set for a change: Turkey has to address its internal problems if it is to achieve its geopolitical goals
This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.
Some parts © 2025 Advameg, Inc.