Abstract
This paper presents two heuristic algorithms for handling orders within a warehouse. It is assumed that the number of items per order will not be greater than the capacity of the order picking vehicle. The algorithms select the orders that will be picked in one tour in order to minimize the total traveled distance of the vehicle within the warehouse. Computer programs were developed for both algorithms and the optimal tours were found by using the traveling salesman algorithm. The programs were run for several problems where optimum or near-optimum solutions were obtained.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 225-233 |
| Number of pages | 9 |
| Journal | Wear |
| State | Published - 1980 |
| Externally published | Yes |
| Event | Unit and Bulk Mater Handl, Presented at Mater Handl Conf, ASME Century 2 - Emerging Technol Conf - San Francisco, CA, USA Duration: Aug 19 1980 → Aug 21 1980 |
All Science Journal Classification (ASJC) codes
- Condensed Matter Physics
- Mechanics of Materials
- Surfaces and Interfaces
- Surfaces, Coatings and Films
- Materials Chemistry