Tipo de artículo
Condición
Encuadernación
Más atributos
Ubicación del vendedor
Valoración de los vendedores
Publicado por LAP LAMBERT Academic Publishing, 2009
ISBN 10: 3838302982ISBN 13: 9783838302980
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Libro
Condición: New.
Publicado por LAP Lambert Academic Publishing, 2009
ISBN 10: 3838302982ISBN 13: 9783838302980
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Libro Impresión bajo demanda
Condición: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book.
Publicado por LAP Lambert Academic Publishing 2009-06, 2009
ISBN 10: 3838302982ISBN 13: 9783838302980
Librería: Chiron Media, Wallingford, Reino Unido
Libro
PF. Condición: New.
Publicado por LAP LAMBERT Academic Publishing Jun 2009, 2009
ISBN 10: 3838302982ISBN 13: 9783838302980
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Libro Impresión bajo demanda
Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This work addresses the problem of finding the minimum number of vehicles required to service weekly a set of customers subject to time windows. The specific structure of the problem requires that a full loaded vehicle serve only one customer each time it leaves the depot. As a consequence, all feasible schedules involve the same total distance traveled. The fleet is homogeneous and is located in a common depot. Vehicle capacity is finite, weekly mileage is limited, and split service is not permitted. Four heuristics are developed to obtain feasible solutions. Results are reported for 1000 randomly generated problems with up to 150 deliveries. It is shown that the new heuristics outperform the actual algorithm used by the Transportation Company in terms of computation time and the quality of solution. To gauge the quality of the solutions, three lower bounding procedures are developed. The first considers the 'bin packing aspect of the problem' with regard to the maximum weekly mileage. The second exploits the time windows constraints while the third lowerbounding method uses a network flow formulation. 48 pp. Englisch.
Publicado por LAP LAMBERT Academic Publishing, 2009
ISBN 10: 3838302982ISBN 13: 9783838302980
Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
Libro Impresión bajo demanda
PAP. Condición: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Publicado por LAP LAMBERT Academic Publishing, 2009
ISBN 10: 3838302982ISBN 13: 9783838302980
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Libro Impresión bajo demanda
Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - This work addresses the problem of finding the minimum number of vehicles required to service weekly a set of customers subject to time windows. The specific structure of the problem requires that a full loaded vehicle serve only one customer each time it leaves the depot. As a consequence, all feasible schedules involve the same total distance traveled. The fleet is homogeneous and is located in a common depot. Vehicle capacity is finite, weekly mileage is limited, and split service is not permitted. Four heuristics are developed to obtain feasible solutions. Results are reported for 1000 randomly generated problems with up to 150 deliveries. It is shown that the new heuristics outperform the actual algorithm used by the Transportation Company in terms of computation time and the quality of solution. To gauge the quality of the solutions, three lower bounding procedures are developed. The first considers the 'bin packing aspect of the problem' with regard to the maximum weekly mileage. The second exploits the time windows constraints while the third lowerbounding method uses a network flow formulation.
Publicado por LAP LAMBERT Academic Publishing, 2009
ISBN 10: 3838302982ISBN 13: 9783838302980
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
Libro Impresión bajo demanda
PAP. Condición: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Publicado por LAP Lambert Academic Publishing, 2009
ISBN 10: 3838302982ISBN 13: 9783838302980
Librería: moluna, Greven, Alemania
Libro Impresión bajo demanda
Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This work addresses the problem of finding the minimum number of vehicles required to service weekly a set of customers subject to time windows. The specific structure of the problem requires that a full loaded vehicle serve only one customer each time it l.
Publicado por LAP LAMBERT Academic Publishing, 2009
ISBN 10: 3838302982ISBN 13: 9783838302980
Librería: Mispah books, Redhill, SURRE, Reino Unido
Libro
paperback. Condición: Like New. Like New. book.