ISBN: 9783659202582 - vehicle routing with pickup and delivery: heuristic and meta-heuristic solution algorithms (5 resultados)

ISBN: 
Refinar con la Búsqueda avanzada

Filtrar la búsqueda

  • Libros (5)

a

Intervalo de precios personalizado (EUR)

a

  • Idioma: Inglés

    Editorial: LAP LAMBERT Academic Publishing, 2012

    3659202584 / 9783659202582

    • Tapa blanda

    Librería: Mispah books, Redhill, SURRE, Reino UnidoMispah books

    Vendedor de 4 estrellas
    Contactar con el vendedor

    Condición: Usado - Como Nuevo

    EUR 205,78

    Envío por EUR 29,91 
    Se envía de Reino Unido a Estados Unidos de America

    Cantidad disponible: 1 disponible

    Paperback. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

  • Idioma: Inglés

    Editorial: LAP Lambert Academic Publishing Sep 2012, 2012

    3659202584 / 9783659202582

    • Tapa blanda
    • Impresión bajo demanda

    Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, AlemaniaBuchWeltWeit Ludwig Meier e.K.

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 79,00

    Envío por EUR 23,00 
    Se envía de Alemania a Estados Unidos de America

    Cantidad disponible: 2 disponibles

    Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Solving the Vehicle Routing Problem (VRP) and its related variants is at the heart of scientific research for optimizing logistics planning. One important variant of the VRP is the Pickup and Delivery Problem (PDP). In the PDP, it is generally required to find one or more minimum cost routes to serve a number of customers, where two types of services may be performed at a customer location, pickup or a delivery. We considered two variants of the PDP, the Pickup and Delivery Problem with Time Windows (PDPTW), and the One-commodity Pickup and Delivery Problem (1-PDP). We investigated heuristic and meta-heuristic approaches for solving the selected PDP variants. Our research focuses on handling the difficult problem constraints in a simple and effective way. Two main aspects of the solution algorithm are directed to achieve this goal, the solution representation and the neighborhood moves. In general, the findings of the research indicate the success of our approach in devising simple and robust solution mechanisms that can be integrated with vehicle routing optimization tools and used in a variety of real world applications. 300 pp. Englisch.…

  • Idioma: Inglés

    Editorial: LAP LAMBERT Academic Publishing, 2012

    3659202584 / 9783659202582

    • Tapa blanda
    • Impresión bajo demanda

    Librería: moluna, Greven, Alemaniamoluna

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 64,43

    Envío por EUR 48,99 
    Se envía de Alemania a Estados Unidos de America

    Cantidad disponible: Más de 20 disponibles

    Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Hosny ManarManar I. F. Hosny, PhD: Studied Computer Science at Cardiff University, UK. Assistant Professor at the Computer Science Department, College of Computer and Information Sciences, King Saud University, Riyadh, Kingdom of Sau.…

  • Idioma: Inglés

    Editorial: LAP Lambert Academic Publishing, 2012

    3659202584 / 9783659202582

    • Tapa blanda
    • Impresión bajo demanda

    Librería: AHA-BUCH GmbH, Einbeck, AlemaniaAHA-BUCH GmbH

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 79,00

    Envío por EUR 35,00 
    Se envía de Alemania a Estados Unidos de America

    Cantidad disponible: 1 disponible

    Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Solving the Vehicle Routing Problem (VRP) and its related variants is at the heart of scientific research for optimizing logistics planning. One important variant of the VRP is the Pickup and Delivery Problem (PDP). In the PDP, it is generally required to find one or more minimum cost routes to serve a number of customers, where two types of services may be performed at a customer location, pickup or a delivery. We considered two variants of the PDP, the Pickup and Delivery Problem with Time Windows (PDPTW), and the One-commodity Pickup and Delivery Problem (1-PDP). We investigated heuristic and meta-heuristic approaches for solving the selected PDP variants. Our research focuses on handling the difficult problem constraints in a simple and effective way. Two main aspects of the solution algorithm are directed to achieve this goal, the solution representation and the neighborhood moves. In general, the findings of the research indicate the success of our approach in devising simple and robust solution mechanisms that can be integrated with vehicle routing optimization tools and used in a variety of real world applications.…

  • Idioma: Inglés

    Editorial: LAP Lambert Academic Publishing Sep 2012, 2012

    3659202584 / 9783659202582

    • Tapa blanda
    • Impresión bajo demanda

    Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemaniabuchversandmimpf2000

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 316,00

    Envío por EUR 60,00 
    Se envía de Alemania a Estados Unidos de America

    Cantidad disponible: 1 disponible

    Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Solving the Vehicle Routing Problem (VRP) and its related variants is at the heart of scientific research for optimizing logistics planning. One important variant of the VRP is the Pickup and Delivery Problem (PDP). In the PDP, it is generally required to find one or more minimum cost routes to serve a number of customers, where two types of services may be performed at a customer location, pickup or a delivery. We considered two variants of the PDP, the Pickup and Delivery Problem with Time Windows (PDPTW), and the One-commodity Pickup and Delivery Problem (1-PDP). We investigated heuristic and meta-heuristic approaches for solving the selected PDP variants. Our research focuses on handling the difficult problem constraints in a simple and effective way. Two main aspects of the solution algorithm are directed to achieve this goal, the solution representation and the neighborhood moves. In general, the findings of the research indicate the success of our approach in devising simple and robust solution mechanisms that can be integrated with vehicle routing optimization tools and used in a variety of real world applications.Books on Demand GmbH, Überseering 33, 22297 Hamburg 300 pp. Englisch.…