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

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.

[1]  D Sariklis,et al.  A heuristic method for the open vehicle routing problem , 2000, J. Oper. Res. Soc..

[2]  Christos D. Tarantilis,et al.  An Evolutionary Algorithm for the Open Vehicle Routing Problem with Time Windows , 2009, Bio-inspired Algorithms for the Vehicle Routing Problem.

[3]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[4]  Eiichi Taniguchi,et al.  Travel Time Reliability in Vehicle Routing and Scheduling with Time Windows , 2006 .

[5]  Gen-ke Yang,et al.  Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem , 2006 .

[6]  Mohammad Saeed Jabalameli,et al.  An Efficient Hybrid Particle Swarm Optimization Algorithm for Solving the Uncapacitated Continuous Location-Allocation Problem , 2012 .

[7]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[8]  Michel Gendreau,et al.  An exact epsilon-constraint method for bi-objective combinatorial optimization problems: Application to the Traveling Salesman Problem with Profits , 2009, Eur. J. Oper. Res..

[9]  Panagiotis P. Repoussis,et al.  The open vehicle routing problem with time windows , 2007, J. Oper. Res. Soc..

[10]  Tadahiko Murata,et al.  Local Search in Two-Fold EMO Algorithm to Enhance Solution Similarity for Multi-objective Vehicle Routing Problems , 2006, EMO.

[11]  Nicolas Jozefowiez,et al.  Target aiming Pareto search and its application to the vehicle routing problem with route balancing , 2007, J. Heuristics.

[12]  José Brandão,et al.  A tabu search algorithm for the open vehicle routing problem , 2004, Eur. J. Oper. Res..

[13]  Richard W. Eglese,et al.  A new tabu search heuristic for the open vehicle routing problem , 2005, J. Oper. Res. Soc..

[14]  Ching-Ter Chang,et al.  A linearization method for mixed 0-1 polynomial programs , 2000, Comput. Oper. Res..

[15]  Lothar Thiele,et al.  Multiobjective Optimization Using Evolutionary Algorithms - A Comparative Case Study , 1998, PPSN.

[16]  Jason R. Schott.  Fault Tolerant Design Using Single and Multicriteria Genetic Algorithm Optimization. , 1995 .

[17]  Voratas Kachitvichyanukul,et al.  A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery , 2009, Comput. Oper. Res..

[18]  Jacques Desrosiers,et al.  Survey Paper - Time Window Constrained Routing and Scheduling Problems , 1988, Transp. Sci..

[19]  Nicolas Jozefowiez,et al.  An evolutionary algorithm for the vehicle routing problem with route balancing , 2009, Eur. J. Oper. Res..

[20]  Krzysztof Fleszar,et al.  A variable neighbourhood search algorithm for the open vehicle routing problem , 2009, Eur. J. Oper. Res..

[21]  Christos D. Tarantilis,et al.  A threshold accepting approach to the Open Vehicle Routing problem , 2004, RAIRO Oper. Res..

[22]  Qing Zhu,et al.  An Improved Particle Swarm Optimization Algorithm for Vehicle Routing Problem with Time Windows , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[23]  Eiichi Taniguchi,et al.  An exact solution approach for vehicle routing and scheduling problems with soft time windows , 2009 .

[24]  Lothar Thiele,et al.  Comparison of Multiobjective Evolutionary Algorithms: Empirical Results , 2000, Evolutionary Computation.

[25]  Panagiotis P. Repoussis,et al.  A hybrid evolution strategy for the open vehicle routing problem , 2010, Comput. Oper. Res..

[26]  Linus Schrage,et al.  Formulation and structure of more complex/realistic routing and scheduling problems , 1981, Networks.

[27]  Yueyue Fan,et al.  Optimal Routing for Maximizing the Travel Time Reliability , 2006 .

[28]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[29]  Jean-François Cordeau,et al.  VRP with Time Windows , 1999, The Vehicle Routing Problem.

[30]  Michel Gendreau,et al.  Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms , 2005, Transp. Sci..

[31]  Andrzej Jaszkiewicz,et al.  Multiple objective metaheuristic algorithms for combinatorial optimization , 2001 .

[32]  Kalyanmoy Deb,et al.  A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimisation: NSGA-II , 2000, PPSN.

[33]  Mingyong Lai,et al.  The open vehicle routing problem with fuzzy demands , 2010, Expert Syst. Appl..

[34]  H. L. Li,et al.  An efficient method for solving linear goal programming problems , 1996 .

[35]  Bruce L. Golden,et al.  VEHICLE ROUTING: METHODS AND STUDIES , 1988 .

[36]  Michael G.H. Bell,et al.  Mixed Route Strategies for the Risk-Averse Shipment of Hazardous Materials , 2006 .

[37]  Xiangyong Li,et al.  An Ant Colony System for the Open Vehicle Routing Problem , 2006, ANTS Workshop.

[38]  Bin Wu,et al.  Particle swarm optimization for open vehicle routing problem , 2006 .

[39]  Fred W. Glover,et al.  Technical Note - Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program , 1974, Oper. Res..

[40]  Christos D. Tarantilis,et al.  Solving the open vehicle routeing problem via a single parameter metaheuristic algorithm , 2005, J. Oper. Res. Soc..

[41]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.