Skip to main content
Log in

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

  • Published:
Networks and Spatial Economics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

References

  • Ai T, Kachitvichyanukul V (2009) A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery. Comput Oper Res 36:1693–1702

    Article  Google Scholar 

  • Ando N, Taniguchi E (2006) Travel time reliability in vehicle routing and scheduling with time windows. Netw Spat Econ 6:293–311

    Article  Google Scholar 

  • Bell MGH (2006) Mixed route strategies for the risk-averse shipment of hazardous materials. Netw Spat Econ 6:253–265

    Article  Google Scholar 

  • Bérubé J-F, Gendreau M, Potvin J-Y (2009) An exact -constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits. Eur J Oper Res 194:39–50

    Article  Google Scholar 

  • Brandao J (2004) A tabu search algorithm for the open vehicle routing problem. Eur J Oper Res 157:552–564

    Article  Google Scholar 

  • Braysy O, Gendreau M (2005) Vehicle routing problem with time windows, part I: route construction and local search algorithms. Transport Sci 39:104–118

    Article  Google Scholar 

  • Cao E, Lai M (2010) The open vehicle routing problem with fuzzy demands. Expert Syst Appl 37:2405–2411

    Article  Google Scholar 

  • Chang C-T, Chang C-C (2000) A linearization method for mixed 0–1 polynomial programs. Comput Oper Res 27:1005–1016

    Article  Google Scholar 

  • Chen A-L, Yang G-K, Wu ZM (2006) Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem. Journal of Zhejiang University—Science A 7(4):607–614

    Article  Google Scholar 

  • Cordeau JF, Desaulniers G, Desrosiers J, Solomon MM, Soumis F (2001) The VRP with time windows, In: P. Toth, D. Vigo (eds), The vehicle routing problem, Philadelphia, PA: 157–194

  • Deb K, Agrawal S, Pratab A, Meyarivan T (2000) A fast elitist nondominated sorting genetic algorithm for multi-objective optimization: NSGA-II, The Proceedings of Parallel Problem Solving from Nature: pp 849–858.

  • Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans on Evol Comput 6:182–197

    Article  Google Scholar 

  • Fan Y, Nie Y (2006) Optimal routing for maximizing the travel time reliability. Netw Spat Econ 6:333–344

    Article  Google Scholar 

  • Fleszar K, Osman IH, Hindi KSH (2007) A variable neighbourhood search algorithm for the open vehicle routing problem. Eur J Oper Res 195(3):803–809

    Article  Google Scholar 

  • Fu Z, Eglese RW, Li LYO (2005) A new tabu search heuristic for the open vehicle routing problem. J Oper Res Soc 56:267–274

    Article  Google Scholar 

  • Ghaderi A, Jabalameli MS, Barzinpour F, Rahmaniani R (2011) An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem. Netw Spat Econ, Accepted for publication, doi:10.1007/s11067-011-9162-y

  • Glover F, Woolsey L (1974) Converting the 0–1 polynomial programming problem to a 0–1 linear program. Oper Res 22:180–182

    Article  Google Scholar 

  • Golden BL, Assad AA (eds) (1988) Vehicle routing: methods and studies. Elsevier, Amsterdam

    Google Scholar 

  • Jaszkiewicz A (2001) Multiple objective metaheuristic algorithms for combinatorial optimization, Habilitation Thesis, Poznan University of Technology, Poznan

  • Jozefowiez N, Semet F, Talbi E-G (2007) Target Aiming Pareto Search and its application to the vehicle routing problem with route balancing. Journal of Heuristics 13(5):455–469

    Article  Google Scholar 

  • Jozefowiez N, Semet F, Talbi E-G (2009) An evolutionary algorithm for the vehicle routing problem with route balancing. Eur J Oper Res 195:761–769

    Article  Google Scholar 

  • Kennedy J, Eberhart RC (1995) Particle swarm optimization. Proceedings of IEEE International Conference on Neural Networks 4:1942–1948

    Article  Google Scholar 

  • Kennedy J, Eberhart RC (2001) Swarm intelligence. Kaufman, San Francisco

    Google Scholar 

  • Li HL (1996) An efficient method for solving linear goal programming problems. J Optim Theor Appl 90(2):465–469

    Article  Google Scholar 

  • Li X, Tian P (2006) An ant colony system for the open vehicle routing problem. In: Dorigo M (ed) Lecture Notes in Computer Science (ANTS2006), Springer, 4150: pp 356–363

  • Murata T, Itai R (2007) Local search in two-fold EMO algorithm to enhance solution similarity for multi-objective vehicle routing problems. In: Obayashi S, Deb K, Poloni C, Hiroyasu T, Murata T (eds) EMO 2007, Springer-Verlag, 4403: pp 201–215

  • Qureshi AG, Taniguchi E, Yamada T (2009) An exact solution approach for vehicle routing and scheduling problems with soft time windows. Transport Res E 45:960–977

    Article  Google Scholar 

  • Repoussis PP, Tarantilis CD, Ioannou G (2007) The open vehicle routing problem with time windows. J Oper Res Soc 58:355–367

    Article  Google Scholar 

  • Repoussis PP, Tarantilis CD, Ioannou G (2009) An evolutionary algorithm for the open vehicle routing problem with time windows, In: Pereira FB, Tavares J (eds) Bio-inspired algorithms for the vehicle routing problems, Studies in Computational Intelligence, Springer, Vol. 161: pp 55–75

  • Repoussis PP, Tarantilis CD, Braysy O, Ioannou G (2010) A hybrid evolution strategy for the open vehicle routing problem. Comput Oper Res 37:443–455

    Article  Google Scholar 

  • Sariklis D, Powell S (2000) A heuristic method for the open vehicle routing problem. J Oper Res Soc 51:564–573

    Google Scholar 

  • Schott J.R (1995) Fault tolerant design using single and multicriteria genetic algorithms optimization. Master’s Thesis, Department of Aeronautics and Astronautics, Massachusetts Institute of Technology, Cambridge, MA

  • Schrage L (1981) Formulation and structure of more complex/realistic routing and scheduling problems. Networks 11:229–232

    Article  Google Scholar 

  • Solomon MM (1987) Algorithms for the vehicle routing and scheduling problem with time windows constraints. Oper Res 35:254–265

    Article  Google Scholar 

  • Solomon MM, Desrosiers J (1988) Time window constrained routing and scheduling problems. Transport Sci 22(1):1–13

    Article  Google Scholar 

  • Tarantilis CD, Ioannou G, Kiranoudis CT, Prastacos GP (2004) A threshold accepting approach to the open vehicle routing problem. RAIRO 38:345–360

    Article  Google Scholar 

  • Tarantilis CD, Ioannou G, Kiranoudis CT, Prastacos GP (2005) Solving the open vehicle routing problem via a single parameter metaheuristic algorithm. J Oper Res Soc 56:588–596

    Article  Google Scholar 

  • Wang W, Wu B, Zhao Y, Feng D (2006) Particle swarm optimization for open vehicle routing problem. In: Huang D-S, Li K, Irwin GW (eds) Lecture Notes in Artificial Intelligence (LNAI), Springer, Vol. 4114: pp 999–1007

  • Zhu Q, Qian L, Li Y, Zhu S (2006) An improved particle swarm optimization algorithm for vehicle routing problem with time windows. IEEE Congress on Evolutionary Computation, Vancouver, Canada, July 16–21:1386–1390

    Google Scholar 

  • Zitzler E, Thiele L (1998) Multiobjective optimization using evolutionary algorithmsa comparative case study. In: Eiben AE, Back T, Schoenauer M, Schwefel HP (eds), Fifth International Conference on Parallel Problem Solving from Nature (PPSN-V), Berlin, Germany: pp 292–301

  • Zitzler E, Deb K, Thiele L (2000) Comparison of multiobjective evolutionary algorithms: empirical results. Evol Comput 8(2):173–195

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to R. Tavakkoli-Moghaddam.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Norouzi, N., Tavakkoli-Moghaddam, R., Ghazanfari, M. et al. A New Multi-objective Competitive Open Vehicle Routing Problem Solved by Particle Swarm Optimization. Netw Spat Econ 12, 609–633 (2012). https://doi.org/10.1007/s11067-011-9169-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11067-011-9169-4

Keywords

Navigation