Next Article in Journal
Improving Agricultural Water Use Efficiency: A Quantitative Study of Zhangye City Using the Static CGE Model with a CES Water−Land Resources Account
Next Article in Special Issue
Corporate Social Responsibility Motive Attribution by Service Employees in the Parcel Logistics Industry as a Moderator between CSR Perception and Organizational Effectiveness
Previous Article in Journal
Feasibility Study of the Post-2020 Commitment to the Power Generation Sector in South Korea
Previous Article in Special Issue
Probabilistic Graphical Framework for Estimating Collaboration Levels in Cloud Manufacturing
Article Menu
Issue 2 (February) cover image

Export Article

Open AccessArticle
Sustainability 2017, 9(2), 288; doi:10.3390/su9020288

The Emergency Vehicle Routing Problem with Uncertain Demand under Sustainability Environments

1
School of Traffic and Transportation Engineering, Central South University, Changsha 410012, China
2
School of Information Engineering, Wuyi University, Nanping 354300, China
3
Guangzhou Port Company Ltd., Guangzhou 510100, China
4
Dongfang College, Zhejiang University of Finance & Economics, Hangzhou 310000, China
*
Author to whom correspondence should be addressed.
Academic Editor: Ilkyeong Moon
Received: 2 November 2016 / Revised: 8 February 2017 / Accepted: 10 February 2017 / Published: 21 February 2017
(This article belongs to the Special Issue Sustainability in Supply Chain Management)
View Full-Text   |   Download PDF [2625 KB, uploaded 21 February 2017]   |  

Abstract

The reasonable utilization of limited resources is critical to realize the sustainable developments. In the initial 72-h crucial rescue period after the disaster, emergency supplies have always been insufficient and the demands in the affected area have always been uncertain. In order to improve timeliness, utilization and sustainability of emergency service, the allocation of the emergency supplies and the emergency vehicle routes should be determined simultaneously. Assuming the uncertain demands follow normal distribution, an optimization model for the emergency vehicle routing, by considering the insufficient supplies and the uncertain demands, is developed. The objective function is applied to minimize the total costs, including the penalty costs induced by more or less supplies than the actual demands at all demand points, as well as the constraints of the time windows and vehicle load capacity taken into account. In more details, a solution method for the model, based on the genetic algorithm, is proposed, which solves the problem in two stages. A numerical example is presented to demonstrate the efficiency and validity of the proposed model and algorithm. View Full-Text
Keywords: critical rescue period; vehicle routing; insufficient supplies; time windows; genetic algorithm critical rescue period; vehicle routing; insufficient supplies; time windows; genetic algorithm
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Qin, J.; Ye, Y.; Cheng, B.-R.; Zhao, X.; Ni, L. The Emergency Vehicle Routing Problem with Uncertain Demand under Sustainability Environments. Sustainability 2017, 9, 288.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Sustainability EISSN 2071-1050 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top