Distribution optimization of the specialized car repair store based on the maximization of market share

With the improvement of people’s living standard, car has become an indispensable means of transportation, and the specialized car service industry is developing rapidly. Therefore, for the car repair stores, it is the core issue to choose suitable location according to the characteristics of car owners and existing competition. This study puts forward a model aiming at the maximum profit rate considering choice preference of car owners, competition, consumption capacity of owners, and capital limit. Then, a genetic algorithm improved in four aspects is proposed to solve the proposed model. Finally, an example and a case study of Dalian expound the application of the proposed models and algorithms in practice. It proved to be effective to China’s national conditions through the analysis of the results.

[1]  Gilbert Laporte,et al.  Exact Solution to a Location Problem with Stochastic Demands , 1994, Transp. Sci..

[2]  David L. Huff,et al.  Defining and Estimating a Trading Area , 1964 .

[3]  Yu Li,et al.  Improved approximation algorithms for the robust fault-tolerant facility location problem , 2012, Inf. Process. Lett..

[4]  Nobuo Matsubayashi,et al.  Strategic multi-store opening under financial constraint , 2011, Eur. J. Oper. Res..

[5]  Pierre Hansen,et al.  Stabilized column generation , 1998, Discret. Math..

[6]  Zvi Drezner,et al.  Consistent and Inconsistent Rules in Competitive Facility Choice , 1996 .

[7]  Rommert Dekker,et al.  A stochastic approach to a case study for product recovery network design , 2005, Eur. J. Oper. Res..

[8]  Charles ReVelle,et al.  THE MAXIMUM CAPTURE OR “SPHERE OF INFLUENCE” LOCATION PROBLEM: HOTELLING REVISITED ON A NETWORK* , 1986 .

[9]  Andreas Klose,et al.  A Lagrangean relax-and-cut approach for the two-stage capacitated facility location problem , 2000, Eur. J. Oper. Res..

[10]  H. Hotelling Stability in Competition , 1929 .

[11]  K. Rosing An Optimal Method for Solving the (Generalized) Multi-Weber Problem , 1992 .

[12]  Baozhen Yao,et al.  An improved particle swarm optimization for carton heterogeneous vehicle routing problem with a collection depot , 2016, Ann. Oper. Res..

[13]  Gaidi Li,et al.  Approximation algorithms for the stochastic priority facility location problem , 2013 .

[14]  Oded Berman,et al.  Competitive facility location model with concave demand , 2007, Eur. J. Oper. Res..

[15]  M. Shirosaki Another proof of the defect relation for moving targets , 1991 .

[16]  Bin Yu,et al.  Passenger boarding choice prediction at a bus hub with real-time information , 2015 .

[17]  É. Taillard,et al.  Improvements and Comparison of Heuristics for solving the Multisource Weber Problem , 1997 .

[18]  Ziyou Gao,et al.  A bi-level programming for bus lane network design , 2015 .

[19]  Yu Li,et al.  A cross-monotonic cost-sharing scheme for the concave facility location game , 2013, J. Glob. Optim..

[20]  A. I. Barros Discrete and Fractional Programming Techniques for Location Models , 1998 .

[21]  Andreas Drexl,et al.  Facility location models for distribution system design , 2005, Eur. J. Oper. Res..

[22]  D. Tcha,et al.  A branch-and-bound algorithm for the multi-level uncapacitated facility location problem , 1984 .

[23]  Bin Yu,et al.  Two-phase optimization approach to transit hub location – the case of Dalian , 2013 .

[24]  Gérard Cliquet,et al.  Optimizing locations through a maximum covering/p-median hierarchical model:Maternity hospitals in France , 2013 .

[25]  Hokey Min,et al.  Multiobjective analysis of facility location decisions , 1990 .

[26]  Joe Chizmarik The Proof of Fermat's Last Theorem , 2016 .

[27]  H. A. Eiselt Modeling Business Problems with Voronoi Diagrams , 2009 .

[28]  Paolo Toth,et al.  A two-phase hybrid heuristic algorithm for the capacitated location-routing problem , 2013, Comput. Oper. Res..

[29]  Mohammad Hossein Fazel Zarandi,et al.  Capacitated location-routing problem with time windows under uncertainty , 2013, Knowl. Based Syst..

[30]  Nalan Gülpinar,et al.  Robust strategies for facility location under uncertainty , 2013, Eur. J. Oper. Res..

[31]  Chao Chen,et al.  Short‐Term Traffic Speed Prediction for an Urban Corridor , 2017, Comput. Aided Civ. Infrastructure Eng..

[32]  David A. Schilling,et al.  DYNAMIC LOCATION MODELING FOR PUBLIC‐SECTOR FACILITIES: A MULTICRITERIA APPROACH , 1980 .

[33]  Yu Li,et al.  Improved Approximation Algorithms for the Facility Location Problems with Linear/Submodular Penalties , 2014, Algorithmica.

[34]  Zixuan Peng,et al.  Stable vessel-cargo matching in dry bulk shipping market with price game mechanism , 2016 .

[35]  Bin Yu,et al.  k-Nearest Neighbor Model for Multiple-Time-Step Prediction of Short-Term Traffic Condition , 2016 .

[36]  P. D. Converse,et al.  New Laws of Retail Gravitation , 1949 .

[37]  J. Beasley Lagrangean heuristics for location problems , 1993 .

[38]  Jason Papathanasiou,et al.  An approximation algorithm for the location of dairy enterprises under time constraints , 2007, Eur. J. Oper. Res..