Skip to main navigation
Skip to search
Skip to main content
National Yang Ming Chiao Tung University Academic Hub Home
English
中文
Home
Profiles
Research units
Research output
Projects
Prizes
Activities
Equipment
Impacts
Search by expertise, name or affiliation
A network model for solving the yard truck routing and scheduling problem
Feng Ming Tsai
*
,
Chung-Cheng Lu
, Yu Ming Chang
*
Corresponding author for this work
Department of Transportation and Logistics Management
Research output
:
Contribution to journal
›
Article
›
peer-review
11
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'A network model for solving the yard truck routing and scheduling problem'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Berth Allocation
25%
Binary Integer Program
25%
Computational Results
25%
Congestion
25%
Container Terminal
25%
Container Terminal Operations
25%
Crane Operation
25%
Design Methodology
25%
Discharge Process
25%
Export Containers
50%
Fleet Size
25%
International Ports
25%
Loading Method
25%
Network Model
100%
Network Technique
25%
Operation Problem
25%
Operational Network
25%
Optimal number
25%
Port Operators
25%
Practical Operation
25%
Quay Crane
50%
Quayside
25%
Queuing Theory
25%
Real-world Problems
25%
Routing Plan
25%
Routing Problem
100%
Scheduling Plan
25%
Scheduling Problem
100%
Sigma Models
25%
Stacking Plans
25%
Terminal Operators
50%
Time-space Network
25%
Time-space Network Model
25%
Total Operating Cost
25%
Truck Assignment
25%
Truck Routes
100%
Truck Scheduling
100%
Truck Waiting Time
25%
Waiting Time
25%
Yard
50%
Yard Crane
50%
Yard Crane Scheduling
25%
Yard Truck
100%
Computer Science
Actual Practice
25%
Design Experiment
25%
Empirical Research
25%
Integer Programming
25%
Loading Process
25%
Model for Network
100%
Network Operation
25%
Operating Cost
25%
Programming Model
25%
Queuing Theory
25%
Real-World Problem
25%
Routing Problem
100%
Scheduling Problem
100%
Space Dimension
25%
Terminal Operator
50%
Time Dimension
25%
Engineering
Design of Experiments
50%
Limitations
50%
Network Model
100%
Operating Cost
50%
Programming Model
50%
Routing Problem
50%
Space Dimension
50%