Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm

This study considers a multi-objective dynamic stochastic districting and routing problem in which the customers of a territory stochastically evolve over several periods of a planning horizon, and where the number of service vehicles, the compactness of the districts, the dissimilarity measure of the districts and an equity measure of vehicles profit are considered as objectives. The problem is modeled and solved as a two-stage stochastic program, where in each period, districting decisions are made in the first stage, and the Beardwood-Halton-Hammersley formula is used to approximate the expected routing cost of each district in the second stage. An enhanced multi-objective evolutionary algorithm (MOEA), i.e., the preference-inspired co-evolutionary algorithm using mating restriction, is developed for the problem. The algorithm is tested on randomly generated instances and is compared with two state-of-the-art MOEAs. Computational results confirm the superiority and effectiveness of the proposed algorithm. Moreover, a procedure for selecting a preferred design for the proposed problem is described. HighlightsWe consider a multi-objective dynamic stochastic districting and routing problem.An enhanced co-evolutionary algorithm called PICEA-g-mr is proposed.The PICEA-g-mr outperforms two MOEAs on randomly generated instances.A procedure for selecting a preferred design for the problem is illustrated.

[1]  Elena Fernández,et al.  A reactive GRASP for a commercial territory design problem with multiple balancing requirements , 2009, Comput. Oper. Res..

[2]  Hisao Ishibuchi,et al.  Mating Scheme for Controlling the Diversity-Convergence Balance for Multiobjective Optimization , 2004, GECCO.

[3]  José Luis González Velarde,et al.  GRASP strategies for a bi-objective commercial territory design problem , 2013, J. Heuristics.

[4]  Jacques A. Ferland,et al.  Decision Support System for the School Districting Problem , 1990, Oper. Res..

[5]  J. Beardwood,et al.  The shortest path through many points , 1959, Mathematical Proceedings of the Cambridge Philosophical Society.

[6]  Robert G. Cromley,et al.  Multi-Objective Analysis of School District Regionalization Alternatives in Connecticut* , 1996 .

[7]  Peter J. Fleming,et al.  Preference-inspired co-evolutionary algorithm using adaptively generated goal vectors , 2013, 2013 IEEE Congress on Evolutionary Computation.

[8]  Peter J. Fleming,et al.  Preference-Driven Co-evolutionary Algorithms Show Promise for Many-Objective Optimisation , 2011, EMO.

[9]  Peter J. Fleming,et al.  Evolutionary many-objective optimisation: an exploratory analysis , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[10]  M. Angélica Salazar-Aguilar,et al.  A bi-objective programming model for designing compact and balanced territories in commercial districting , 2011 .

[11]  Andreas Drexl,et al.  Fast Approximation Methods for Sales Force Deployment , 1999 .

[12]  Michel Gendreau,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers , 1996, Oper. Res..

[13]  Hisao Ishibuchi,et al.  A Similarity-Based Mating Scheme for Evolutionary Multiobjective Optimization , 2003, GECCO.

[14]  Bo Guo,et al.  The capacitated vehicle routing problem with stochastic demands and time windows , 2011, Comput. Oper. Res..

[15]  Sönke Albers,et al.  COSTA: Contribution Optimizing Sales Territory Alignment , 1998 .

[16]  Peter J. Fleming,et al.  "Whatever Works Best for You"- A New Method for a Priori and Progressive Multi-objective Optimisation , 2013, EMO.

[17]  Tao Zhang,et al.  Dynamic design of sales territories , 2015, Comput. Oper. Res..

[18]  Gary B. Lamont,et al.  Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation) , 2006 .

[19]  Qingfu Zhang,et al.  MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition , 2007, IEEE Transactions on Evolutionary Computation.

[20]  Hermann Gehring,et al.  A Parallel Hybrid Evolutionary Metaheuristic for the Vehicle Routing Problem with Time Windows , 1999 .

[21]  Patrick Jaillet,et al.  A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited , 1988, Oper. Res..

[22]  Peter J. Fleming,et al.  Many-Objective Optimization: An Engineering Design Perspective , 2005, EMO.

[23]  Marco Laumanns,et al.  SPEA2: Improving the Strength Pareto Evolutionary Algorithm For Multiobjective Optimization , 2002 .

[24]  Rajan Batta,et al.  A simulated annealing approach to police district design , 2002, Comput. Oper. Res..

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

[26]  Hisao Ishibuchi,et al.  Evolutionary many-objective optimization: A short review , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[27]  Peter J. Fleming,et al.  Multiobjective genetic algorithms made easy: selection sharing and mating restriction , 1995 .

[28]  Peter J. Fleming,et al.  Preference-Inspired Coevolutionary Algorithms for Many-Objective Optimization , 2013, IEEE Transactions on Evolutionary Computation.

[29]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics) , 2007 .

[30]  Gilbert Laporte,et al.  Solving a home-care districting problem in an urban setting , 2003, J. Oper. Res. Soc..

[31]  Gilbert Laporte,et al.  A tabu search heuristic and adaptive memory procedure for political districting , 2003, Eur. J. Oper. Res..

[32]  Peter J. Fleming,et al.  Local preference-inspired co-evolutionary algorithms , 2012, GECCO '12.

[33]  Kalyanmoy Deb,et al.  Evaluating the -Domination Based Multi-Objective Evolutionary Algorithm for a Quick Computation of Pareto-Optimal Solutions , 2005, Evolutionary Computation.

[34]  Roger Z. Ríos-Mercado,et al.  Embotelladoras ARCA Uses Operations Research to Improve Territory Design Plans , 2013, Interfaces.

[35]  Qingfu Zhang,et al.  Multiobjective evolutionary algorithms: A survey of the state of the art , 2011, Swarm Evol. Comput..

[36]  Eckart Zitzler,et al.  HypE: An Algorithm for Fast Hypervolume-Based Many-Objective Optimization , 2011, Evolutionary Computation.

[37]  Peter J. Fleming,et al.  The iPICEA-g: a new hybrid evolutionary multi-criteria decision making approach using the brushing technique , 2015, Eur. J. Oper. Res..

[38]  Gilbert Laporte,et al.  Designing delivery districts for the vehicle routing problem with stochastic demands , 2007, Eur. J. Oper. Res..

[39]  Douglas M. King,et al.  Geo-Graphs: An Efficient Model for Enforcing Contiguity and Hole Constraints in Planar Graph Partitioning , 2012, Oper. Res..

[40]  John Gunnar Carlsson,et al.  Dividing a Territory Among Several Vehicles , 2012, INFORMS J. Comput..

[41]  Julián Molina Luque,et al.  Multiobjective scatter search for a commercial territory design problem , 2012, Ann. Oper. Res..

[42]  Sean Forman.  Congressional Redistricting Using A TSP-based Genetic Algorithm , 2002, GECCO.

[43]  Peter J. Fleming,et al.  Preference-inspired co-evolutionary algorithms using weight vectors , 2015, Eur. J. Oper. Res..

[44]  Gilbert Laporte,et al.  Districting for Arc Routing , 2014, INFORMS J. Comput..

[45]  Antonio Galvão Naclério Novaes,et al.  Solving continuous location-districting problems with Voronoi diagrams , 2009, Comput. Oper. Res..

[46]  Peter J. Fleming,et al.  On the Evolutionary Optimization of Many Conflicting Objectives , 2007, IEEE Transactions on Evolutionary Computation.

[47]  Peter J. Fleming,et al.  Multiobjective optimization and multiple constraint handling with evolutionary algorithms. I. A unified formulation , 1998, IEEE Trans. Syst. Man Cybern. Part A.

[48]  John Gunnar Carlsson,et al.  Dividing a Territory Among Several Facilities , 2013, INFORMS J. Comput..

[49]  Bo Guo,et al.  Districting for routing with stochastic customers , 2012, EURO J. Transp. Logist..

[50]  Peter J. Fleming,et al.  General framework for localised multi-objective evolutionary algorithms , 2014, Inf. Sci..

[51]  Peter J. Fleming,et al.  Genetic Algorithms for Multiobjective Optimization: FormulationDiscussion and Generalization , 1993, ICGA.

[52]  Kalyanmoy Deb,et al.  Multi-objective optimization using evolutionary algorithms , 2001, Wiley-Interscience series in systems and optimization.

[53]  Bruno Simeone,et al.  Local search algorithms for political districting , 2008, Eur. J. Oper. Res..

[54]  G. Nemhauser,et al.  An Optimization Based Heuristic for Political Districting , 1998 .

[55]  Wang Yin Chai,et al.  A Multiobjective Hybrid Metaheuristic Approach for GIS-based Spatial Zoning Model , 2004, J. Math. Model. Algorithms.

[56]  Gary L. Haith,et al.  Comparing a coevolutionary genetic algorithm for multiobjective optimization , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[57]  Stefan Nickel,et al.  Towards a unified territorial design approach — Applications, algorithms and GIS integration , 2005 .

[58]  José Rui Figueira,et al.  Multiple criteria districting problems , 2007, Ann. Oper. Res..

[59]  Bruce L. Golden,et al.  The Consistent Vehicle Routing Problem , 2009, Manuf. Serv. Oper. Manag..

[60]  Gilbert Laporte,et al.  Designing New Electoral Districts for the City of Edmonton , 2011, Interfaces.

[61]  Erick Delage,et al.  Robust Partitioning for Stochastic Multivehicle Routing , 2012, Oper. Res..

[62]  Gary B. Lamont,et al.  Evolutionary Algorithms for Solving Multi-Objective Problems , 2002, Genetic Algorithms and Evolutionary Computation.

[63]  Gilbert Laporte,et al.  A Priori Optimization of the Probabilistic Traveling Salesman Problem , 1994, Oper. Res..