ارائه مدل بهبود یافته حمل و نقل با در نظر گرفتن کل زنجیره تأمین با رویکردمدل سازی ریاضی- قسمت ۴۶
- (Mixed Integer Linear Programming (MILP)) ↑
- (Mixed Integer Non-Linear Programming (MINLP)) ↑
- (Stochastic Mixed Integer Programming (SMIP)) ↑
- (Continuous Approximation (CA)) ↑
- (Location-Allocation (L)) ↑
- (Facility capacity (FC)) ↑
- (Service Region (SR)) ↑
- (Transportation Amount (TA)) ↑
- (Demand Satisfaction Quantity (DS)) ↑
- (Number of Vehicles (NV)) ↑
- (Inventory (I)) ↑
- Cost © ↑
- (Responsiveness (Res)) ↑
- (Robustness (Rob)) ↑
- - domination relation ↑
- - local optimum ↑
- - non-dominated solution ↑
- - global optimum ↑
- - pareto front ↑
- Solution Initialization Method ↑
- Elit Tabu Search ↑
- Quality ↑
- Diversity ↑
- Ideal point ↑
- Dynamic Ideal Point ↑
- (bee colony optimization) ↑
- - tabu list ↑
- - tabu tenure ↑
- - search direction ↑
- - aspiration ↑
- - termination criterion ↑
- K. Deb ↑
- - crowding distance ↑
- (variable neighborhood search(VNS)) ↑
- (neighborhood search structure(NSS)) ↑
- - Comparison Metrics ↑
