Multiobjective Vehicle Routing and Scheduling Problem with Time Window Constraints in Hazardous Material Transportation

This paper proposes a novel vehicle routing and scheduling problem in transporting hazardous materials for networks with multiple time-varying attributes. It actually aims to identify all nondominated time-varying paths with departure times at the origin and waiting times at intermediate nodes along...

Full description

Saved in:
Bibliographic Details
Published inJournal of transportation engineering Vol. 131; no. 9; pp. 699 - 707
Main Authors Meng, Qiang, Lee, Der-Horng, Cheu, Ruey Long
Format Journal Article
LanguageEnglish
Published Reston, VA American Society of Civil Engineers 01.09.2005
Subjects
Applied sciences
Exact sciences and technology
Ground, air and sea transportation, marine construction
Hazardous materials
Road transportation and traffic
Routing
Scheduling
TECHNICAL PAPERS
Traffic control
Transportation planning, management and economics
Asia
Singapore
Hazardous materials
Multiple objective analysis
Stress analysis
Vehicle routing problem
Multiobjective programming
Routing
Dangerous material
Scheduling
Algorithm
Dynamic method
Freight transportation
Case study
Road transportation
Numerical analysis
Algorithms
Forwarding
Transportation networks
Transportation network
Example
Problem solving
Online AccessGet full text
ISSN0733-947X
1943-5436
1943-5436
DOI10.1061/(ASCE)0733-947X(2005)131:9(699)

Cover

More Information
Summary:This paper proposes a novel vehicle routing and scheduling problem in transporting hazardous materials for networks with multiple time-varying attributes. It actually aims to identify all nondominated time-varying paths with departure times at the origin and waiting times at intermediate nodes along these paths for a given pair of origin and destination, subject to three kinds of practical constraints: Limited operational time period, and service, and waiting time window constraints at a node. Based on the assumption of linear waiting attributes at a node, the proposed problem can be equivalently transformed into a static multiobjective shortest path problem in an acyclic network reconstructed by the space-time network technique. An efficient dynamic programming method is then developed. In addition, two numerical examples and a case study are carried out to demonstrate the methodology proposed in this paper.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ObjectType-Article-2
ISSN:0733-947X
1943-5436
1943-5436
DOI:10.1061/(ASCE)0733-947X(2005)131:9(699)