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

Solution methods for the taxi pooling problem


Author Info

  • Shangyao Yan


  • Chun-Ying Chen
  • Chuan-Che Wu
Registered author(s):


    No abstract is available for this item.

    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:
    Download Restriction: Access to full text is restricted to subscribers.

    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 Springer in its journal Transportation.

    Volume (Year): 39 (2012)
    Issue (Month): 3 (May)
    Pages: 723-748

    as in new window
    Handle: RePEc:kap:transp:v:39:y:2012:i:3:p:723-748

    Contact details of provider:
    Web page:

    Related research

    Keywords: Taxi pooling; Multiple origins/destinations; Mathematical programming; Multiple commodity network flow problem; Lagrangian relaxation;


    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. Cortés, Cristián E. & Matamala, Martín & Contardo, Claudio, 2010. "The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method," European Journal of Operational Research, Elsevier, vol. 200(3), pages 711-724, February.
    2. Chen, Chia-Ho & Ting, Ching-Jung, 2008. "Combining Lagrangian heuristic and Ant Colony System to solve the Single Source Capacitated Facility Location Problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 44(6), pages 1099-1122, November.
    3. Yan, Shangyao & Lai, Weishen & Chen, Maonan, 2008. "Production scheduling and truck dispatching of ready mixed concrete," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 44(1), pages 164-179, January.
    4. Diana, Marco & Dessouky, Maged M., 2004. "A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 38(6), pages 539-557, July.
    5. Yan, Shangyao & Chen, Hao-Lei, 2002. "A scheduling model and a solution algorithm for inter-city bus carriers," Transportation Research Part A: Policy and Practice, Elsevier, vol. 36(9), pages 805-825, November.
    Full references (including those not matched with items on IDEAS)



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


    Access and download statistics


    When requesting a correction, please mention this item's handle: RePEc:kap:transp:v:39:y:2012:i:3:p:723-748. 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: (Guenther Eichhorn) or (Christopher F. Baum).

    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.