IDEAS home Printed from https://ideas.repec.org/a/kap/netspa/v12y2012i4p609-633.html
   My bibliography  Save this article

A New Multi-objective Competitive Open Vehicle Routing Problem Solved by Particle Swarm Optimization

Author

Listed:
  • N. Norouzi
  • R. Tavakkoli-Moghaddam
  • M. Ghazanfari
  • M. Alinaghian
  • A. Salamatbakhsh

Abstract

This paper presents a new variant of an open vehicle routing problem (OVRP), in which competition exists between distributors. In the OVRP with competitive time windows (OVRPCTW), the reaching time to customers affects the sales amount. Therefore, distributors intend to service customers earlier than rivals, to obtain the maximum sales. Moreover, a part of a driver’s benefit is related to the amount of sales; thus, the balance of goods carried in each vehicle is important in view of the limited vehicle capacities. In this paper, a new, multi-objective mathematical model of the homogeneous and competitive OVRP is presented, to minimize the travel cost of routes and to maximize the obtained sales while concurrently balancing the goods distributed among vehicles. This model is solved by the use of a multi-objective particle swarm optimization (MOPSO) algorithm, and the related results are compared with the results of NSGA-II, which is a well-known multi-objective evolutionary algorithm. A comparison of our results with three performance metrics confirms that the proposed MOPSO is an efficient algorithm for solving the competitive OVRP with a reasonable computational time and cost. Copyright Springer Science+Business Media, LLC 2012

Suggested Citation

  • N. Norouzi & R. Tavakkoli-Moghaddam & M. Ghazanfari & M. Alinaghian & A. Salamatbakhsh, 2012. "A New Multi-objective Competitive Open Vehicle Routing Problem Solved by Particle Swarm Optimization," Networks and Spatial Economics, Springer, vol. 12(4), pages 609-633, December.
    • Handle: RePEc:kap:netspa:v:12:y:2012:i:4:p:609-633
    DOI: 10.1007/s11067-011-9169-4
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s11067-011-9169-4
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11067-011-9169-4?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
    ---><---

    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. Bérubé, Jean-François & Gendreau, Michel & Potvin, Jean-Yves, 2009. "An exact [epsilon]-constraint method for bi-objective combinatorial optimization problems: Application to the Traveling Salesman Problem with Profits," European Journal of Operational Research, Elsevier, vol. 194(1), pages 39-50, April.
    2. Brandao, Jose, 2004. "A tabu search algorithm for the open vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 157(3), pages 552-564, September.
    3. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms," Transportation Science, INFORMS, vol. 39(1), pages 104-118, February.
    4. Z Fu & R Eglese & L Y O Li, 2005. "A new tabu search heuristic for the open vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(3), pages 267-274, March.
    5. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part II: Metaheuristics," Transportation Science, INFORMS, vol. 39(1), pages 119-139, February.
    6. 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.
    7. Jozefowiez, Nicolas & Semet, Frédéric & Talbi, El-Ghazali, 2009. "An evolutionary algorithm for the vehicle routing problem with route balancing," European Journal of Operational Research, Elsevier, vol. 195(3), pages 761-769, June.
    8. P P Repoussis & C D Tarantilis & G Ioannou, 2007. "The open vehicle routing problem with time windows," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(3), pages 355-367, March.
    9. Marius M. Solomon, 1987. "Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints," Operations Research, INFORMS, vol. 35(2), pages 254-265, April.
    10. Naoki Ando & Eiichi Taniguchi, 2006. "Travel Time Reliability in Vehicle Routing and Scheduling with Time Windows," Networks and Spatial Economics, Springer, vol. 6(3), pages 293-311, September.
    11. Qureshi, A.G. & Taniguchi, E. & Yamada, T., 2009. "An exact solution approach for vehicle routing and scheduling problems with soft time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 45(6), pages 960-977, November.
    12. A. W. J. Kolen & A. H. G. Rinnooy Kan & H. W. J. M. Trienekens, 1987. "Vehicle Routing with Time Windows," Operations Research, INFORMS, vol. 35(2), pages 266-273, April.
    13. Michael Bell, 2006. "Mixed Route Strategies for the Risk-Averse Shipment of Hazardous Materials," Networks and Spatial Economics, Springer, vol. 6(3), pages 253-265, September.
    14. Yueyue Fan & Yu Nie, 2006. "Optimal Routing for Maximizing the Travel Time Reliability," Networks and Spatial Economics, Springer, vol. 6(3), pages 333-344, September.
    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. Sara Cheraghi & Seyyed-Mahdi Hosseini-Motlagh, 2020. "Responsive and reliable injured-oriented blood supply chain for disaster relief: a real case study," Annals of Operations Research, Springer, vol. 291(1), pages 129-167, August.
    2. Mohammad Tamannaei & Hamid Zarei & Sajede Aminzadegan, 2021. "A Game-Theoretic Approach to the Freight Transportation Pricing Problem in the Presence of Intermodal Service Providers in a Competitive Market," Networks and Spatial Economics, Springer, vol. 21(1), pages 123-173, March.
    3. Jesús Sánchez-Oro & Ana D. López-Sánchez & J. Manuel Colmenar, 2020. "A general variable neighborhood search for solving the multi-objective open vehicle routing problem," Journal of Heuristics, Springer, vol. 26(3), pages 423-452, June.
    4. Dasdemir, Erdi & Testik, Murat Caner & Öztürk, Diclehan Tezcaner & Şakar, Ceren Tuncer & Güleryüz, Güldal & Testik, Özlem Müge, 2022. "A multi-objective open vehicle routing problem with overbooking: Exact and heuristic solution approaches for an employee transportation problem," Omega, Elsevier, vol. 108(C).
    5. Junlong Zhang & William Lam & Bi Chen, 2013. "A Stochastic Vehicle Routing Problem with Travel Time Uncertainty: Trade-Off Between Cost and Customer Service," Networks and Spatial Economics, Springer, vol. 13(4), pages 471-496, December.
    6. Seyedmehdi Mirmohammadsadeghi & Shamsuddin Ahmed, 2015. "Memetic Heuristic Approach for Solving Truck and Trailer Routing Problems with Stochastic Demands and Time Windows," Networks and Spatial Economics, Springer, vol. 15(4), pages 1093-1115, December.
    7. Ali Heidari & Din Mohammad Imani & Mohammad Khalilzadeh & Mahdieh Sarbazvatan, 2023. "Green two-echelon closed and open location-routing problem: application of NSGA-II and MOGWO metaheuristic approaches," Environment, Development and Sustainability: A Multidisciplinary Approach to the Theory and Practice of Sustainable Development, Springer, vol. 25(9), pages 9163-9199, September.
    8. Shangyao Yan & Fei-Yen Hsiao & Yi-Chun Chen, 2015. "Inter-School Bus Scheduling Under Stochastic Travel Times," Networks and Spatial Economics, Springer, vol. 15(4), pages 1049-1074, December.

    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. Chiang, Wen-Chyuan & Russell, Robert & Xu, Xiaojing & Zepeda, David, 2009. "A simulation/metaheuristic approach to newspaper production and distribution supply chain problems," International Journal of Production Economics, Elsevier, vol. 121(2), pages 752-767, October.
    2. Bhusiri, Narath & Qureshi, Ali Gul & Taniguchi, Eiichi, 2014. "The trade-off between fixed vehicle costs and time-dependent arrival penalties in a routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 62(C), pages 1-22.
    3. P P Repoussis & C D Tarantilis & G Ioannou, 2007. "The open vehicle routing problem with time windows," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(3), pages 355-367, March.
    4. Francesco P. Deflorio & Jesus Gonzalez-Feliu & Roberto Tadei & Simone Amico, 2009. "Service quality planning for freight distribution with time windows in large networks," Working Papers halshs-01056187, HAL.
    5. Nicolas Rincon-Garcia & Ben J. Waterson & Tom J. Cherrett, 2018. "Requirements from vehicle routing software: perspectives from literature, developers and the freight industry," Transport Reviews, Taylor & Francis Journals, vol. 38(1), pages 117-138, January.
    6. Jeffrey W. Ohlmann & Michael J. Fry & Barrett W. Thomas, 2008. "Route Design for Lean Production Systems," Transportation Science, INFORMS, vol. 42(3), pages 352-370, August.
    7. Kritikos, Manolis N. & Ioannou, George, 2010. "The balanced cargo vehicle routing problem with time windows," International Journal of Production Economics, Elsevier, vol. 123(1), pages 42-51, January.
    8. Ehmke, Jan Fabian & Campbell, Ann Melissa, 2014. "Customer acceptance mechanisms for home deliveries in metropolitan areas," European Journal of Operational Research, Elsevier, vol. 233(1), pages 193-207.
    9. Taş, D. & Gendreau, M. & Dellaert, N. & van Woensel, T. & de Kok, A.G., 2014. "Vehicle routing with soft time windows and stochastic travel times: A column generation and branch-and-price solution approach," European Journal of Operational Research, Elsevier, vol. 236(3), pages 789-799.
    10. TALARICO, Luca & SÖRENSEN, Kenneth & SPRINGAEL, Johan, 2013. "The risk constrained cash-in-transit vehicle routing problem with time windows," Working Papers 2013012, University of Antwerp, Faculty of Business and Economics.
    11. Shijin Wang & Xiaodong Wang & Xin Liu & Jianbo Yu, 2018. "A Bi-Objective Vehicle-Routing Problem with Soft Time Windows and Multiple Depots to Minimize the Total Energy Consumption and Customer Dissatisfaction," Sustainability, MDPI, vol. 10(11), pages 1-21, November.
    12. Ehmke, Jan Fabian & Campbell, Ann Melissa & Urban, Timothy L., 2015. "Ensuring service levels in routing problems with time windows and stochastic travel times," European Journal of Operational Research, Elsevier, vol. 240(2), pages 539-550.
    13. Han, Shuihua & Zhao, Ling & Chen, Kui & Luo, Zong-wei & Mishra, Deepa, 2017. "Appointment scheduling and routing optimization of attended home delivery system with random customer behavior," European Journal of Operational Research, Elsevier, vol. 262(3), pages 966-980.
    14. Liu, Ran & Xie, Xiaolan & Garaix, Thierry, 2014. "Hybridization of tabu search with feasible and infeasible local searches for periodic home health care logistics," Omega, Elsevier, vol. 47(C), pages 17-32.
    15. Ma, Hong & Cheang, Brenda & Lim, Andrew & Zhang, Lei & Zhu, Yi, 2012. "An investigation into the vehicle routing problem with time windows and link capacity constraints," Omega, Elsevier, vol. 40(3), pages 336-347.
    16. Md. Anisul Islam & Yuvraj Gajpal, 2021. "Optimization of Conventional and Green Vehicles Composition under Carbon Emission Cap," Sustainability, MDPI, vol. 13(12), pages 1-20, June.
    17. Liu, Ran & Jiang, Zhibin, 2012. "The close–open mixed vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 220(2), pages 349-360.
    18. Russell, Robert, 2013. "A constraint programming approach to designing a newspaper distribution system," International Journal of Production Economics, Elsevier, vol. 145(1), pages 132-138.
    19. Qi, Mingyao & Lin, Wei-Hua & Li, Nan & Miao, Lixin, 2012. "A spatiotemporal partitioning approach for large-scale vehicle routing problems with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(1), pages 248-257.
    20. Zäpfel, Günther & Bögl, Michael, 2008. "Multi-period vehicle routing and crew scheduling with outsourcing options," International Journal of Production Economics, Elsevier, vol. 113(2), pages 980-996, June.

    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:kap:netspa:v:12:y:2012:i:4:p:609-633. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.