Hybrid Nested Partitions and Mathematical Programming Approach and Its Applications

Large-scale discrete optimization problems are difficult to solve, especially when different kinds of real constraints are considered. Conventionally, standard mathematical programming is a general approach for discrete optimization, but may suffer from the unacceptable long solution time in applications. On the other hand, some heuristics/metaheuristics methods are more powerful in finding approximate solutions efficiently, but mostly are problem and constraint dependent. In this paper, we develop a new hybrid nested partitions and mathematical programming approach, which creates compliance between mathematical programming and the heuristics/metaheuristics methods. Potentially applicable to many different types of problems, the hybrid approach can provide approximate solutions efficiently, and in the meantime can easily handle different kinds of constraints. The applications of the hybrid approach to the local pickup and delivery problem (LPDP) and the discrete facility location problem (DFLP) are presented in this paper.

[1]  James F. Campbell.  Hub Location and the p-Hub Median Problem , 1996, Oper. Res..

[2]  Tore Grünert,et al.  Local Search for Vehicle Routing and Scheduling Problems: Review and Conceptual Integration , 2005, J. Heuristics.

[3]  Amelia C. Regan,et al.  Local truckload pickup and delivery with hard time window constraints , 2002 .

[4]  Peter B. Luh,et al.  Scheduling of manufacturing systems using the Lagrangian relaxation technique , 1991, IEEE Trans. Autom. Control..

[5]  LeyuanSHI,et al.  A NESTED PARTITIONS FRAMEWORK FOR SOLVING LARGE-SCALE MULTICOMMODITY FACILITY LOCATION PROBLEMS , 2004 .

[6]  Leyuan Shi,et al.  Nested Partitions Method for Global Optimization , 2000, Oper. Res..

[7]  Warren B. Powell,et al.  Dynamic Models of Transportation Operations , 2003, Supply Chain Management.

[8]  J. K. Lenstra,et al.  Local Search in Combinatorial Optimisation. , 1997 .

[9]  Martin W. P. Savelsbergh,et al.  Efficient Insertion Heuristics for Vehicle Routing and Scheduling Problems , 2004, Transp. Sci..

[10]  Andrew Lim,et al.  A Transportation Problem with Minimum Quantity Commitment , 2006, Transp. Sci..

[11]  Leyuan Shi,et al.  A method for scheduling in parallel manufacturing systems with flexible resources , 2000 .

[12]  Martine Labbé,et al.  A New Formulation and Resolution Method for the p-Center Problem , 2004, INFORMS J. Comput..

[13]  Kamlesh Mathur,et al.  Vehicle Routing and Scheduling with Full Truckloads , 2003, Transp. Sci..

[14]  Leyuan Shi,et al.  IEEE Transactions on Automation Science and Engineering , 2009, IEEE Transactions on Automation Science and Engineering.

[15]  Thomas L. Magnanti,et al.  A Comparison of Mixed - Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems , 2003, Manag. Sci..

[16]  Chak-Kuen Wong,et al.  An Efficient Method for Weighted Sampling Without Replacement , 1980, SIAM J. Comput..

[17]  Warren B. Powell,et al.  Dynamic Control of Logistics Queueing Networks for Large-Scale Fleet Management , 1998, Transp. Sci..

[18]  Joseph B. Mazzola,et al.  Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type , 1999, Eur. J. Oper. Res..

[19]  Arthur M. Geoffrion,et al.  Lagrangian Relaxation for Integer Programming , 2010, 50 Years of Integer Programming.

[20]  Leyuan Shi,et al.  An Optimization Framework for Product Design , 2001, Manag. Sci..

[21]  K. Fagerholt,et al.  A travelling salesman problem with allocation, time window and precedence constraints — an application to ship scheduling , 2000 .

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

[23]  Yves Crama,et al.  Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.

[24]  Morton E. O'Kelly,et al.  Hub location with flow economies of scale , 1998 .

[25]  Jacques Desrosiers,et al.  The Pickup and Delivery Problem with Time Windows , 1989 .

[26]  Matteo Fischetti,et al.  Local branching , 2003, Math. Program..

[27]  Michel Gendreau,et al.  Vehicle Routing Problem with Time Windows, Part II: Metaheuristics , 2005, Transp. Sci..

[28]  James R. Evans,et al.  Aggregation and Disaggregation Techniques and Methodology in Optimization , 1991, Oper. Res..

[29]  Fabián A. Chudak,et al.  Near-optimal solutions to large-scale facility location problems , 2005, Discret. Optim..

[30]  Maged M. Dessouky,et al.  An Exact Algorithm for the Multiple Vehicle Pickup and Delivery Problem , 2004, Transp. Sci..

[31]  G. Nemhauser,et al.  Integer Programming , 2020 .

[32]  Illia Racunica,et al.  OPTIMAL LOCATION OF INTERMODAL FREIGHT HUBS , 2005 .

[33]  James F. Campbell,et al.  Integer programming formulations of discrete hub location problems , 1994 .

[34]  M. Brandeau,et al.  An overview of representative problems in location research , 1989 .

[35]  J. Desrosiers,et al.  Methods for routing with time windows , 1986 .

[36]  Theodora A. Varvarigou,et al.  Application of Genetic Algorithms to a Large-Scale Multiple-Constraint Vehicle Routing Problem , 2003, Int. J. Comput. Intell. Appl..

[37]  Philippe Mahey,et al.  A Survey of Algorithms for Convex Multicommodity Flow Problems , 2000 .

[38]  J A Díaz,et al.  A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem , 2002, J. Oper. Res. Soc..

[39]  Andrew Lim,et al.  Multi-depot vehicle routing problem: a one-stage approach , 2005, IEEE Transactions on Automation Science and Engineering.

[40]  Munirpallam A. Venkataramanan,et al.  Solution approaches to hub location problems , 1998, Ann. Oper. Res..

[41]  Trevor S. Hale,et al.  Location Science Research: A Review , 2003, Ann. Oper. Res..

[42]  BräysyOlli,et al.  Vehicle Routing Problem with Time Windows, Part II , 2005 .

[43]  Jaekyung Yang,et al.  Intelligent Partitioning for Feature Selection , 2005, INFORMS J. Comput..

[44]  Di Yuan,et al.  An exact algorithm for the capacitated facility location problems with single sourcing , 1999, Eur. J. Oper. Res..

[45]  Leyuan Shi,et al.  New parallel randomized algorithms for the traveling salesman problem , 1999, Comput. Oper. Res..

[46]  Zhi-Long Chen,et al.  Solving a Practical Pickup and Delivery Problem , 2003, Transp. Sci..

[47]  Leon F. McGinnis.  A Survey of Recent Results for a Class of Facilities Location Problems , 1977 .

[48]  Rajmohan Rajaraman,et al.  Analysis of a local search heuristic for facility location problems , 2000, SODA '98.