IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v152y2004i2p437-453.html
   My bibliography  Save this article

Combination of geographical information system and efficient routing algorithms for real life distribution operations

Author

Listed:
  • Tarantilis, C. D.
  • Diakoulaki, D.
  • Kiranoudis, C. T.

Abstract

No abstract is available for this item.

Suggested Citation

  • Tarantilis, C. D. & Diakoulaki, D. & Kiranoudis, C. T., 2004. "Combination of geographical information system and efficient routing algorithms for real life distribution operations," European Journal of Operational Research, Elsevier, vol. 152(2), pages 437-453, January.
    • Handle: RePEc:eee:ejores:v:152:y:2004:i:2:p:437-453
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(03)00035-3
    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. G. A. Croes, 1958. "A Method for Solving Traveling-Salesman Problems," Operations Research, INFORMS, vol. 6(6), pages 791-812, December.
    2. D Sariklis & S Powell, 2000. "A heuristic method for the open vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 51(5), pages 564-573, May.
    3. Paessens, H., 1988. "The savings algorithm for the vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 34(3), pages 336-344, March.
    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. De Boeck, Kim & Decouttere, Catherine & Jónasson, Jónas Oddur & Vandaele, Nico, 2022. "Vaccine supply chains in resource-limited settings: Mitigating the impact of rainy season disruptions," European Journal of Operational Research, Elsevier, vol. 301(1), pages 300-317.
    2. C D Tarantilis & G Ioannou & C T Kiranoudis & G P Prastacos, 2005. "Solving the open vehicle routeing problem via a single parameter metaheuristic algorithm," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(5), pages 588-596, May.
    3. López-Sánchez, A.D. & Hernández-Díaz, A.G. & Vigo, D. & Caballero, R. & Molina, J., 2014. "A multi-start algorithm for a balanced real-world Open Vehicle Routing Problem," European Journal of Operational Research, Elsevier, vol. 238(1), pages 104-113.
    4. Repoussis, P.P. & Paraskevopoulos, D.C. & Zobolas, G. & Tarantilis, C.D. & Ioannou, G., 2009. "A web-based decision support system for waste lube oils collection and recycling," European Journal of Operational Research, Elsevier, vol. 195(3), pages 676-700, June.
    5. D Aksen & Z Özyurt & N Aras, 2007. "Open vehicle routing problem with driver nodes and time deadlines," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(9), pages 1223-1234, September.
    6. A N Letchford & J Lysgaard & R W Eglese, 2007. "A branch-and-cut algorithm for the capacitated open vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(12), pages 1642-1651, December.
    7. Kayakutlu, Gulgun & Buyukozkan, Gulcin, 2011. "Assessing performance factors for a 3PL in a value chain," International Journal of Production Economics, Elsevier, vol. 131(2), pages 441-452, June.
    8. Atefi, Reza & Salari, Majid & C. Coelho, Leandro & Renaud, Jacques, 2018. "The open vehicle routing problem with decoupling points," European Journal of Operational Research, Elsevier, vol. 265(1), pages 316-327.

    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. Jan Christiaens & Greet Vanden Berghe, 2020. "Slack Induction by String Removals for Vehicle Routing Problems," Transportation Science, INFORMS, vol. 54(2), pages 417-433, March.
    2. C D Tarantilis & C T Kiranoudis & V S Vassiliadis, 2003. "A list based threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(1), pages 65-71, January.
    3. Tarantilis, C.D. & Kiranoudis, C.T., 2007. "A flexible adaptive memory-based algorithm for real-life transportation operations: Two case studies from dairy and construction sector," European Journal of Operational Research, Elsevier, vol. 179(3), pages 806-822, June.
    4. Tarantilis, C. D. & Kiranoudis, C. T. & Vassiliadis, V. S., 2004. "A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 152(1), pages 148-158, January.
    5. Nair, D.J. & Grzybowska, H. & Fu, Y. & Dixit, V.V., 2018. "Scheduling and routing models for food rescue and delivery operations," Socio-Economic Planning Sciences, Elsevier, vol. 63(C), pages 18-32.
    6. Pan-Li Zhang & Xiao-Bo Sun & Ji-Quan Wang & Hao-Hao Song & Jin-Ling Bei & Hong-Yu Zhang, 2022. "The Discrete Carnivorous Plant Algorithm with Similarity Elimination Applied to the Traveling Salesman Problem," Mathematics, MDPI, vol. 10(18), pages 1-34, September.
    7. Arthur Charpentier & Romuald Élie & Carl Remlinger, 2023. "Reinforcement Learning in Economics and Finance," Computational Economics, Springer;Society for Computational Economics, vol. 62(1), pages 425-462, June.
    8. Racha El-Hajj & Rym Nesrine Guibadj & Aziz Moukrim & Mehdi Serairi, 2020. "A PSO based algorithm with an efficient optimal split procedure for the multiperiod vehicle routing problem with profit," Annals of Operations Research, Springer, vol. 291(1), pages 281-316, August.
    9. CASTRO, Marco & SÖRENSEN, Kenneth & VANSTEENWEGEN, Pieter & GOOS, Peter, 2012. "A simple GRASP+VND for the travelling salesperson problem with hotel selection," Working Papers 2012024, University of Antwerp, Faculty of Business and Economics.
    10. Rui Yan & Haotong Tian & Kaiye Gao & Rui Peng & Bin Liu, 2023. "A two-stage UAV routing problem with time window considering rescheduling with random delivery reliability," Journal of Risk and Reliability, , vol. 237(4), pages 781-797, August.
    11. Eric Bonabeau & Florian Henaux & Sylvain Gu'erin & Dominique Snyers & Pascale Kuntz & Guy Theraulaz, 1998. "Routing in Telecommunications Networks with ``Smart'' Ant-Like Agents," Working Papers 98-01-003, Santa Fe Institute.
    12. Eduardo Lalla-Ruiz & Christopher Expósito-Izquierdo & Shervin Taheripour & Stefan Voß, 2016. "An improved formulation for the multi-depot open vehicle routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(1), pages 175-187, January.
    13. A A Juan & J Faulin & J Jorba & D Riera & D Masip & B Barrios, 2011. "On the use of Monte Carlo simulation, cache and splitting techniques to improve the Clarke and Wright savings heuristics," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(6), pages 1085-1097, June.
    14. İ K Altınel & T Öncan, 2005. "A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(8), pages 954-961, August.
    15. Bernhard Fleischmann & Martin Gietz & Stefan Gnutzmann, 2004. "Time-Varying Travel Times in Vehicle Routing," Transportation Science, INFORMS, vol. 38(2), pages 160-173, May.
    16. Zachariadis, Emmanouil E. & Tarantilis, Christos D. & Kiranoudis, Christos T., 2009. "A Guided Tabu Search for the Vehicle Routing Problem with two-dimensional loading constraints," European Journal of Operational Research, Elsevier, vol. 195(3), pages 729-743, June.
    17. M. Kritikos & G. Ioannou, 2017. "A greedy heuristic for the capacitated minimum spanning tree problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(10), pages 1223-1235, October.
    18. Z P Fan & Y Chen & J Ma & S Zeng, 2011. "Erratum: A hybrid genetic algorithmic approach to the maximally diverse grouping problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(7), pages 1423-1430, July.
    19. Luc Muyldermans & Patrick Beullens & Dirk Cattrysse & Dirk Van Oudheusden, 2005. "Exploring Variants of 2-Opt and 3-Opt for the General Routing Problem," Operations Research, INFORMS, vol. 53(6), pages 982-995, December.
    20. Siyang Xie & Xi Chen & Zhaodong Wang & Yanfeng Ouyang & Kamalesh Somani & Jing Huang, 2016. "Integrated Planning for Multiple Types of Locomotive Work Facilities Under Location, Routing, and Inventory Considerations," Interfaces, INFORMS, vol. 46(5), pages 391-408, October.

    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:152:y:2004:i:2:p:437-453. 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.