IDEAS home Printed from https://ideas.repec.org/p/zbw/hswwdp/313612.html

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. 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.
    2. 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.
    3. 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.
    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. Twan Dollevoet & Pedro Munari & Remy Spliet, 2026. "A p -Step Formulation for the Capacitated Vehicle Routing Problem," Transportation Science, INFORMS, vol. 60(1), pages 87-100, January.
    2. 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.
    3. Clément Altman & Guy Desaulniers & Fausto Errico, 2023. "The Fragility-Constrained Vehicle Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 57(2), pages 552-572, March.
    4. Arenas-Vasco, Alejandro & Alcázar, Daniela & Villegas, Juan G., 2025. "A meta-analysis of set partitioning/set covering based matheuristics for vehicle routing problems," Operations Research Perspectives, Elsevier, vol. 15(C).
    5. Zhenzhen Zhang & Yu Zhang & Roberto Baldacci, 2024. "Generalized Riskiness Index in Vehicle Routing Under Uncertain Travel Times: Formulations, Properties, and Exact Solution Framework," Transportation Science, INFORMS, vol. 58(4), pages 761-780, July.
    6. Pedro Henrique Liguori & A. Ridha Mahjoub & Guillaume Marques & Ruslan Sadykov & Eduardo Uchoa, 2023. "Nonrobust Strong Knapsack Cuts for Capacitated Location Routing and Related Problems," Operations Research, INFORMS, vol. 71(5), pages 1577-1595, September.
    7. Edward Lam & Peter J. Stuckey & Daniel Harabor, 2025. "Optimal Multi-Agent Pickup and Delivery Using Branch-and-Cut-and-Price Algorithms," Transportation Science, INFORMS, vol. 59(1), pages 104-124, January.
    8. Liu, Yiming & Yu, Yang & Baldacci, Roberto & Tang, Jiafu & Sun, Wei, 2025. "Optimizing carbon emissions in green logistics for time-dependent routing," Transportation Research Part B: Methodological, Elsevier, vol. 192(C).
    9. 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.
    10. 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).
    11. Yu Yang, 2025. "DeLuxing: Deep Lagrangian Underestimate Fixing for Column-Generation-Based Exact Methods," Operations Research, INFORMS, vol. 73(3), pages 1184-1207, May.
    12. Jeanette Schmidt & Christian Tilk & Stefan Irnich, 2025. "Exact Solution of the Vehicle Routing Problem with Drones," Transportation Science, INFORMS, vol. 59(1), pages 60-80, January.
    13. Yu Yang, 2023. "An Exact Price-Cut-and-Enumerate Method for the Capacitated Multitrip Vehicle Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 57(1), pages 230-251, January.
    14. 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.
    15. 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.
    16. Daniel Yamín & Guy Desaulniers & Jorge E. Mendoza, 2025. "The Electric Vehicle Routing and Overnight Charging Scheduling Problem on a Multigraph," INFORMS Journal on Computing, INFORMS, vol. 37(4), pages 808-830, July.
    17. Kerscher, Christoph & Minner, Stefan, 2025. "Decompose-route-improve framework for solving large-scale vehicle routing problems with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 204(C).
    18. Maxime Agius & Nabil Absi & Dominique Feillet & Thierry Garaix, 2026. "Solution algorithms for a vehicle routing problem with route-cost equity constraints," Annals of Operations Research, Springer, vol. 359(3), pages 2309-2349, April.
    19. 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).
    20. Faheng Deng & Hu Qin & Jiliu Li & Chun Cheng, 2023. "The Pickup and Delivery Problem with Time Windows and Incompatibility Constraints in Cold Chain Transportation," Transportation Science, INFORMS, vol. 57(2), pages 444-462, March.

    More about this item

    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.