A Hybrid Approach to the Optimization of Multiechelon Systems

In freight transportation there are two main distribution strategies: direct shipping and multiechelon distribution. In the direct shipping, vehicles, starting from a depot, bring their freight directly to the destination, while in the multiechelon systems, freight is delivered from the depot to the customers through an intermediate points. Multiechelon systems are particularly useful for logistic issues in a competitive environment. The paper presents a concept and application of a hybrid approach to modeling and optimization of the Multi-Echelon Capacitated Vehicle Routing Problem. Two ways of mathematical programming (MP) and constraint logic programming (CLP) are integrated in one environment. The strengths of MP and CLP in which constraints are treated in a different way and different methods are implemented and combined to use the strengths of both. The proposed approach is particularly important for the discrete decision models with an objective function and many discrete decision variables added up in multiple constraints. An implementation of hybrid approach in the system using Eplex library is presented. The Two-Echelon Capacitated Vehicle Routing Problem (2E-CVRP) and its variants are shown as an illustrative example of the hybrid approach. The presented hybrid approach will be compared with classical mathematical programming on the same benchmark data sets.

[1]  Kenn Steger-Jensen,et al.  Scheduling a single mobile robot for part-feeding tasks of production lines , 2014, J. Intell. Manuf..

[2]  Ignacio E. Grossmann,et al.  A hybrid MILP/CP decomposition approach for the continuous time scheduling of multipurpose batch plants , 2004, Comput. Chem. Eng..

[3]  Pawel Sitek,et al.  Cost optimization of supply chain with multimodal transport , 2012, 2012 Federated Conference on Computer Science and Information Systems (FedCSIS).

[4]  Krzysztof R. Apt,et al.  Constraint logic programming using Eclipse , 2007 .

[5]  Nicos Christofides,et al.  An Algorithm for the Vehicle-dispatching Problem , 1969 .

[6]  Grzegorz Bocewicz,et al.  Declarative approach to cyclic steady state space refinement: periodic process scheduling , 2013 .

[7]  T. Crainic,et al.  ADVANCED FREIGHT TRANSPORTATION SYSTEMS FOR CONGESTED URBAN AREAS , 2004 .

[8]  Mark Wallace,et al.  Integrating Operations Research in Constraint Programming , 2010, Ann. Oper. Res..

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

[10]  Katarzyna Grzybowska,et al.  Sustainability in the Supply Chain: Analysing the Enablers , 2012 .

[11]  Thorsten Koch,et al.  Constraint Integer Programming: A New Approach to Integrate CP and MIP , 2008, CPAIOR.

[12]  David K. Smith.  Theory of Linear and Integer Programming , 1987 .

[13]  Kok de Ag,et al.  Distribution planning for a divergent 2-echelon network without intermediate stocks under service restrictions , 1993 .

[14]  Vipul Jain,et al.  Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems , 2001, INFORMS J. Comput..

[15]  Jaroslaw Wikarek,et al.  A Declarative Framework for Constrained Search Problems , 2008, IEA/AIE.

[16]  Stanislaw Deniziak,et al.  Control and Cybernetics Cost-efficient Synthesis of Multiprocessor Heterogeneous Systems , 2022 .

[17]  Jaroslaw Wikarek,et al.  A hybrid approach to modeling and optimization for supply chain management with multimodal transport , 2013, 2013 18th International Conference on Methods & Models in Automation & Robotics (MMAR).

[18]  Antoni Ligeza.  Improving efficiency in Constraint Logic Programming through constraint modeling with rules and hypergraphs , 2012, 2012 Federated Conference on Computer Science and Information Systems (FedCSIS).

[19]  Daniele Vigo,et al.  The Two-Echelon Capacitated Vehicle Routing Problem: Models and Math-Based Heuristics , 2011, Transp. Sci..

[20]  Ignacio E. Grossmann,et al.  Computers and Chemical Engineering , 2014 .