QUALITY ANALYSIS FOR THE VRP SOLUTIONS USING COMPUTER VISION TECHNIQUES

The Vehicle Routing Problem (VRP) is a classical problem, and when the number of customers is very large, the task of finding the optimal solution can be extremely complex. It is still necessary to find an effective way to evaluate the quality of solutions when there is no known optimal solution. This work presents a suggestion to analyze the quality of vehicle routes, based only on their geometric properties. The proposed descriptors aim to be invariants in relation to the amount of customers, vehicles and the size of the covered area. Applying the methodology proposed in this work it is possible to obtain the route and, then, to evaluate the quality of solutions obtained using computer vision. Despite considering problems with different configurations for the number of customers, vehicles and service area, the results obtained with the experiments show that the proposal is useful for classifying the routes into good or bad classes. A visual analysis was performed using the Parallel Coordinates and Viz3D techniques and then a classification was performed by a Backpropagation Neural Network, which indicated an accuracy rate of 99.87%.

[1]  Juan José Miranda Bront,et al.  A cluster-first route-second approach for the swap body vehicle routing problem , 2017, Ann. Oper. Res..

[2]  Burak Eksioglu,et al.  The vehicle routing problem: A taxonomic review , 2009, Comput. Ind. Eng..

[3]  Billy E. Gillett,et al.  A Heuristic Algorithm for the Vehicle-Dispatch Problem , 1974, Oper. Res..

[4]  David Ronen,et al.  Perspectives on practical aspects of truck routing and scheduling , 1988 .

[5]  Maria Cristina Ferreira de Oliveira,et al.  Viz3D: effective exploratory visualization of large multidimensional data sets , 2004, Proceedings. 17th Brazilian Symposium on Computer Graphics and Image Processing.

[6]  Geoffrey E. Hinton,et al.  Learning representations by back-propagating errors , 1986, Nature.

[7]  Jean-Yves Potvin,et al.  Vehicle Routing , 2009, Encyclopedia of Optimization.

[8]  T. Kamae,et al.  Can one measure the temperature of a curve? , 1986 .

[9]  Gilbert Laporte,et al.  An Improved Petal Heuristic for the Vehicle Routeing Problem , 1996 .

[10]  Jaime Cerdá,et al.  A sweep-heuristic based formulation for the vehicle routing problem with cross-docking , 2013, Comput. Chem. Eng..

[11]  A Assad,et al.  MODELING AND IMPLEMENTATION ISSUES IN VEHICLE ROUTING , 1988 .

[12]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[13]  Luciano da Fontoura Costa,et al.  Shape Analysis and Classification: Theory and Practice , 2000 .

[14]  Ramasamy Panneerselvam,et al.  A Survey on the Vehicle Routing Problem and Its Variants , 2012 .

[15]  Gilbert Laporte,et al.  Fifty Years of Vehicle Routing , 2009, Transp. Sci..

[16]  Roberto Marcondes Cesar Junior,et al.  Shape Analysis and Classification using Landmarks: Polygonal Wavelet Transform , 2002, ECAI.

[17]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[18]  Alfred Inselberg,et al.  The plane with parallel coordinates , 1985, The Visual Computer.

[19]  David M. Ryan,et al.  An Integer Programming Approach to the Vehicle Scheduling Problem , 1976 .

[20]  Lawrence Bodin,et al.  Classification in vehicle routing and scheduling , 1981, Networks.

[21]  Kris Braekers,et al.  The vehicle routing problem: State of the art classification and review , 2016, Comput. Ind. Eng..

[22]  Nicos Christofides,et al.  Combinatorial optimization , 1979 .

[23]  Ben Shneiderman,et al.  Readings in information visualization - using vision to think , 1999 .

[24]  Gilbert Laporte,et al.  Heuristics for the Vehicle Routing Problem , 2014, Vehicle Routing.

[25]  Mohammad Al Hasan,et al.  ORIGAMI: A Novel and Effective Approach for Mining Representative Orthogonal Graph Patterns , 2008 .

[26]  Ángel Corberán,et al.  Separating capacity constraints in the CVRP using tabu search , 1998, Eur. J. Oper. Res..

[27]  Fred Glover,et al.  Extensions of the Petal Method for Vehicle Routeing , 1993 .

[28]  Michel Gendreau,et al.  Implicit depot assignments and rotations in vehicle routing heuristics , 2014, Eur. J. Oper. Res..