Paper Info
Title
Solving Resource Recharging Station Location-routing Problem through a Resource-space-time Network Representation.
Abstract
The resource recharging station location routing problem is a generalization of the location routing problem with sophisticated and critical resource consumption and recharging constraints. Based on a representation of discretized acyclic resource-space-time networks, we propose a generic formulation to optimize dynamic infrastructure location and routes decisions. The proposed integer linear programming formulation could greatly simplify the modeling representation of time window, resource change, and sub-tour constraints through a well-structured multi-dimensional network. An approximation solution framework based on the Lagrangian relaxation is developed to decompose the problem to a knapsack sub-problem for selecting recharging stations and a vehicle routing sub-problem in a space-time network. Both sub-problems can be solved through dynamic programming algorithms to obtain optimal solution. A number of experiments are used to demonstrate the Lagrangian multiplier adjustment-based location routing decision making, as well as the effectiveness of the developed algorithm in large-scale networks.
Year
Venue
Field
2016
arXiv: Optimization and Control
Dynamic programming,Discretization,Mathematical optimization,Vehicle routing problem,Static routing,Lagrange multiplier,Dynamic infrastructure,Lagrangian relaxation,Knapsack problem,Mathematics
DocType
Volume
Citations 
Journal
abs/1602.06889
0
PageRank 
References 
Authors
0.34
6
6
Name
Order
Citations
PageRank
Gongyuan Lu111.04
Xuesong Zhou210312.27
Qiyuan Peng302.70
Bisheng He400.34
Monirehalsadat Mahmoudi500.34
Jun Zhao686987.96