Truck Dock Assignment Problem with Time Windows and Capacity Constraint in Transshipment Network Through Crossdocks

2006 ◽  
pp. 688-697 ◽  
Author(s):  
Andrew Lim ◽  
Hong Ma ◽  
Zhaowei Miao
Keyword(s):  
Assignment Problem ◽  
Time Windows ◽  
Capacity Constraint

Virtual Enterprise Planning System using time windows and capacity constraint concepts

2012 ◽  
Author(s):  
Marcosiris A. O. Pessoa ◽  
Fabricio Junqueira ◽  
Diolino J. Santos Filho ◽  
Newton Maruyama ◽  
Lucas A. Moscato ◽  
...  
Keyword(s):  
Time Windows ◽  
Virtual Enterprise ◽  
Capacity Constraint ◽  
Planning System

The Truck Routing and Aircraft Assignment Problem with Time Windows

CICTP 2019 ◽  
2019 ◽  
Author(s):  
Hongqi Li ◽  
Ming Bai ◽  
Haotian Wang ◽  
Xiaorong Jian
Keyword(s):  
Assignment Problem ◽  
Time Windows ◽  
Truck Routing

A Bi-Objective Vehicle Routing Problem with Time Window by Considering Customer Satisfaction

2016 ◽  
Vol 7 (2) ◽  
pp. 16-39 ◽  
Author(s):  
Masoud Rabbani ◽  
Mahyar Taheri ◽  
Mohammad Ravanbakhsh
Keyword(s):  
Customer Satisfaction ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Minimum Distance ◽  
Time Window ◽  
Time Windows ◽  
Time Frame ◽  
Capacity Constraint ◽  
Routing Problem ◽  
Bender's Decomposition

The Vehicle Routing Problem (VRP) by considering Time Windows is an essential and a reality optimization problem consisting in the determination of the set of routes with minimum distance to carry goods, by using some vehicles with capacity constraint; vehicles must visit customers within a time frame. In the recent years, many numbers of algorithm have been considered to solve a single objective formulate of VRPTW problem, such as Meta-heuristic, bender's decomposition, column generation and so on. This paper considers not only the minimum distance and the number of vehicles used to carry goods for customers. The customer satisfaction by considering the priority of the customers is considered which leads to service the customer as soon as possible. In this paper, the MOPSO and NSGAII approaches applied to solve the problem and then the authors compare the results of them; finally, they analysis the sensitivity of the capacity constraint for the vehicles

Project Scheduling with Time Windows and Scarce Resources

2002 ◽  
Author(s):  
Klaus Neumann ◽  
Christoph Schwindt ◽  
Jürgen Zimmermann
Keyword(s):  
Project Scheduling ◽  
Time Windows ◽  
Scarce Resources
Sign in / Sign up

Export Citation Format

Share Document