The pickup and delivery problem with cross-docking opportunity

Hanne Løhmann Petersen, Stefan Røpke

    Research output: Contribution to journalConference articleResearchpeer-review

    Abstract

    In this paper, we consider the pickup and delivery problem with cross-docking opportunity (PDPCD). The problem arises from an industry application, and includes pickup requests, delivery requests, and pickup-and-delivery requests. Each pickup-and-delivery request can be served either as direct delivery by one truck, or by being picked up and transported to the cross-dock by one vehicle, and subsequently delivered at its final destination by another vehicle. Handling times at customers sites and terminal are given. A typical daily instance includes 500-1,000 requests. We solve the problem using a Large Neighborhood Search (LNS) approach. © 2011 Springer-Verlag.
    Original languageEnglish
    Book seriesLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume6971
    Pages (from-to)101-113
    ISSN0302-9743
    DOIs
    Publication statusPublished - 2011
    Event2nd International Conference on Computational Logistics - Hamburg, Germany
    Duration: 19 Sep 201122 Sep 2011
    Conference number: 2

    Conference

    Conference2nd International Conference on Computational Logistics
    Number2
    CountryGermany
    CityHamburg
    Period19/09/201122/09/2011

    Fingerprint Dive into the research topics of 'The pickup and delivery problem with cross-docking opportunity'. Together they form a unique fingerprint.

    Cite this