scholarly journals The multi-period service territory design problem – An introduction, a model and a heuristic approach

Author(s):  
Matthias Bender ◽  
Anne Meyer ◽  
Jörg Kalcsics ◽  
Stefan Nickel
Omega ◽  
2021 ◽  
pp. 102442
Author(s):  
Lin Zhou ◽  
Lu Zhen ◽  
Roberto Baldacci ◽  
Marco Boschetti ◽  
Ying Dai ◽  
...  

2018 ◽  
Vol 10 (4) ◽  
pp. 441-458 ◽  
Author(s):  
Samuel Nucamendi-Guillén ◽  
Dámaris Dávila ◽  
José-Fernando Camacho-Vallejo ◽  
Rosa G. González-Ramírez

2013 ◽  
Vol 16 (2) ◽  
pp. 302-318 ◽  
Author(s):  
Kent McClymont ◽  
Edward C. Keedwell ◽  
Dragan Savić ◽  
Mark Randall-Smith

The water distribution network (WDN) design problem is primarily concerned with finding the optimal pipe sizes that provide the best service for minimal cost; a problem of continuing importance both in the UK and internationally. Consequently, many methods for solving this problem have been proposed in the literature, often using tailored, hand-crafted approaches to more effectively optimise this difficult problem. In this paper we investigate a novel hyper-heuristic approach that uses genetic programming (GP) to evolve mutation operators for evolutionary algorithms (EAs) which are specialised for a bi-objective formulation of the WDN design problem (minimising WDN cost and head deficit). Once generated, the evolved operators can then be used ad infinitum in any EA on any WDN to improve performance. A novel multi-objective method is demonstrated that evolves a set of mutation operators for one training WDN. The best operators are evaluated in detail by applying them to three test networks of varying complexity. An experiment is conducted in which 83 operators are evolved. The best 10 are examined in detail. One operator, GP1, is shown to be especially effective and incorporates interesting domain-specific learning (pipe smoothing) while GP5 demonstrates the ability of the method to find known, well-used operators like a Gaussian.


Author(s):  
Fabian Lopez

Small geographic basic units (BU) are grouped into larger geographic territories on a Territory Design Problem (TDP). Proposed approach to solve a TDP is presented through a study case developed on a large soft drinks company which operates in the city of Monterrey, México. Each BU of our TDP is defined by three activity measures: (1) number of customers, (2) sales volume and (3) workload. Some geographic issues about contiguity and compactness for the territories to be constructed are considered. An optimal solution is obtained when the constructed territories are well balanced taking into consideration each activity measure simultaneously. In particular, contiguity is hard to be represented mathematically. All previous research work indicates that this NP-Hard problem is not suitable for solving on large-scale instances. A new strategy which is based on a hybrid-mixed integer programming (HMIP) approach is developed. Specifically, our implementation is based on a Cut-Generation Strategy. We take advantage from territory centers obtained through a relaxation of a P-median based model. This model has a very high degree of connectivity. Thus, small number of iterations to find connected solutions is required. The authors detail out their methodology and then they proceed to its computational implementation. Experimental results show the effectiveness of our method in finding near-optimal solutions for very large instances up to 10,000 BU’s in short computational times (less than 10 minutes). Nowadays, this model is being used by the firm with important economical benefits.


Author(s):  
Mario A. Solana ◽  
Juan A. Díaz ◽  
Dolores E. Luna

2020 ◽  
Vol 146 ◽  
pp. 113150 ◽  
Author(s):  
M. Gabriela Sandoval ◽  
Juan A. Díaz ◽  
Roger Z. Ríos-Mercado

2012 ◽  
Vol 199 (1) ◽  
pp. 343-360 ◽  
Author(s):  
M. Angélica Salazar-Aguilar ◽  
Roger Z. Ríos-Mercado ◽  
José L. González-Velarde ◽  
Julián Molina

Sign in / Sign up

Export Citation Format

Share Document