Advanced Search
MyIDEAS: Login to save this article or follow this journal

Large-scale constrained clustering for rationalizing pickup and delivery operations

Contents:

Author Info

  • Bard, Jonathan F.
  • Jarrah, Ahmad I.
Registered author(s):

    Abstract

    The paper presents a three-phase procedure for clustering a large number of data points subject to both configuration and resource constraints. Motivated by the desire of a shipping carrier to reduce its fixed costs, the problem is to construct a set of compact work areas for regional pickup and delivery operations. In general terms, the objective is to find the minimum number of clusters (homogeneous vehicles) that satisfy volume, time and contiguity constraints. The problem is placed in context by formulating it as a mixed-integer goal program. Because practical instances contain anywhere from 6000 to 50,000 data points and can only be described in probabilistic terms, it is not possible to obtain provably optimal solutions to the proposed model. Instead, a novel solution methodology is developed that makes use of metaheuristic and mathematical programming techniques. In the preprocessing phase, a fraction of the data points are aggregated to reduce the problem size. This is shown to substantially decrease the computational burden without compromising solution quality. In the main step, an efficient adaptive search procedure is used to form the clusters. Randomness is introduced at each inner iteration to ensure a full exploration of the feasible region, and an incremental slicing scheme is used to overcome local optimality. In metaheuristic terms, these two refinements are equivalent to diversification and intensification search strategies. To improve the results, a set covering problem is solved in the final phase. The individual clusters obtained from the heuristic provide the structure for this model. To test the methodology, six data sets provided by the sponsoring company were analyzed. All runs for the first two phases took less than 4min, and in all but one case produced a tangible improvement over the current service area configurations. The set covering solution provided further improvement, which collectively averaged 11.2%.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://www.sciencedirect.com/science/article/B6V99-4V57XV3-1/2/9bd211968c0f39baf47fe6678a67e9c8
    Download Restriction: Full text for ScienceDirect subscribers only

    As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

    Bibliographic Info

    Article provided by Elsevier in its journal Transportation Research Part B: Methodological.

    Volume (Year): 43 (2009)
    Issue (Month): 5 (June)
    Pages: 542-561

    as in new window
    Handle: RePEc:eee:transb:v:43:y:2009:i:5:p:542-561

    Contact details of provider:
    Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description

    Order Information:
    Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
    Web: https://shop.elsevier.com/order?id=548&ref=548_01_ooc_1&version=01

    Related research

    Keywords: Clustering Randomized heuristic Pickup and delivery operations Set covering Case study;

    References

    References listed on IDEAS
    Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
    as in new window
    1. Koskosidis, Yiannis A. & Powell, Warren B., 1992. "Clustering algorithms for consolidation of customer orders into vehicle shipments," Transportation Research Part B: Methodological, Elsevier, vol. 26(5), pages 365-379, October.
    2. Hanif D. Sherali & J. Cole Smith, 2001. "Improving Discrete Model Representations via Symmetry Considerations," Management Science, INFORMS, vol. 47(10), pages 1396-1407, October.
    3. Bard, Jonathan F. & Purnomo, Hadi W., 2005. "Preference scheduling for nurses using column generation," European Journal of Operational Research, Elsevier, vol. 164(2), pages 510-534, July.
    4. Loiola, Eliane Maria & de Abreu, Nair Maria Maia & Boaventura-Netto, Paulo Oswaldo & Hahn, Peter & Querido, Tania, 2007. "A survey for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 176(2), pages 657-690, January.
    5. Mourgaya, M. & Vanderbeck, F., 2007. "Column generation based heuristic for tactical planning in multi-period vehicle routing," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1028-1041, December.
    6. Laporte, Gilbert & Chapleau, Suzanne & Landry, Philippe-Eric & Mercure, Hélène, 1989. "An algorithm for the design of mailbox collection routes in urban areas," Transportation Research Part B: Methodological, Elsevier, vol. 23(4), pages 271-280, August.
    7. Ouyang, Yanfeng, 2007. "Design of vehicle routing zones for large-scale distribution systems," Transportation Research Part B: Methodological, Elsevier, vol. 41(10), pages 1079-1093, December.
    8. Daganzo, Carlos F., 1984. "The length of tours in zones of different shapes," Transportation Research Part B: Methodological, Elsevier, vol. 18(2), pages 135-145, April.
    9. Chiou, Yu-Chiun & Lan, Lawrence W., 2001. "Genetic clustering algorithms," European Journal of Operational Research, Elsevier, vol. 135(2), pages 413-427, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as in new window

    Cited by:
    1. Bard, Jonathan F. & Jarrah, Ahmad I., 2013. "Integrating commercial and residential pickup and delivery networks: A case study," Omega, Elsevier, vol. 41(4), pages 706-720.
    2. Özdamar, Linet & Demir, Onur, 2012. "A hierarchical clustering and routing procedure for large scale disaster relief logistics planning," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(3), pages 591-602.

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:eee:transb:v:43:y:2009:i:5:p:542-561. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.