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

A General Vehicle Routing Problem

Contents:

Author Info

  • Goel, Asvin
  • Gruhn, Volker
Registered author(s):

    Abstract

    In this paper, we study a rich vehicle routing problem incorporating various complexities found in real-life applications. The General Vehicle Routing Problem (GVRP) is a combined load acceptance and generalised vehicle routing problem. Among the real-life requirements are time window restrictions, a heterogeneous vehicle fleet with different travel times, travel costs and capacity, multi-dimensional capacity constraints, order/vehicle compatibility constraints, orders with multiple pickup, delivery and service locations, different start and end locations for vehicles, and route restrictions for vehicles. The GVRP is highly constrained and the search space is likely to contain many solutions such that it is impossible to go from one solution to another using a single neighbourhood structure. Therefore, we propose iterative improvement approaches based on the idea of changing the neighbourhood structure during the search.

    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/B6VCT-4N2KTC4-2/1/291a7305704d9b7db8160c4a42505220
    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 European Journal of Operational Research.

    Volume (Year): 191 (2008)
    Issue (Month): 3 (December)
    Pages: 650-660

    as in new window
    Handle: RePEc:eee:ejores:v:191:y:2008:i:3:p:650-660

    Contact details of provider:
    Web page: http://www.elsevier.com/locate/eor

    Related research

    Keywords:

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

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

    Cited by:
    1. Pillac, Victor & Gendreau, Michel & Guéret, Christelle & Medaglia, Andrés L., 2013. "A review of dynamic vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 225(1), pages 1-11.
    2. Michael Brusco & Renu Singh & Douglas Steinley, 2009. "Variable Neighborhood Search Heuristics for Selecting a Subset of Variables in Principal Component Analysis," Psychometrika, Springer, vol. 74(4), pages 705-726, December.
    3. Xu, Liang & Xu, Zhou & Xu, Dongsheng, 2013. "Exact and approximation algorithms for the min–max k-traveling salesmen problem on a tree," European Journal of Operational Research, Elsevier, vol. 227(2), pages 284-292.
    4. Zhang, Ruiyou & Lu, Jye-Chyi & Wang, Dingwei, 2014. "Container drayage problem with flexible orders and its near real-time solution strategies," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 61(C), pages 235-251.
    5. Goel, Asvin & Meisel, Frank, 2013. "Workforce routing and scheduling for electricity network maintenance with downtime minimization," European Journal of Operational Research, Elsevier, vol. 231(1), pages 210-228.

    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:ejores:v:191:y:2008:i:3:p:650-660. 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.