IDEAS home Printed from https://ideas.repec.org/a/vrs/logitl/v11y2020i1p78-87n8.html
   My bibliography  Save this article

Possible Application of Solver Optimization Module for Solving Single-circuit Transport Problems

Author

Listed:
  • Šedivý Josef

    (University of Pardubice., Department of Transport Management, Marketing and Logistics, Studentská 95, 532 10 Pardubice, Czech Republic)

  • Čejka Jiří

    (Institute of Technology and Business in České Budějovice., Department of Informatics and Natural Sciences, Okružní 517/10, 370 01 České Budějovice, Czech Republic)

  • Guchenko Mykola

    (Kremenchuk Mykhailo Ostrogradskyi National University., Department of Computer and Information Systems, Pershotravneva st. 20, 39600 Kremenchuk, Ukraine)

Abstract

The article deals with the possible application of the Solver optimization module to solving the single-circuit transport problems. First, the article describes the single-circuit transport problems and the optimization module Solver itself. Using the specific model example of beer distribution, the author demonstrates the algorithm which may be applied to solving single-circuit transport problems by means of Solver. The travel route designed by Solver is then compared with the originally proposed route. The values being compared include the total length of travel routes created and the associated variable costs spent on serving customers and also route design time. Thus, using the practical example of beer distribution, the manuscript has demonstrated the algorithm which is used for addressing the single-circuit transport problems. Nonetheless, possible application of the Solver tool is not limited to seeking a solution to the travelling salesman problem only. It can also be implemented even to discussing the multi-circuit transport problems with various confinements.

Suggested Citation

  • Šedivý Josef & Čejka Jiří & Guchenko Mykola, 2020. "Possible Application of Solver Optimization Module for Solving Single-circuit Transport Problems," LOGI – Scientific Journal on Transport and Logistics, Sciendo, vol. 11(1), pages 78-87, May.
    • Handle: RePEc:vrs:logitl:v:11:y:2020:i:1:p:78-87:n:8
    DOI: 10.2478/logi-2020-0008
    as

    Download full text from publisher

    File URL: https://doi.org/10.2478/logi-2020-0008
    Download Restriction: no
    File URL: https://libkey.io/10.2478/logi-2020-0008?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Daniel Fylstra & Leon Lasdon & John Watson & Allan Waren, 1998. "Design and Use of the Microsoft Excel Solver," Interfaces, INFORMS, vol. 28(5), pages 29-55, October.
    2. Ondrej Stopka & Maria Stopkova & Rudolf Kampf, 2019. "Application of the Operational Research Method to Determine the Optimum Transport Collection Cycle of Municipal Waste in a Predesignated Urban Area," Sustainability, MDPI, vol. 11(8), pages 1-15, April.
    3. Duan, C. J. & Hu, J. & Garrott, S.C., 2016. "Using Excel Solver to Solve Braydon Farms’ Truck Routing Problem: A Case Study," South Asian Journal of Management Sciences (SAJMS), Iqra University, Iqra University, vol. 10(1), pages 38-47, Spring.
    4. Martin Desrochers & Jacques Desrosiers & Marius Solomon, 1992. "A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows," Operations Research, INFORMS, vol. 40(2), pages 342-354, April.
    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. Weijun Xie & Yanfeng Ouyang & Sze Chun Wong, 2016. "Reliable Location-Routing Design Under Probabilistic Facility Disruptions," Transportation Science, INFORMS, vol. 50(3), pages 1128-1138, August.
    2. de Lima, Vinícius L. & Alves, Cláudio & Clautiaux, François & Iori, Manuel & Valério de Carvalho, José M., 2022. "Arc flow formulations based on dynamic programming: Theoretical foundations and applications," European Journal of Operational Research, Elsevier, vol. 296(1), pages 3-21.
    3. Omid Shahvari & Rasaratnam Logendran & Madjid Tavana, 2022. "An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems," Journal of Scheduling, Springer, vol. 25(5), pages 589-621, October.
    4. Hernandez, Florent & Feillet, Dominique & Giroudeau, Rodolphe & Naud, Olivier, 2016. "Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 249(2), pages 551-559.
    5. Baldacci, Roberto & Mingozzi, Aristide & Roberti, Roberto, 2012. "Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints," European Journal of Operational Research, Elsevier, vol. 218(1), pages 1-6.
    6. Qin, Hu & Moriakin, Anton & Xu, Gangyan & Li, Jiliu, 2024. "The generator distribution problem for base stations during emergency power outage: A branch-and-price-and-cut approach," European Journal of Operational Research, Elsevier, vol. 318(3), pages 752-767.
    7. Timo Gschwind & Stefan Irnich, 2012. "Effective Handling of Dynamic Time Windows and Synchronization with Precedences for Exact Vehicle Routing," Working Papers 1211, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    8. Calvete, Herminia I. & Gale, Carmen & Oliveros, Maria-Jose & Sanchez-Valverde, Belen, 2007. "A goal programming approach to vehicle routing problems with soft time windows," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1720-1733, March.
    9. Capelle, Thomas & Cortés, Cristián E. & Gendreau, Michel & Rey, Pablo A. & Rousseau, Louis-Martin, 2019. "A column generation approach for location-routing problems with pickup and delivery," European Journal of Operational Research, Elsevier, vol. 272(1), pages 121-131.
    10. Liu, Fuh-Hwa Franklin & Shen, Sheng-Yuan, 1999. "A route-neighborhood-based metaheuristic for vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 118(3), pages 485-504, November.
    11. Lixin Tang & Gongshu Wang & Zhi-Long Chen, 2014. "Integrated Charge Batching and Casting Width Selection at Baosteel," Operations Research, INFORMS, vol. 62(4), pages 772-787, August.
    12. Müller, Juliane, 2010. "Approximative solutions to the bicriterion Vehicle Routing Problem with Time Windows," European Journal of Operational Research, Elsevier, vol. 202(1), pages 223-231, April.
    13. C S Sung & W Yang, 2008. "An exact algorithm for a cross-docking supply chain network design problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(1), pages 119-136, January.
    14. 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.
    15. Martinez-Garcia, A.N. & Anderson, J., 2007. "Carnico-ICSPEA2--A metaheuristic co-evolutionary navigator for a complex co-evolutionary farming system," European Journal of Operational Research, Elsevier, vol. 179(3), pages 634-655, June.
    16. Mirela Stojković & François Soumis & Jacques Desrosiers, 1998. "The Operational Airline Crew Scheduling Problem," Transportation Science, INFORMS, vol. 32(3), pages 232-245, August.
    17. Davis, Lauren B. & Sengul, Irem & Ivy, Julie S. & Brock, Luther G. & Miles, Lastella, 2014. "Scheduling food bank collections and deliveries to ensure food safety and improve access," Socio-Economic Planning Sciences, Elsevier, vol. 48(3), pages 175-188.
    18. Alexandre Lemos & Pedro T. Monteiro & Inês Lynce, 2021. "Disruptions in timetables: a case study at Universidade de Lisboa," Journal of Scheduling, Springer, vol. 24(1), pages 35-48, February.
    19. Russell Bent & Pascal Van Hentenryck, 2004. "A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 38(4), pages 515-530, November.
    20. Dollevoet, T.A.B. & Pecin, D. & Spliet, R., 2020. "The path programming problem and a partial path relaxation," Econometric Institute Research Papers EI-2020-04, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.

    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:vrs:logitl:v:11:y:2020:i:1:p:78-87:n:8. 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: Peter Golla (email available below). General contact details of provider: https://www.sciendo.com .

    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.