IDEAS home Printed from https://ideas.repec.org/a/igg/jsds00/v7y2016i2p16-39.html
   My bibliography  Save this article

A Bi-Objective Vehicle Routing Problem with Time Window by Considering Customer Satisfaction

Author

Listed:
  • Masoud Rabbani

    (School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran)

  • Mahyar Taheri

    (School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran)

  • Mohammad Ravanbakhsh

    (School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran)

Abstract

The Vehicle Routing Problem (VRP) by considering Time Windows is an essential and a reality optimization problem consisting in the determination of the set of routes with minimum distance to carry goods, by using some vehicles with capacity constraint; vehicles must visit customers within a time frame. In the recent years, many numbers of algorithm have been considered to solve a single objective formulate of VRPTW problem, such as Meta-heuristic, bender's decomposition, column generation and so on. This paper considers not only the minimum distance and the number of vehicles used to carry goods for customers. The customer satisfaction by considering the priority of the customers is considered which leads to service the customer as soon as possible. In this paper, the MOPSO and NSGAII approaches applied to solve the problem and then the authors compare the results of them; finally, they analysis the sensitivity of the capacity constraint for the vehicles

Suggested Citation

  • Masoud Rabbani & Mahyar Taheri & Mohammad Ravanbakhsh, 2016. "A Bi-Objective Vehicle Routing Problem with Time Window by Considering Customer Satisfaction," International Journal of Strategic Decision Sciences (IJSDS), IGI Global, vol. 7(2), pages 16-39, April.
    • Handle: RePEc:igg:jsds00:v:7:y:2016:i:2:p:16-39
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJSDS.2016040102
    Download Restriction: no
    ---><---

    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:igg:jsds00:v:7:y:2016:i:2:p:16-39. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.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.