IDEAS home Printed from https://ideas.repec.org/a/ibf/riafin/v7y2014i6p1-13.html
   My bibliography  Save this article

Evaluation Of A Mathematic Model To Support Complex Decision Makings, Evaluacion De Un Modelo Matematico Para Apoyar Decisiones Empresariales Complejas

Author

Listed:
  • Yoannia Arean Rodriguez
  • Alejandro Rosete Suarez
  • Franklin Marin Vargas

Abstract

The decision making process that implies optimizing paths for goods delivery, messaging services, tours, and others, is usually a difficult task. One problem, that has been and continues being, a challenge for scientists in different areas is the trade traveler problem. This paper focuses on evaluation, through the use of metaheuristics algorithms, of a model created based on the analysis of a particular case of this problem. In this special case it was necessary to consider time windows. The goal is to determine which algorithm provides a better solution will provide an aid to decision-makers of companies that require analyzing the variables included in the model.

Suggested Citation

  • Yoannia Arean Rodriguez & Alejandro Rosete Suarez & Franklin Marin Vargas, 2014. "Evaluation Of A Mathematic Model To Support Complex Decision Makings, Evaluacion De Un Modelo Matematico Para Apoyar Decisiones Empresariales Complejas," Revista Internacional Administracion & Finanzas, The Institute for Business and Finance Research, vol. 7(6), pages 1-13.
    • Handle: RePEc:ibf:riafin:v:7:y:2014:i:6:p:1-13
    as

    Download full text from publisher

    File URL: http://www.theibfr2.com/RePEc/ibf/riafin/riaf-v7n6-2014/RIAF-V7N6-2014-1.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Richa Agarwal & Özlem Ergun, 2008. "Ship Scheduling and Network Design for Cargo Routing in Liner Shipping," Transportation Science, INFORMS, vol. 42(2), pages 175-196, May.
    2. Yiannis A. Koskosidis & Warren B. Powell & Marius M. Solomon, 1992. "An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints," Transportation Science, INFORMS, vol. 26(2), pages 69-85, May.
    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. Moussawi-Haidar, Lama & Nasr, Walid & Jalloul, Maya, 2021. "Standardized cargo network revenue management with dual channels under stochastic and time-dependent demand," European Journal of Operational Research, Elsevier, vol. 295(1), pages 275-291.
    2. Asghari, Mohammad & Jaber, Mohamad Y. & Mirzapour Al-e-hashem, S.M.J., 2023. "Coordinating vessel recovery actions: Analysis of disruption management in a liner shipping service," European Journal of Operational Research, Elsevier, vol. 307(2), pages 627-644.
    3. SteadieSeifi, M. & Dellaert, N.P. & Nuijten, W. & Van Woensel, T., 2017. "A metaheuristic for the multimodal network flow problem with product quality preservation and empty repositioning," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 321-344.
    4. 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.
    5. Ricardo Gatica & Pablo Miranda, 2011. "Special Issue on Latin-American Research: A Time Based Discretization Approach for Ship Routing and Scheduling with Variable Speed," Networks and Spatial Economics, Springer, vol. 11(3), pages 465-485, September.
    6. 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.
    7. Baals, Julian & Emde, Simon & Turkensteen, Marcel, 2023. "Minimizing earliness-tardiness costs in supplier networks—A just-in-time truck routing problem," European Journal of Operational Research, Elsevier, vol. 306(2), pages 707-741.
    8. Wang, Hua & Wang, Shuaian & Meng, Qiang, 2014. "Simultaneous optimization of schedule coordination and cargo allocation for liner container shipping networks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 70(C), pages 261-273.
    9. Tobias Buer & Rasmus Haass, 2018. "Cooperative liner shipping network design by means of a combinatorial auction," Flexible Services and Manufacturing Journal, Springer, vol. 30(4), pages 686-711, December.
    10. Fagerholt, Kjetil, 2001. "Ship scheduling with soft time windows: An optimisation based approach," European Journal of Operational Research, Elsevier, vol. 131(3), pages 559-571, June.
    11. Ilfat Ghamlouche & Teodor Gabriel Crainic & Michel Gendreau, 2003. "Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design," Operations Research, INFORMS, vol. 51(4), pages 655-667, August.
    12. K H Kim & M J Lee, 2007. "Scheduling trucks in local depots for door-to-door delivery services," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(9), pages 1195-1202, September.
    13. Zheng, Jianfeng & Meng, Qiang & Sun, Zhuo, 2014. "Impact analysis of maritime cabotage legislations on liner hub-and-spoke shipping network design," European Journal of Operational Research, Elsevier, vol. 234(3), pages 874-884.
    14. Kristian Thun & Henrik Andersson & Marielle Christiansen, 2017. "Analyzing complex service structures in liner shipping network design," Flexible Services and Manufacturing Journal, Springer, vol. 29(3), pages 535-552, December.
    15. Wang, Shuaian, 2013. "Essential elements in tactical planning models for container liner shipping," Transportation Research Part B: Methodological, Elsevier, vol. 54(C), pages 84-99.
    16. Magnus Bolstad Holm & Carl Axel Benjamin Medbøen & Kjetil Fagerholt & Peter Schütz, 2019. "Shortsea liner network design with transhipments at sea: a case study from Western Norway," Flexible Services and Manufacturing Journal, Springer, vol. 31(3), pages 598-619, September.
    17. Andrew Lim & Xingwen Zhang, 2007. "A Two-Stage Heuristic with Ejection Pools and Generalized Ejection Chains for the Vehicle Routing Problem with Time Windows," INFORMS Journal on Computing, INFORMS, vol. 19(3), pages 443-457, August.
    18. Msakni, Mohamed Kais & Fagerholt, Kjetil & Meisel, Frank & Lindstad, Elizabeth, 2020. "Analyzing different designs of liner shipping feeder networks: A case study," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 134(C).
    19. Zhen, Lu & Wu, Yiwei & Wang, Shuaian & Laporte, Gilbert, 2020. "Green technology adoption for fleet deployment in a shipping network," Transportation Research Part B: Methodological, Elsevier, vol. 139(C), pages 388-410.
    20. Wang, Shuaian & Liu, Zhiyuan & Meng, Qiang, 2015. "Segment-based alteration for container liner shipping network design," Transportation Research Part B: Methodological, Elsevier, vol. 72(C), pages 128-145.

    More about this item

    Keywords

    Travel Salesman Problem; Metaheuristics; Decision Making;
    All these keywords.

    JEL classification:

    • C00 - Mathematical and Quantitative Methods - - General - - - General
    • C02 - Mathematical and Quantitative Methods - - General - - - Mathematical Economics
    • C44 - Mathematical and Quantitative Methods - - Econometric and Statistical Methods: Special Topics - - - Operations Research; Statistical Decision Theory
    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
    • C63 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Computational Techniques

    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:ibf:riafin:v:7:y:2014:i:6:p:1-13. 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: Mercedes Jalbert (email available below). General contact details of provider: .

    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.