Robust Optimization of a Distribution Network Location-Routing Problem Under Carbon Trading Policies

Zhou, Yufeng; H, Yu; Li, Zhi; Su, Jiafu; Changshi, Liu

doi:10.1109/access.2020.2979259

Cited by 31 publications

(25 citation statements)

References 49 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Information such as the vehicle's computing power, location, driving direction and speed can be periodically interacted with base stations by CAM messages. The system scheduling decision is b t k ∈ðb 1 ; b 2 ; ⋯; b m ; b mþ1 Þ , where b t k indicates that the computing task that arrives at time t is placed in the corresponding computing processing queue k [9]. Therefore, when the computing request of vehicle users arrives, how to allocate computing tasks to the corresponding calculation service queue, and thus ensure the delay requirement of the long message security service, which allows the system to have the greatest alarm revenue.…”

Section: System Model Analysismentioning

confidence: 99%

“…The alarm communication under IoV is extremely susceptible to the impact of surrounding environments, such as the surrounding buildings, the interference of surrounding channels, and the poor network coverage of roadside units [8,9]. (3) Strict Quality of Service (QoS) requirements: Due to the suddenness of road traffic accidents, information transmission between vehicles needs to have strong timeliness and reliability requirements.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A collaborative scheduling strategy for IoV computing resources considering location privacy protection in mobile edge computing environment

2020

View full text Add to dashboard Cite

This paper proposes a collaborative scheduling strategy for computing resources of the Internet of vehicles considering location privacy protection in the mobile edge computing environment. Firstly, a multi area multi-user multi MEC server system is designed, in which a MEC server is deployed in each area, and multiple vehicle user equipment in an area can offload computing tasks to MEC servers in different areas by a wireless channel. Then, considering the mobility of users in Internet of vehicles, a vehicle distance prediction based on Kalman filter is proposed to improve the accuracy of vehicle-to-vehicle distance. However, when the vehicle performs the task, it needs to submit the real location, which causes the problem of the location privacy disclosure of vehicle users. Finally, the total cost of communication delay, location privacy of vehicles and energy consumption of all users is formulated as the optimization goal, which take into account the system state, action strategy, reward and punishment function and other factors. Moreover, Double DQN algorithm is used to solve the optimal scheduling strategy for minimizing the total consumption cost of system. Simulation results show that proposed algorithm has the highest computing task completion rate and converges to about 80% after 8000 iterations, and its performance is more ideal compared with other algorithms in terms of system energy cost and task completion rate, which demonstrates the effectiveness of our proposed scheduling strategy.

show abstract

Section: System Model Analysismentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A collaborative scheduling strategy for IoV computing resources considering location privacy protection in mobile edge computing environment

2020

View full text Add to dashboard Cite

show abstract

“…Since Danzig and Ramser [8] first introduced the basic VRP model, vehicle scheduling in goods distribution system has garnered much attention. The literature is rich in studies on variant models and algorithms of VRP, such as the location routing problem [9] and the production routing problem [10]. In contrast, this study focuses on the disruption recovery of unpredictable events in perishable goods.…”

Section: ⅱ Literature Reviewmentioning

confidence: 99%

A Disruption Recovery Model for Time-Dependent Vehicle Routing Problem With Time Windows in Delivering Perishable Goods

Bin

Zhou

2020

IEEE Access

View full text Add to dashboard Cite

In delivering perishable goods, certain unexpected disruptive events may cause the initial routing scheme to be infeasible. A new routing scheme must be generated quickly to alleviate delivery disturbances. According to the idea of disruption management, a disruption recovery model with a distinctive type of split delivery is developed for inter-route recourse based on an initial time-dependent vehicle routing model with time windows, which synthesizes the perishable nature of delivered goods and dynamic travel route choice in urban road networks. Then, a tabu search algorithm is proposed to solve the initial routing problem and further extended to generate the disruption recovery plan. Three computational experiments on the instances adapted from Solomon's and Gehring and Homberger's benchmark problems are conducted to illustrate the effectiveness of the proposed model and algorithm. INDEX TERMS Vehicle routing, disruption management, time-dependent, time windows, split delivery.

show abstract

“…Integer optimization is an NP-hard problem [32], and so far no effective general method has appeared.…”

Section: Problem Analysismentioning

confidence: 99%

Joint optimization strategy for QoE-aware encrypted video caching and content distributing in multi-edge collaborative computing environment

2020

View full text Add to dashboard Cite

The video request service of users in 5G network will explode, and adaptive bit rate technology can provide users with reliable video response. Placing video resources on edge servers close to users can overcome the problem of excessive network load similar to traditional centralized cloud platform solutions. Moreover, multiple edge servers can provide caching and transcoding support by collaboration mechanisms, which further improves users’ Quality of Experience (QoE). However, the design difficulty of video caching and content distribution strategies is increased due to the diversity of collaboration mechanisms and the competition between local and collaborative services of edge servers for computing and storage resources. In order to solve this problem, video cache and content distribution problem is modeled as random integer programming problem in the multi-edge server at most two-hop collaboration scenario. In order to improve the security of video data transmission, the video stream is encrypted using an encryption algorithm based on Logistic chaotic-Quantum-dot Cellular Automata (QCA). For improving the efficiency of solving integer programming problems, this paper uses a pyramid intelligent evolution algorithm based on optimal cooperation strategy to solve this problem. Simulation experiments show that our proposed method can obtain higher QoE value compared with several newer methods. In addition, the average access delay of proposed method is shortened by more than 27.98%, which verifies its reliability.

show abstract

Robust Optimization of a Distribution Network Location-Routing Problem Under Carbon Trading Policies

Cited by 31 publications

References 49 publications

A collaborative scheduling strategy for IoV computing resources considering location privacy protection in mobile edge computing environment

A collaborative scheduling strategy for IoV computing resources considering location privacy protection in mobile edge computing environment

A Disruption Recovery Model for Time-Dependent Vehicle Routing Problem With Time Windows in Delivering Perishable Goods

Joint optimization strategy for QoE-aware encrypted video caching and content distributing in multi-edge collaborative computing environment

Contact Info

Product

Resources

About