Open Access System for Information Sharing

Browse by Researchers

KIM, BYUNG IN (김병인)

Dept of Industrial & Management Engineering(산업경영공학과)

Field(s)

Show more items...

H-INDEX

Chart.

Keyword

DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||DESIGN:7||ALGORITHM:7||Vehicle routing problem:5||OPTIMIZATION:5||Heuristics:5||TIME WINDOWS:5||MODELS:5||SYSTEM:4||SEARCH:3||MODEL:3||cutting stock problem:3||Large neighborhood search:3||Automated material handling system:2||MANUFACTURING SYSTEMS:2||VEHICLEROUTING PROBLEM:2||Skip collection problem:2||BERTHALLOCATION PROBLEM:2||OPERATIONS:2||automated guided vehicle:2||dispatching rule:2||twostage cutting stock problem:2||paper mill industry:2||MILL:2||Waste collection:2||steelworks:2||unloader:2||DOCK ARRANGEMENT:2||Combinatorial optimization:2||Overhead hoist transport:2||intelligent agent:2||PACKING:2||RULES:2||overhead hoist transport:2||HOIST TRANSPORTSYSTEM:2||multiplechoice knapsack problem:2||berth:2||seaport scheduling:2||Logistics:2||FRAMEWORK:2||School bus routing:2||GUIDED VEHICLE SYSTEMS:2||MULTIPLE DISPOSAL FACILITIES:2||transportation:2||reassignment:2||heuristics:2||Particle swarm optimization:2||EMERGENCY EVACUATION:2||CONTAINER PORT:2||LPBASED APPROACH:2||PERFORMANCE:2||Automated guided vehicle:2||Highrise building evacuation:2||knapsack algorithm:2||TRAVELING SALESMAN PROBLEM:2||Agentbased simulation:2||LINEARPROGRAMMING APPROACH:2||Rollonrolloff:1||Rolionrolloff:1||Capacity drop:1||INDIVIDUALS:1||GENERATOR:1||SHUFFLING PROBLEM:1||Mixed load:1||STORAGE:1||Last two fit:1||generic simulation model:1||Semiconductor:1||Parking:1||RESPONSETIME:1||AUTOMATED GUIDED VEHICLES:1||AGVS:1||TRANSPORTATION SCHEDULING PROBLEMS:1||COMPUTER:1||industries : transportation:1||COMMUNICATION:1||Approximation algorithm:1||SHORTEST PATHS:1||COLUMN GENERATION:1||Capacitated vehicle routing problem:1||SOFTWARE:1||Generic simulation:1||linearisation:1||Vehicle routing:1||Bin packing:1||Manpower scheduling:1||LIVENESS ENFORCING SUPERVISORS:1||Circulation:1||hierarchical:1||holon:1||WORKSTATION CONTROLLER:1||TECHNOLOGY:1||Shortest path algorithms:1||EXACT ALGORITHM:1||AGENTS:1||mixed integer linear program:1||DELIVERY POINTS:1||First fit decreasing:1||Benchmark problem:1||WAFERFAB:1||AMHS:1||TOOL:1||POLICY:1||VEHICLES:1||TIME:1||CONTROL ARCHITECTURES:1||SPEEDUP TECHNIQUES:1||Controlled evacuation:1||SHIP STOWAGE PROBLEM:1||Sweep algorithm:1||NUMBER:1||SCHEDULING PROBLEM:1||LOWER BOUNDS:1||Rawmaterial:1||AutoMod:1||MINIMIZE:1||TABU SEARCH:1||transportation : vehicle routing:1||hybrid framework:1||Origindestination matrix:1||MAXIMUM COLLECTION PROBLEM:1||Routing:1||Emergency elevator evacuation:1||Phased evacuation:1||Assembly lines:1||CUTTING STOCK PROBLEMS:1||ALLOCATION:1||Blocking:1||RESOURCES:1||Idle vehicle:1||Literature survey:1||warehouse management:1||AUTONOMOUS AGENTS:1||NEGOTIATION:1||NEIGHBORHOOD SEARCH:1||SIMULATION:1||Metaheuristics:1||Emergency evacuation DSS:1||RETRIEVALSYSTEM:1||GIS:1||LINEARMODELS:1||Yard allocation:1||assignment problem:1||FLEXIBLE MANUFACTURING SYSTEMS:1||manufacturing systems control:1||ARRIVAL TIME CONTROL:1||COOPERATION:1||SOLIDWASTE:1||Optimization:1||DECISIONSUPPORTSYSTEM:1||DISPATCHING RULES:1||waste collection:1||bin packing problem:1||STATE:1||SYSTEMS:1||LOOP LAYOUT:1||heterarchical:1||CELL:1||GRAPHS:1||Team orienteering problem:1||SOLIDWASTE COLLECTION:1||MANAGEMENT:1||steel stacking problem:1||SCHEDULES:1||vehicle routing problems with time windows:1||capacitated clustering:1||steel mother plate design:1||ALGORITHMS:1||JOBTEAMING CONSTRAINTS:1||Steel industry:1||layout:1||OPERATIONAL ISSUES:1||CONSTRAINTS:1||shipping:1||hybrid:1||Real road networks:1||

Open Access System for Information Sharing

H-INDEX

Keyword

Publication & Time Cited Count(For the Last 5 years)

Browse

Publication & Time Cited Count
(For the Last 5 years)