Abstract

This paper introduces a new distributed approach to solve multi-objective planning problem applied to multimodal transport network planning (MTNP) problem. In this problem, the commodities should be transported on the international network by at least two different transport modes. The main goal is to find the best multimodal transportation modes and itineraries. The aim of the new approach has assured us that a distributed optimization. We split the MTNP problem into two sub-problems. These sub-problems are the assignment and the planning problems. Each sub-problem is solved at a corresponding layer. Each layer is executed by an agent. These agents interact, collaborate and communicate together to solve the MTNP problem. In this paper, we contribute by introducing a multi-layer distributed approach to solve real case’s problems. Firstly, we define the MTNP problem as a distributed constraint satisfaction multi-criteria optimization problem (DCSMOP). Secondly, we show that the split of the main problem reduces the computational complexity and the communication between the planner agent and the modes agents lead to faster convergence. The experimental results are proof of this work efficiently. This method proves their efficiency, according to the complexity of the problem and the exchange of information, the computational time and the solution quality.

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.