Daily Arxiv

This is a page that curates AI-related papers published worldwide.
All content here is summarized using Google Gemini and operated on a non-profit basis.
Copyright for each paper belongs to the authors and their institutions; please make sure to credit the source when sharing.

Rich Vehicle Routing Problem in Disaster Management enabling Temporally-causal Transhipments across Multi-Modal Transportation Network

Created by
  • Haebom

Author

Santanu Banerjee, Goutam Sen, Siddhartha Mukhopadhyay

Outline

This paper addresses a complex vehicle routing problem utilizing a variety of vehicles and modes of transport. It allows for multiple journeys by heterogeneous vehicles originating from geographically dispersed depots, and aims to minimize the makespan to minimize disaster response times. Simultaneous and split pickups and deliveries are supported by considering vertices with diverse functions (including transhipment ports), various cargo types, and vehicle-to-cargo and transhipment port-to-cargo compatibility. The proposed cascading minimization approach, implemented using mixed-integer linear programming (MILP), is shown to outperform existing makespan minimization approaches. To facilitate rapid implementation in real-world disaster management decision support systems, a heuristic algorithm (PSR-GIP) utilizing decision tree-based route structuring is developed. This algorithm considers compatibility issues, explores the solution space using probabilistic weighting, prioritizes small route elements and consolidates them into route clusters, and generates multiple independent solutions through various logical aggregation methods and shuffling. Finally, the solutions are transformed to find better neighboring solutions. Performance evaluations of the PSR-GIP heuristic algorithm on a newly generated dataset show that it provides fast and good solutions to real-world problems containing large integer instances that MILP cannot solve.

Takeaways, Limitations

Takeaways:
An efficient stepwise minimization approach and heuristic algorithm (PSR-GIP) for complex vehicle routing problems are presented.
We demonstrate the effectiveness of the PSR-GIP algorithm, which provides fast and good solutions to large-scale problems that are difficult to solve with MILP.
Presenting practical applicability to disaster management decision support systems.
Limitations:
The performance of the proposed heuristic algorithm is limited to the generated data set. Further validation on a variety of real-world data sets is required.
It's difficult to guarantee optimality in heuristic algorithms. Quantitative analysis of the difference from the optimal solution is necessary.
Lack of detailed explanation of decision tree structure and probabilistic weighting settings. Sensitivity analysis of the setting parameters is needed.
👍