IDEAS home Printed from https://ideas.repec.org/p/zbw/hswwdp/313612.html
   My bibliography  Save this paper

Generische Tourenpläne

Author

Listed:
  • Mumm, Harald

Abstract

No abstract is available for this item.

Suggested Citation

  • Mumm, Harald, 2025. "Generische Tourenpläne," Wismar Discussion Papers 01/2025, Hochschule Wismar, Wismar Business School.
    • Handle: RePEc:zbw:hswwdp:313612
    as

    Download full text from publisher

    File URL: https://www.econstor.eu/bitstream/10419/313612/1/1919529004.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Mumm, Harald, 2020. "Hybrider Ansatz zur Lösung des Fahrzeugroutenproblems mit Zeitfenstern bei großen Ortsanzahlen," Wismar Discussion Papers 02/2020, Hochschule Wismar, Wismar Business School.
    2. Luciano Costa & Claudio Contardo & Guy Desaulniers, 2019. "Exact Branch-Price-and-Cut Algorithms for Vehicle Routing," Transportation Science, INFORMS, vol. 53(4), pages 946-985, July.
    3. Mumm, Harald, 2021. "Ermittlung der kürzesten Fahrstrecke für das Fahrzeugroutenproblem mit Zeitfenstern bei großer Ortsanzahl," Wismar Discussion Papers 01/2021, Hochschule Wismar, Wismar Business School.
    Full references (including those not matched with items on IDEAS)

    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. Esmaeilbeigi, Rasul & Mak-Hau, Vicky & Yearwood, John & Nguyen, Vivian, 2022. "The multiphase course timetabling problem," European Journal of Operational Research, Elsevier, vol. 300(3), pages 1098-1119.
    2. Jiliu Li & Zhixing Luo & Roberto Baldacci & Hu Qin & Zhou Xu, 2023. "A New Exact Algorithm for Single-Commodity Vehicle Routing with Split Pickups and Deliveries," INFORMS Journal on Computing, INFORMS, vol. 35(1), pages 31-49, January.
    3. Yang, Ying & Hao, Xiaodeng & Wang, Shuaian, 2025. "The drone scheduling problem in shore-to-ship delivery: A time discretization-based model with an exact solving approach," Transportation Research Part B: Methodological, Elsevier, vol. 191(C).
    4. Víctor M. Albornoz & Gabriel E. Zamora, 2021. "Decomposition-based heuristic for the zoning and crop planning problem with adjacency constraints," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(1), pages 248-265, April.
    5. Florio, Alexandre M. & Gendreau, Michel & Hartl, Richard F. & Minner, Stefan & Vidal, Thibaut, 2023. "Recent advances in vehicle routing with stochastic demands: Bayesian learning for correlated demands and elementary branch-price-and-cut," European Journal of Operational Research, Elsevier, vol. 306(3), pages 1081-1093.
    6. He, Ping & Jin, Jian Gang & Trépanier, Martin & Schulte, Frederik, 2024. "A math-heuristic and exact algorithm for first-mile ridesharing problem with passenger service quality preferences," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 192(C).
    7. Sluijk, Natasja & Florio, Alexandre M. & Kinable, Joris & Dellaert, Nico & Van Woensel, Tom, 2023. "Two-echelon vehicle routing problems: A literature review," European Journal of Operational Research, Elsevier, vol. 304(3), pages 865-886.
    8. Gschwind, Timo & Bianchessi, Nicola & Irnich, Stefan, 2019. "Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 278(1), pages 91-104.
    9. Alexandre M. Florio & Nabil Absi & Dominique Feillet, 2021. "Routing Electric Vehicles on Congested Street Networks," Transportation Science, INFORMS, vol. 55(1), pages 238-256, 1-2.
    10. Liu, Yiming & Roberto, Baldacci & Zhou, Jianwen & Yu, Yang & Zhang, Yu & Sun, Wei, 2023. "Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 310(1), pages 133-155.
    11. Yin, Yunqiang & Yang, Yongjian & Yu, Yugang & Wang, Dujuan & Cheng, T.C.E., 2023. "Robust vehicle routing with drones under uncertain demands and truck travel times in humanitarian logistics," Transportation Research Part B: Methodological, Elsevier, vol. 174(C).
    12. Martin Wölck & Stephan Meisel, 2022. "Branch-and-Price Approaches for Real-Time Vehicle Routing with Picking, Loading, and Soft Time Windows," INFORMS Journal on Computing, INFORMS, vol. 34(4), pages 2192-2211, July.
    13. Mumm, Harald, 2020. "Ermittlung der minimalen Touranzahl für das Fahrzeugroutenproblem mit Zeitfenstern bei kleiner Fahrzeugkapazität und großer Ortsanzahl," Wismar Discussion Papers 05/2020, Hochschule Wismar, Wismar Business School.
    14. Vital, Filipe & Ioannou, Petros, 2021. "Scheduling and shortest path for trucks with working hours and parking availability constraints," Transportation Research Part B: Methodological, Elsevier, vol. 148(C), pages 1-37.
    15. Nikolaus Furian & Michael O’Sullivan & Cameron Walker & Eranda Çela, 2021. "A machine learning-based branch and price algorithm for a sampled vehicle routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(3), pages 693-732, September.
    16. Ju, Byung Jun & Chung, Byung Do, 2024. "Robust convoy movement problem under travel time uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 190(C).
    17. Jeanette Schmidt & Christian Tilk & Stefan Irnich, 2023. "Exact Solution of the Vehicle Routing Problem With Drones," Working Papers 2311, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    18. Mumm, Harald, 2021. "Ermittlung der kürzesten Fahrstrecke für das Fahrzeugroutenproblem mit Zeitfenstern bei großer Ortsanzahl," Wismar Discussion Papers 01/2021, Hochschule Wismar, Wismar Business School.
    19. Hoogendoorn, Y.N. & Dalmeijer, K., 2021. "Resource-robust valid inequalities for set covering and set partitioning models," Econometric Institute Research Papers EI 2020-08, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    20. Katrin Heßler & Stefan Irnich, 2023. "Partial Dominance in Branch-Price-and-Cut for the Basic Multicompartment Vehicle-Routing Problem," INFORMS Journal on Computing, INFORMS, vol. 35(1), pages 50-65, January.

    More about this item

    Keywords

    Tourenplanung; Lastkraftwagen; Produktionspotenzial; Dynamische Optimierung;
    All these keywords.

    JEL classification:

    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:zbw:hswwdp:313612. 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: ZBW - Leibniz Information Centre for Economics (email available below). General contact details of provider: https://edirc.repec.org/data/fwhwide.html .

    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.