Shipping problems with body clock constraints

Authors:
Yen-Liang Chen;Li-Jen Hsiao
Affiliations:
Department of Information Management, National Central University, Chung-Li, 320 Taiwan, ROC;Department of Information Management, Van-Nung Institute of Technology, Chung-Li, 320 Taiwan, ROC
Venue:
Computers and Operations Research
Year:
2003

Citing 7
Cited 0

Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
Vehicle routing with time windows

Operations Research
Lagrangian relaxation methods for solving the minimum fleet size multiple traveling salesman problem with time windows

Management Science
A new optimization algorithm for the vehicle routing problem with time windows

Operations Research
A two-stage heuristic approach for the newspaper delivery problem

Computers and Industrial Engineering - Special issue: IE in Korea
Multicriteria pickup and delivery problem with transfer opportunity

Computers and Industrial Engineering

Quantified Score

Hi-index	0.01

Visualization

Abstract

Time window has been a common form of time constraint considered in the literature. Basically, a time window is a time period, defined by the earliest and latest times, when a node is available for traveling through. Although many variants of transportation problem in time-window networks have been proposed, no one consider the possibility that time windows may be associated with the moving travelers or vehicles so that they can travel only in these time periods. In this paper, this new variant of time-window constraint, called body clock constraint, is proposed. We assume that each vehicle has its own body clock and a capacity limitation for carrying goods, and we are requested to determine a minimal time schedule for sending a certain amount of goods from source to destination in a time-window network. Specifically, the problem is studied in two cases, where the first case considers single-vehicle scheduling and the second multiple vehicles. For both of them, algorithms are presented to find the optimum schedule.