Embedded Files
Solving the collaborative bidirectional multi-period vehicle routing problems under a profitsharing agreement using a covering model
Solving the collaborative bidirectional multi-period vehicle routing problems under a profitsharing agreement using a covering model
Location of terminals (nodes) and depots of the study.
Job description
Job description
Remark: Etj = Earliest allowed arrival time of job j, Ltj = Latest allowed arrival time of job j
Configuration of testing instances
Configuration of testing instances
Remark: J = Number of jobs, T = Number of time horizons, K = Number of carriers, S= Number of shippers,
Dj = Demand of job j, R = the total number of feasible routes + = The number of decision variables derived from the data pre-processing
.....................................................................................................................................................................................................
Google Sites
Report abuse