Abstract

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 theECLiPSesystem 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.

Highlights

  • In the modern freight transportation there are two main distribution strategies: direct shipping and multiechelon distribution

  • The majority of multiechelon systems presented in the literature usually explicitly consider the routing problem at the last level of the transportation system, while a simplified routing problem is considered at higher levels [1]

  • The vast majority of models of optimization in freight transportation and logistics industry have been formulated as the mixed integer programming (MIP) or mixed integer linear programming (MILP) problems and solved using the operations research (OR) methods [2]

Read more

Summary

Introduction

In the modern freight transportation there are two main distribution strategies: direct shipping and multiechelon distribution. The vast majority of models of optimization in freight transportation and logistics industry have been formulated as the mixed integer programming (MIP) or mixed integer linear programming (MILP) problems and solved using the operations research (OR) methods [2]. Their structures are similar and proceed from the principles and requirements of mathematical programming (MP) [2, 3]. The main contribution of this paper is hybrid approach (mixed CP with MP paradigms) to modeling and optimization of the Multi-Echelon Capacitated Vehicle Routing Problems or the similar vehicle routing problems.

Literature Review
Motivation and Contribution
Two-Echelon Capacitated Vehicle Routing Problem as an Illustrative Example
Computational Tests
Conclusion and Discussion on Possible Extension
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call