IDEAS home Printed from https://ideas.repec.org/p/sek/iacpro/3606330.html
   My bibliography  Save this paper

A New Approach: Maximizing Load Ratios Of Vehicles To Maintain Profitability In Open Vehicle Problems

Author

Listed:
  • Erhan Tonbul

    (Eskisehir Anadolu University, Turkey)

  • Gamze Tuna

    (Eskisehir Anadolu University, Turkey)

  • Nihal Erginel

    (Eskisehir Anadolu University)

Abstract

Open vehicle routing problem (OVRP) is a special case of the well-known vehicle routing problem (VRP), which is one of the most popular optimization issues in transportation. In open vehicle problems, the ultimate goal is usually defined as finding the routes with the optimum costs, by means of fleet size and the travelled distance. Vehicles do not return to the depot after delivering their goods to the customer nodes. There is a classical approach of finding the shortest paths and minimum fleet size to solve these problems. However, most logistic companies are often interested in the load ratio of their vehicles as well. They expect their vehicles to take long distances with reasonable load ratios. For a vehicle to leave the big percentage of the load in the first delivery points and take the remaining much longer distance almost empty is an unwanted situation. In this study, a solution to the open vehicle routing problems is proposed from this perspective. To solve these kinds of NP-Hard problems, using metaheuristics is a fine way of obtaining good-enough solutions within reasonable time. In this study, a modified genetic algorithm is coded and a user-friendly decision support system is designed to solve this specific problem.

Suggested Citation

  • Erhan Tonbul & Gamze Tuna & Nihal Erginel, 2016. "A New Approach: Maximizing Load Ratios Of Vehicles To Maintain Profitability In Open Vehicle Problems," Proceedings of International Academic Conferences 3606330, International Institute of Social and Economic Sciences.
    • Handle: RePEc:sek:iacpro:3606330
    as

    Download full text from publisher

    File URL: https://iises.net/proceedings/23rd-international-academic-conference-venice/table-of-content/detail?cid=36&iid=089&rid=6330
    File Function: First version, 2016
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    open vehicle routing; maximizing load ratio; transportation optimization; metaheuristics; modified genetic algorithm; crossover operators; hybrid metaheuristic; optimization; shortest path; minimum fleet size;
    All these keywords.

    JEL classification:

    • L91 - Industrial Organization - - Industry Studies: Transportation and Utilities - - - Transportation: General
    • L87 - Industrial Organization - - Industry Studies: Services - - - Postal and Delivery Services

    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:sek:iacpro:3606330. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Klara Cermakova (email available below). General contact details of provider: https://iises.net/ .

    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.