WebReLog: A Web-based Tool for Disaster Relief Logistics with Vehicle Route Planning

Gupta, Naveen; Gupta, Tanu; Samaddar, S. K.; Roy, Sudip

doi:10.1109/smc.2019.8913925

Cited by 3 publications

(2 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Strategic preparedness and response plan needed during pandemic (ex. or in any natural disaster [2,3,4,15,16]. The study raise the importance of resource routing for emergency response and apply TSP as a tool of emergency management system using geospatial data to plan optimal route thus reducing time and cost of resource distribution.…”

Section: Related Workmentioning

confidence: 99%

“…Cluster analysis can also be combined with Travelling Salesman Problem during this kind of emergency, where TSP is applied in each cluster of categorized customers with most similarities [13,14]. Disconnected disaster affected regions can be combined with single distribution center and TSP can be applied to each of these disconnected regions locally; satisfied by more than one vehicle in-terms of Vehicle Route Planning (VRP) [15,16].…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Evaluation of TSP for Emergency Routing

Zaman¹,

Hasan²,

Ulla³

2021

IJITCS

View full text Add to dashboard Cite

The paper considers the symmetric traveling salesman problem and applies it to sixty-four (64) districts of Bangladesh (with geographic coordinates) as a new instance of the problem of finding an optimized route in need of emergency. It approached three different algorithms namely Integer Linear Programming, Nearest-neighbor, and Metric TSP as exact, heuristic, or approximate methods of solving the NP-hard class of problem to model the emergency route planning. These algorithms have been implanted using computer codes, used IBM ILOG CPLEX parallel optimization, visualized using Geographic Information System tools. The performance of these algorithms also has been evaluated in terms of computational complexity, their run-time, and resulted tour distance using exact, approximate, and heuristic methods to find the best fit of route optimization in emergence thus contributing to the field of combinatorial optimization.

show abstract

Section: Related Workmentioning

confidence: 99%