In this paper, a particular Vehicle Routing Problem is described realted to storage management problems for a flexible manufactuting system (FMS). It is formulated as the problem of picking a given number of different types of objects contained in a list from a set of locations where objects are stored in given quantities. This is accomplished by a set of tours traveled by a vehicle of fixed capacity starting and ending at the same given location. The goal is to minimize the total length of all tours.
Vehicle Routing Problem in Optimal Warehouse Management for Flexible Manufacturing Plants / Festa, Paola; R., Cerulli; G., Raiconi. - (1999), pp. 160-166.
Vehicle Routing Problem in Optimal Warehouse Management for Flexible Manufacturing Plants
FESTA, PAOLA;
1999
Abstract
In this paper, a particular Vehicle Routing Problem is described realted to storage management problems for a flexible manufactuting system (FMS). It is formulated as the problem of picking a given number of different types of objects contained in a list from a set of locations where objects are stored in given quantities. This is accomplished by a set of tours traveled by a vehicle of fixed capacity starting and ending at the same given location. The goal is to minimize the total length of all tours.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
