Hazardous material transportation problems: A comprehensive overview of models and solution approaches

SS Mohri, M Mohammadi, M Gendreau… - European journal of …, 2022 - Elsevier
This paper provides a comprehensive review in the domain of hazardous material
transportation from an Operational Research point of view. The paper's focus lies on hazmat …

New shades of the vehicle routing problem: Emerging problem formulations and computational intelligence solution methods

J Mańdziuk - IEEE Transactions on Emerging Topics in …, 2018 - ieeexplore.ieee.org
This paper presents an overview of recent advances in the field of the vehicle routing
problem (VRP), based on papers published in high-quality journals during the period from …

Bi-objective vehicle routing for hazardous materials transportation with actual load dependent risks and considering the risk of each vehicle

M Zhang, N Wang, Z He, Z Yang… - IEEE Transactions on …, 2018 - ieeexplore.ieee.org
As a consequence of industrial development, large quantities of hazardous materials are
shipped everyday. Most related studies consider the risks as fixed weights on edges …

A trilevel r-interdiction selective multi-depot vehicle routing problem with depot protection

MEH Sadati, D Aksen, N Aras - Computers & operations research, 2020 - Elsevier
The determination of critical facilities in supply chain networks has been attracting the
interest of the Operations Research community. Critical facilities refer to structures including …

Energy-efficient WLANs with resource and re-association scheduling optimization

C Xu, J Wang, Z Zhu, D Niyato - IEEE Transactions on Network …, 2019 - ieeexplore.ieee.org
Recently, a number of WiFi access points (APs) have been densely deployed to provide
widely available, high-performance Internet services. As such, an energy efficiency issue …

A modified Kruskal's algorithm to improve genetic search for open vehicle routing problem

J Dutta, PS Barma, S Kar, T De - International Journal of Business …, 2019 - igi-global.com
This article has proposed a modified Kruskal's method to increase the efficiency of a genetic
algorithm to determine the path of least distance starting from a central point to solve the …

An accelerated benders decomposition algorithm for the solution of the multi-trip time-dependent vehicle routing problem with time windows

A Fragkogios, Y Qiu, GKD Saharidis… - European Journal of …, 2024 - Elsevier
The logistics companies executing the last mile delivery of goods in urban areas deal every
day with the problem of routing their vehicles, while taking into account multiple trips per …

A hybrid local search algorithm for the sequence dependent setup times flowshop scheduling problem with makespan criterion

Y Wang, X Li, Z Ma - Sustainability, 2017 - mdpi.com
This paper focuses on the flowshop scheduling problem with sequence dependent setup
times (FSSP-SDST), which has been an investigated object for decades as one of the most …

面向复杂物流配送场景的车辆路径规划多任务辅助进化算法

李坚强, 蔡俊创, 孙涛, 朱庆灵, 林秋镇 - 自动化学报, 2024 - aas.net.cn
在现代社会中, 复杂物流配送场景的车辆路径规划问题(Vehicle routing problem, VRP)
一般带有时间窗约束且需要提供同时取送货的服务. 这种复杂物流配送场景的车辆路径规划问题 …

Network Shortest Path Interdiction Problem Based on Generalized Set Coverage

C Ma, T Zuo, HF Zhang - IEEE Transactions on Network …, 2023 - ieeexplore.ieee.org
In the network shortest path interdiction problem, an evader attempts to find the shortest path
between the origin and the destination in a network, while an interdictor attempts to …