Multiobjective Location Routing Problem considering Uncertain Data after Disasters

• Main Authors: Keliang Chang, Hong Zhou, Guijing Chen, Huiqin Chen
• Format: Article
• Language: English
• Published: Hindawi Limited 2017-01-01
• Series: Discrete Dynamics in Nature and Society
• Online Access: http://dx.doi.org/10.1155/2017/1703608

The relief distributions after large disasters play an important role for rescue works. After disasters there is a high degree of uncertainty, such as the demands of disaster points and the damage of paths. The demands of affected points and the velocities between two points on the paths are uncertain in this article, and the robust optimization method is applied to deal with the uncertain parameters. This paper proposes a nonlinear location routing problem with half-time windows and with three objectives. The affected points can be visited more than one time. The goals are the total costs of the transportation, the satisfaction rates of disaster nodes, and the path transport capacities which are denoted by vehicle velocities. Finally, the genetic algorithm is applied to solve a number of numerical examples, and the results show that the genetic algorithm is very stable and effective for this problem.