[go: up one dir, main page]
IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v122y2000i2p310-328.html
   My bibliography  Save this article

A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles

Author

Listed:
  • Irnich, Stefan
Abstract
No abstract is available for this item.

Suggested Citation

  • Irnich, Stefan, 2000. "A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles," European Journal of Operational Research, Elsevier, vol. 122(2), pages 310-328, April.
    • Handle: RePEc:eee:ejores:v:122:y:2000:i:2:p:310-328
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(99)00235-0
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Cynthia Barnhart & Rina R. Schneur, 1996. "Air Network Design for Express Shipment Service," Operations Research, INFORMS, vol. 44(6), pages 852-863, December.
    2. Dumas, Yvan & Desrosiers, Jacques & Soumis, Francois, 1991. "The pickup and delivery problem with time windows," European Journal of Operational Research, Elsevier, vol. 54(1), pages 7-22, September.
    3. Martin Savelsbergh, 1997. "A Branch-and-Price Algorithm for the Generalized Assignment Problem," Operations Research, INFORMS, vol. 45(6), pages 831-841, December.
    4. Celso C. Ribeiro & François Soumis, 1994. "A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem," Operations Research, INFORMS, vol. 42(1), pages 41-52, February.
    5. Cynthia Barnhart & Ellis L. Johnson & George L. Nemhauser & Martin W. P. Savelsbergh & Pamela H. Vance, 1998. "Branch-and-Price: Column Generation for Solving Huge Integer Programs," Operations Research, INFORMS, vol. 46(3), pages 316-329, June.
    6. Martin Savelsbergh & Marc Sol, 1998. "Drive: Dynamic Routing of Independent Vehicles," Operations Research, INFORMS, vol. 46(4), pages 474-490, August.
    7. Haddadi, Salim, 1997. "Simple Lagrangian heuristic for the set covering problem," European Journal of Operational Research, Elsevier, vol. 97(1), pages 200-204, February.
    8. Beasley, J. E. & Chu, P. C., 1996. "A genetic algorithm for the set covering problem," European Journal of Operational Research, Elsevier, vol. 94(2), pages 392-404, October.
    9. Julien Bramel & David Simchi-Levi, 1997. "On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows," Operations Research, INFORMS, vol. 45(2), pages 295-301, April.
    10. Beasley, J. E. & Jornsten, K., 1992. "Enhancing an algorithm for set covering problems," European Journal of Operational Research, Elsevier, vol. 58(2), pages 293-300, April.
    11. M. W. P. Savelsbergh & M. Sol, 1995. "The General Pickup and Delivery Problem," Transportation Science, INFORMS, vol. 29(1), pages 17-29, February.
    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


    Cited by:

    1. le Blanc, H.M. & Cruijssen, F. & Fleuren, H.A. & de Koster, M.B.M., 2006. "Factory gate pricing: An analysis of the Dutch retail distribution," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1950-1967, November.
    2. Leonard Heilig & Eduardo Lalla-Ruiz & Stefan Voß, 2017. "port-IO: an integrative mobile cloud platform for real-time inter-terminal truck routing optimization," Flexible Services and Manufacturing Journal, Springer, vol. 29(3), pages 504-534, December.
    3. Y H Lee & J I Kim & K H Kang & K H Kim, 2008. "A heuristic for vehicle fleet mix problem using tabu search and set partitioning," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(6), pages 833-841, June.
    4. Vidal, Thibaut & Crainic, Teodor Gabriel & Gendreau, Michel & Prins, Christian, 2014. "Implicit depot assignments and rotations in vehicle routing heuristics," European Journal of Operational Research, Elsevier, vol. 237(1), pages 15-28.
    5. Koç, Çağrı & Bektaş, Tolga & Jabali, Ola & Laporte, Gilbert, 2016. "Thirty years of heterogeneous vehicle routing," European Journal of Operational Research, Elsevier, vol. 249(1), pages 1-21.
    6. Niaz A. Wassan & A. Hameed Wassan & Gábor Nagy, 2008. "A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries," Journal of Combinatorial Optimization, Springer, vol. 15(4), pages 368-386, May.
    7. R. Tadei & G. Perboli & F. Della Croce, 2002. "A Heuristic Algorithm for the Auto-Carrier Transportation Problem," Transportation Science, INFORMS, vol. 36(1), pages 55-62, February.
    8. Selim Çetiner & Canan Sepil & Haldun Süral, 2010. "Hubbing and routing in postal delivery systems," Annals of Operations Research, Springer, vol. 181(1), pages 109-124, December.
    9. Jie Xiong & Biao Chen & Xiangnan Li & Zhengbing He & Yanyan Chen, 2020. "Demand Responsive Service-based Optimization on Flexible Routes and Departure Time of Community Shuttles," Sustainability, MDPI, vol. 12(3), pages 1-20, January.
    10. Cruijssen, F., 2006. "Horizontal cooperation in transport and logistics," Other publications TiSEM ab6dbe68-aebc-4b03-8eea-d, Tilburg University, School of Economics and Management.
    11. Margaretha Gansterer & Richard F. Hartl & Philipp E. H. Salzmann, 2018. "Exact solutions for the collaborative pickup and delivery problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 26(2), pages 357-371, June.
    12. Fatih Kocatürk & G. Yazgı Tütüncü & Said Salhi, 2021. "The multi-depot heterogeneous VRP with backhauls: formulation and a hybrid VNS with GRAMPS meta-heuristic approach," Annals of Operations Research, Springer, vol. 307(1), pages 277-302, December.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Marco E. Lübbecke & Jacques Desrosiers, 2005. "Selected Topics in Column Generation," Operations Research, INFORMS, vol. 53(6), pages 1007-1023, December.
    2. Sarac, Abdulkadir & Batta, Rajan & Rump, Christopher M., 2006. "A branch-and-price approach for operational aircraft maintenance routing," European Journal of Operational Research, Elsevier, vol. 175(3), pages 1850-1869, December.
    3. Sun, Yanshuo & Chen, Zhi-Long & Zhang, Lei, 2020. "Nonprofit peer-to-peer ridesharing optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    4. Hang Xu & Zhi-Long Chen & Srinivas Rajagopal & Sundar Arunapuram, 2003. "Solving a Practical Pickup and Delivery Problem," Transportation Science, INFORMS, vol. 37(3), pages 347-364, August.
    5. Marco E. Lübbecke & Uwe T. Zimmermann, 2003. "Engine Routing and Scheduling at Industrial In-Plant Railroads," Transportation Science, INFORMS, vol. 37(2), pages 183-197, May.
    6. Rosemary T. Berger & Collette R. Coullard & Mark S. Daskin, 2007. "Location-Routing Problems with Distance Constraints," Transportation Science, INFORMS, vol. 41(1), pages 29-43, February.
    7. Grunert, Tore & Sebastian, Hans-Jurgen, 2000. "Planning models for long-haul operations of postal and express shipment companies," European Journal of Operational Research, Elsevier, vol. 122(2), pages 289-309, April.
    8. Albert H. Schrotenboer & Evrim Ursavas & Iris F. A. Vis, 2019. "A Branch-and-Price-and-Cut Algorithm for Resource-Constrained Pickup and Delivery Problems," Transportation Science, INFORMS, vol. 53(4), pages 1001-1022, July.
    9. Vis, Iris F.A., 2006. "Survey of research in the design and control of automated guided vehicle systems," European Journal of Operational Research, Elsevier, vol. 170(3), pages 677-709, May.
    10. Stefan Ropke & Jean-François Cordeau, 2009. "Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows," Transportation Science, INFORMS, vol. 43(3), pages 267-286, August.
    11. 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.
    12. Francis, Peter & Zhang, Guangming & Smilowitz, Karen, 2007. "Improved modeling and solution methods for the multi-resource routing problem," European Journal of Operational Research, Elsevier, vol. 180(3), pages 1045-1059, August.
    13. Jansen, Benjamin & Swinkels, Pieter C. J. & Teeuwen, Geert J. A. & van Antwerpen de Fluiter, Babette & Fleuren, Hein A., 2004. "Operational planning of a large-scale multi-modal transportation system," European Journal of Operational Research, Elsevier, vol. 156(1), pages 41-53, July.
    14. Patrizia Beraldi & Andrzej Ruszczyński, 2002. "The Probabilistic Set-Covering Problem," Operations Research, INFORMS, vol. 50(6), pages 956-967, December.
    15. Le-Anh, T. & de Koster, M.B.M., 2004. "A Review Of Design And Control Of Automated Guided Vehicle Systems," ERIM Report Series Research in Management ERS;2004-030-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    16. Regnier-Coudert, Olivier & McCall, John & Ayodele, Mayowa & Anderson, Steven, 2016. "Truck and trailer scheduling in a real world, dynamic and heterogeneous context," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 93(C), pages 389-408.
    17. Le-Anh, T. & de Koster, M.B.M. & Yu, Y., 2006. "Performance Evaluation of Real-time Scheduling Approaches in Vehicle-based Internal Transport Systems," ERIM Report Series Research in Management ERS-2006-063-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    18. Sepehr Nemati & Oleg V. Shylo & Oleg A. Prokopyev & Andrew J. Schaefer, 2016. "The Surgical Patient Routing Problem: A Central Planner Approach," INFORMS Journal on Computing, INFORMS, vol. 28(4), pages 657-673, November.
    19. Schaumann, Sarah K. & Bergmann, Felix M. & Wagner, Stephan M. & Winkenbach, Matthias, 2023. "Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics," European Journal of Operational Research, Elsevier, vol. 311(1), pages 88-111.
    20. Jans, Raf, 2010. "Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems," European Journal of Operational Research, Elsevier, vol. 204(2), pages 251-254, July.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:122:y:2000:i:2:p:310-328. See general information about how to correct material in RePEc.

    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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.